Algorithms

  1. Analysis of Algorithms
    1. Asymptotic Analysis
    2. Worst, Average and Best Cases
    3. Asymptotic Notations
    4. Little o and little omega notations
    5. Lower and Upper Bound Theory
    6. Analysis of Loops
    7. Solving Recurrences
    8. Amortized Analysis
    9. What does ‘Space Complexity’ mean?
    10. Pseudo-polynomial Algorithms
    11. NP-Completeness Introduction
    12. Polynomial Time Approximation Scheme
    13. A Time Complexity Question
    14. Time Complexity of building a heap
    15. Time Complexity where the loop variable is incremented by 1, 2, 3, 4...
    16. Time Complexity of Loop with Powers
    17. Performance of loops (A caching question)
  2. Searching and Sorting
    1. Merge Sort Recursive way
    2. Quick Sort Recursive way
    3. Binary Search Recursive way
  3. Mathematical Algorithms
    1. Sieve Of Eratosthenes
    2. Horner Rule
  4. Greedy Algorithms
    1. Kruskal’s Minimum Spanning Tree Algorithm
  5. Dynamic Programming
  6. Pattern Searching
  7. Other String Algorithms
  8. Backtracking
    1. Rat In a Maze All Paths
  9. Divide and Conquer
  10. Geometric Algorithms
  11. Bit Algorithms
  12. Graph Algorithms
  13. Randomized Algorithms
  14. Branch and Bound
  15. Misc

Sources:- 

Comments

Popular posts from this blog

How to pass parameters in webhook?

Access and modify all the resources of our Wiki.js using WikiJS API

Fahrenheit to Celsius