This repo contains implementations of some basic algorithms and DS. This is a work in progress. As of now following algorithms have been implemented:

• Sort
  • Insertion Sort
  • Merge Sort
  • Bubble Sort
  • Quick Sort
  • Heap Sort
  • Counting Sort
• Heap
• Misc
  • Naive matrix multiplication
  • Inversion counting in an array
  • Maximum subarray problem
  • Binary search on sorted integer arrays

Following is the list of algos/ds which are not of my interest right now but I will implement them some time soon.

• Strassen's Algorithm for multiplying n-by-kn and kn-by-n matrices
• Merge sort with insertion sort at small size
• Quick sort with insertion sort at small size
• Heap which allows its capacity to be changed at runtime

• Test cases
• Profiling