Sorting

Summary

Algorithms for ordering data (bubble, merge, quick, etc.) — foundational CS knowledge, and the basis for many other algorithms' efficiency assumptions.

How to Learn This

1Implement merge sort and quicksort from scratch, not just call a built-in.
2Learn the time/space complexity trade-offs between the common sorting algorithms.
3Understand why most languages' built-in sort is a hybrid algorithm, not a single 'pure' one.

Dynamic Programming

Searching

More topics in Data Structures & Algorithms

Arrays Strings Linked List Stack Queue HashMap Heap Tree Graph Binary Search Recursion Backtracking Sliding Window Greedy Dynamic Programming Searching

Stuck on this topic? Ask an Insider

Get 1:1 guidance from people who've walked this exact path — free on the InsideEdge app.

Download