1. 3.6 Backtrackinghistorical

    Backtracking and the Eight Queens problem.

  2. 3.7 DFShistorical

    Depth-first search with permutation and combination examples.

  3. 3.8 Binary Searchhistorical

    Binary search, variants, and common templates.

  4. 3.9 Bubble Sorthistorical

    Bubble sort, its characteristics, implementation, and optimization.

  5. 3.10 Linear Searchhistorical

    Linear search and its implementation.

  6. 3.11 Heap Sorthistorical

    Heap sort using heap construction and repeated deletion.

  7. Next Permutationhistorical

    LeetCode notes on the Next Permutation problem.

  8. 3.12 Merge Sorthistorical

    Merge sort, its characteristics, process, and implementation.

  9. Permutationshistorical

    LeetCode notes on the Permutations problem.

  10. 3.13 Insertion Sorthistorical

    Insertion sort, its characteristics, process, and implementation.