• Introduction to Algorithms

  • Designing Algorithms

  • Analyzing Algorithms

  • Asymptotic Notations (Big O, Ω, Θ)

  • Heap

  • Heap Sort

  • Divide and Conquer Technique

    • Binary Search
    • Merge Sort
    • Quick Sort
    • Strassen's Matrix Multiplication