LESSON 13 / 75·2 min readIntermediate

Sorting and searching

Must knowConcept lesson
01 Understand02 Recall03 Prepare

Sorting

  • Bubble sort
  • Selection sort
  • Insertion sort
  • Merge sort
  • Quick sort
  • Heap sort

Searching

  • Linear search
  • Binary search
  • Search in rotated sorted array
  • Search in 2D matrix
  • Search insert position

Common patterns

  • Binary search on sorted array
  • Binary search with custom condition
  • Partitioning logic for quicksort

PAUSE & RECALL

Can you explain it without the notes?

Sorting and searching

Use your own words. Explain an example and one limitation before checking the explanation.

Check your explanation

Sorting

CONNECT IT TO YOUR INTERVIEW

Turn this concept into a clear answer.

Practice this concept
YOUR NEXT STEP

Keep connecting the ideas.

Next lesson: Bit manipulation

Adapted from 14_DSA_MASTER.md · “13. Sorting and searching”. Examples are study fragments; framework behavior can depend on your version.