The repository includes the comparison of QuickSort and HeapSort (via minHeap) with the problem "k nearest sort". Detailed info in readMe.
The repository includes comparison of recursive and dynamic approach on knapsack problem. Detailed info in readMe.