Book: introduction to algorithms
- Bucket Sort.
- Counting Sort.
- Heap Sort.
- Merge Sort.
- Quick Sort.
- Radix Sort.
- Max Priority Queue.
- Double Ended Queue.
- Binary Search Tree.
- Find the maximum subarray. O(n)
- Find the iTh order statistic number in an array. O(n)
- Find the median of two sorted arrays. O(n log (n) )
- Implement queue with two stacks.
- Implement stack with a linked list.
- Reverse linked list. O(n)