Some basic algorithms reimplemented in c++ as an excercise.
The implementations are:
- Quicksort
- BinarySearch
- MaxSummedInterval (Checks for the longest interval with length n in a k long interval)
- MaxIncreasingInterval (Checks for the maximum increasing interval)
- BinSort
- Merge (merge 2 sorted lists in linear time)
- Partition (quick sort helper)
- QuickSort
Generic comparators:
- greater_than
- lesser_than
For an example showcase:
Run:
g++ algorithms_revise.cpp -o algorithms_revise
./algorithms_revise