- Insertion sort
- Binary insertion sort
- Merge sort
- 3-way Merge sort
- Bulid max heap
- Max heapify
- Add elment
- Get max element
- Pop max element
- Increase value in node[x]
- Delete node[x]
- QuickSort
- Partition
- QuickSort_withRandom
- Randomized_partition
- Calculate clock angle
- N's log floor function
- Big N's log floor function using binary search
- Fibonacci function (Recursion, Array, Recursive squaring)
- Skyline
- Counting inversions
- Closest pair
- Dijkstra algorithm using priority queue
- Minimum spanning tree using Prim's algorithm
- Huffman encoding, decoding
- Napsack problem Using Dynamic Programming