"Section 6: Searching & Sorting — Easy/Medium"
Overview
Core searching and sorting algorithms every developer must know — from brute-force linear search to efficient merge sort.
Lessons
| # | Lesson Name | Duration | Notes |
|---|---|---|---|
| 1 | Linear Search | 8m 8s | |
| 2 | Binary Search | 39m 24s | |
| 3 | Bubble Sort | 48m 22s | |
| 4 | Selection Sort | 19m 43s | |
| 5 | Insertion Sort | 34m 22s | |
| 6 | Merge Sort | 1h 34m 19s |
Lesson Checklist
- [ ] Linear Search (8m 8s)
- [ ] Binary Search (39m 24s)
- [ ] Bubble Sort (48m 22s)
- [ ] Selection Sort (19m 43s)
- [ ] Insertion Sort (34m 22s)
- [ ] Merge Sort (1h 34m 19s)
My Notes
Add your personal notes, key takeaways, and insights here as you progress through the section.
Algorithm Complexity Summary
| Algorithm | Best | Average | Worst | Space |
|---|---|---|---|---|
| Linear Search | O(1) | O(n) | O(n) | O(1) |
| Binary Search | O(1) | O(log n) | O(log n) | O(1) |
| Bubble Sort | O(n) | O(n²) | O(n²) | O(1) |
| Selection Sort | O(n²) | O(n²) | O(n²) | O(1) |
| Insertion Sort | O(n) | O(n²) | O(n²) | O(1) |
| Merge Sort | O(n log n) | O(n log n) | O(n log n) | O(n) |
Problem Notes
Binary Search
- Requires sorted array
- Template:
Merge Sort
- Divide and conquer
- Stable sort