Created
July 20, 2018 11:24
-
-
Save aditikhandalkar/249ee42832354396e6e37b49d9251623 to your computer and use it in GitHub Desktop.
Understanding NP Hard and NP Complete
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Polynomial Time Taking Algorithms | |
| - Linear Search O(n) | |
| - Binary Search O(logn) | |
| - Matrix Mul O(n^x) | |
| - Insertion Sort O(n^2) | |
| - Merge Sort nlogn | |
| Exponential Time Taking Algorithms {*=rough range } | |
| - 0/1 Knapsack O(2^n) | |
| - Travelling salesman O(2^n) | |
| - Sum of Subsets O(2^n) | |
| - Graph Coloring O(2^n) | |
| - Hamilton Cycle O(2^n) | |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Links to prepare.
https://leetcode.com/discuss/general-discussion/665604/Important-and-Useful-links-from-all-over-the-LeetCode