Book 4: Practical Programming
Book 4 · Chapter P4.5
Sorts and searches
§19.1In codeBanker · ≈ 30.8 m · →
B4·5This chapter is being written.
Everything the site already has for it is below — each with the short code the book prints beside it.
For the whole chapter
- Topic pageComputational Thinking and Problem-Solving
B4·5·T - QuizComputational Thinking & Problem-Solving
B4·5·Q1 - LabAlgorithm Lab (sorts, binary search, recursion)
B4·5·X1 - LabData Structures Playground
B4·5·X2 - LabProgramming tasks (stacks, queues, recursion)
B4·5·X3
§19.1 Algorithms · Building ADTs from other ADTs
Short code B4·5·1
- FlashcardsFlashcards §19.1: ADTs in code — stacks, queues, lists, trees, hash tables
B4·5·F1 - FlashcardsFlashcards §19.1: Algorithms & Big O
B4·5·F2 - Past-paper questionsPast-paper questions §19.1 (algorithms)
- Past-paper questionsPast-paper questions §19.1 (building-adts-from-other-adts)
Workbook 4: Sorts and searches
Short code W4·5 · Practical Programming Task Book
The write-in workbook for this chapter — drills, exam-style practice, trace tables, fix-the-mistake and mark-it-yourself pages. Its full mark schemes and an interactive version arrive here with the chapter.
Starter files
Short code W4·5·K
Data files and skeleton code in Python, VB.NET, Java for this chapter's tasks arrive here with the chapter.
