Home

Documentation

• Algorithms
  • Implementation
    • Iterative Algorithm
    • Recursive Algorithm
  • Approaches / Design
    • Greedy Algorithms
    • Dynamic Programming
    • Divide and Conquer
    • Backtracking Algorithm
    • Branch & Bound
  • Analysis
  • Rate of Growth
  • Worst Case
  • Best Case
  • Average Case
  • Asymptotic Notations
    • Big O Notation
    • Big Omega Notation
    • Theta Notation
    • Little O Notation
    • Little OMEGA Notation
  • Complexity
  • Types of Complexity
    • Time Complexity
      • ITERATIVE
      • RECURSIVE
    • Space Complexity
      • ITERATIVE
      • RECURSIVE
  • Relation of Order and Type of Complexity
    • GRAPH
• Data Structures
  • Linear Data Structures
  • Non Linear Data Structures
• STABLE SORT
• UNSTABLE SORT