Day 31 of learning DSA.
Quick Sort: pick a pivot, partition, recurse.
- O(n log n) average, O(n^2) worst case. choice of pivot matters more than it looks.
also revised some concepts from the past month.
Progress β 58/495
1 month of DSA. here's the honest recap:
-> took the whole month just covering basics. still not done.
-> started solving problems on GFG and Leetcode
-> logical thinking is genuinely 2x better than day 1
slow? kinda. stopping? nah
Day 30 of learning DSA.
Finally coded Merge Sort from scratch.
divide -> sort -> merge. simple concept, painful implementation. π
O(n log n) and it actually makes sense now.
Progress β 58/474