Coding interview prep, in order
An interactive visualizer, ten essential patterns, and a Big O reference.
0/35 covered
Coding quiz
12 questions, 80% to pass
UnsortedComparingSwappingSorted
42
78
19
63
91
27
54
8
71
35
96
14
59
82
23
47
Step 1 / 00% complete
Speed
Bubble Sort
Time: O(n²)
Space: O(1)
Simple and stable. A good teaching tool, but bad in practice.
Selection Sort
Time: O(n²)
Space: O(1)
Minimizes swaps. Not stable. Slightly better than bubble sort.
Insertion Sort
Time: O(n²) worst, O(n) best
Space: O(1)
Excellent for nearly-sorted data. Used inside Timsort.