A sorting algorithm is utilized to rearrange a given array or elements in a list according to a comparison operator on the elements. Using the comparison operator, it will then decided the new order of the given element in the respective data structure.
Examples of Sorting Algorithms:
- Selction
- Bubble
- Insertion
- Merge
- Quick
- Counting
- Heap
- Radix
- Cocktail
- At least four different sorting algorithms
- What is the Big O notation, and how to evaluate the time complexity of an algorithm
- How to select the best sorting algorithm for a given input
- What is a stable sorting algorithm
- Allowed editors: vi, vim, emacs
- Files will be compiled on Ubuntu 14.04 LTS
- Code uses the Betty style