Reeksoverzicht
Python Bakery
This lesson introduces time complexity and the sorting and searching problems. Students learn to estimate a program’s running time with the RAM model, classify code as constant, linear, or quadratic, compare linear and binary search, and trace the bubble sort and insertion sort algorithms.
| Status | Status | Type | Titel |
|---|---|---|---|
| Time and trees: overview | |||
| Time Complexity | |||
| Time Complexity: quiz | |||
| Sorting | |||
| Sorting: quiz |