Shreyas Khati’s Reviews > Grokking Algorithms, Second Edition > Status Update
Shreyas Khati
is on page 63 of 320
- Call stack
- Identifying base case and recursive case for recursive algorithms
- Divide and conquer
— Feb 06, 2026 09:21PM
- Identifying base case and recursive case for recursive algorithms
- Divide and conquer
Like flag
Shreyas’s Previous Updates
Shreyas Khati
is on page 41 of 320
- Arrays vs. Linked Lists
- Reading, insertion, and deletion speeds vary as well as the storage of arrays and linked lists in memory
- Selection sort
- Recursion
— Feb 05, 2026 10:14PM
- Reading, insertion, and deletion speeds vary as well as the storage of arrays and linked lists in memory
- Selection sort
- Recursion
Shreyas Khati
is on page 24 of 320
- Binary search
- Big O notation
- Arrays vs. Linked Lists
— Feb 01, 2026 08:31PM
- Big O notation
- Arrays vs. Linked Lists
