Binary Optimization is particularly useful for the multiple knapsack problem. When an item has a selection limit s, meaning it can be chosen at most s times, the traditional approach requires O(n * s * m) time complexity. However, using binary optimization, the complexity can be reduced to O(n * log(s) * m) The core…
Category: Notes
Knapsack Problem
My own notes for Knapsack Problem.
Binary Search
My own notes for Binary Search.
Merge Sort
My own notes for Merge Sort.
Sorting And Searching Algorithms – Time Complexities Cheat Sheet
Time complexity Cheat Sheet & BigO Graph.
Quick Sort
My own notes for Quick Sort.
Markdown Guide
This guide is powered by Markdown.
Reverse Proxy Code
This is the code for Reverse Proxy.