Algorithms are a sequence of steps for accomplishing a task. We use complex algorithms in our day to day tasks for eg. searching in Google, sending emails, booking air tickets etc.
 |
| an example on insertion sort (Photo credit: Wikipedia) |
Characteristics of algorithms
Performance (memory & CPU)
Simplicity
List of Algorithms
- Finding Maximum
- Order Statistics
- Matrix Multiplication
- Comparison
- Linear Search
String searching algorithm (Photo credit: Wikipedia) - Binary Search
- Selection Sort
- Insertion Sort
- Bubble Sort
English: an example on bubble sort. (Photo credit: Wikipedia)
English: Sorting a random list using bubble sort (Photo credit: Wikipedia)
- Heap Sort
- Merge Sort
English: Sorting a random list using merge sort. (Photo credit: Wikipedia)
English: an example on merge sort. (Photo credit: Wikipedia)- Radix or Bucket Sort
- Random algorithms - improves the worst case performance
- Quick Sort
- Finding Median
- Hashing
- Fibonacci sequence
- Spanning Tree
- Shortest Path - finding the shortest path from one point to another.
- Djikstra's algorithm
- String Searching
- String Matching
NP-complete or NP-hard problem has no known good optimal solution. If someone finds an efficient algorithm for one NP-hard problem, then that algorithm would be applicable to all NP-hard problems.
Related articles
Big-O Misconceptions(ssp.impulsetrain.com)
Algorithm Headache(mayoiengineer.wordpress.com)
insertion sort vs bubble sort vs quicksort algorithm(stackoverflow.com)
What's really so bad about bubble sort?(nicknash.me)
bubble sort help(daniweb.com)
Radix sort(daniweb.com)
A simple C program for Insertion sort(depthgr8.wordpress.com)
How to teach Algorithms ?(kintali.wordpress.com)
No comments:
Post a Comment