CS8 · Search 2 / Sort 1 / Sort 2 Computational thinking and algorithms mind map

Search 2

• Choosing a search: Order and repeated use matter

Sort 1

• Bubble sort: Compare neighbours and swap out-of-order pairs
• Bubble-sort trace: One pass does not necessarily finish sorting
• Insertion sort: Insert the next item into a sorted prefix
• Merge sort: Split then merge ordered parts

Sort 2

• Comparing sorts: Explain operations and suitability
• Algorithm practice: Design trace correct and refine a complete solution

Connections

• Search 2 → Sort 1: Binary search requires sorted data; sorting creates that ordering.
• Sort 1 → Sort 2: Sorting methods move items differently while producing the same ordered result.