Computer Science: Programming, step by step

All lessons, part by part

1. 7.1 Efficiency is measured against input size
2. 7.2 Common complexity classes
3. 7.3 Big O from loop structure
4. 7.4 Best, average and worst case
5. 7.5 Linear search
6. 7.6 Binary search
7. 7.7 Trace binary search and count comparisons
8. 7.8 Sub-step: swap two positionsnot yet
9. 7.9 Sub-step: smallest from a start positionnot yet
10. 7.10 Selection sort, assembled from the sub-stepsnot yet
11. 7.11 Bubble sortnot yet
12. 7.12 Trace a sort pass by passnot yet
13. 7.13 Compare two algorithms on time, space and swapsnot yet

No account needed. Your progress stays in this browser.

Lesson 7.6 · Put the lines in order

Where binary search looks

Python or Java