Algorithms
- Analysis of Algorithms
- Asymptotic Analysis
- Worst, Average and Best Cases
- Asymptotic Notations
- Little o and little omega notations
- Lower and Upper Bound Theory
- Analysis of Loops
- Solving Recurrences
- Amortized Analysis
- What does ‘Space Complexity’ mean?
- Pseudo-polynomial Algorithms
- NP-Completeness Introduction
- Polynomial Time Approximation Scheme
- A Time Complexity Question
- Time Complexity of building a heap
- Time Complexity where the loop variable is incremented by 1, 2, 3, 4...
- Time Complexity of Loop with Powers
- Performance of loops (A caching question)
- Searching and Sorting
- Mathematical Algorithms
- Greedy Algorithms
- Kruskal’s Minimum Spanning Tree Algorithm
- Dynamic Programming
- Pattern Searching
- Other String Algorithms
- Backtracking
- Divide and Conquer
- Geometric Algorithms
- Bit Algorithms
- Graph Algorithms
- Randomized Algorithms
- Branch and Bound
- Misc
Sources:-
- Wikipedia:- https://en.wikipedia.org/wiki/Algorithm
- GfG:- https://www.geeksforgeeks.org/fundamentals-of-algorithms/
- Introduction to algorithm:- https://www.amazon.com/Introduction-Algorithms-3rd-MIT-Press/dp/0262033844
Comments
Post a Comment
Please give us your valuable feedback