Tutorial Prep for week 13

Read chapter 13 from the text and then print and complete this page. 

Explain in your own words (not the words of the textbook) the relationship
among the terms in each group.
1. Searching / Sorting 






2. Binary Search / Linear Search






3. Insertion Sort / Bubble Sort / Selection Sort







In class you were probably given analogies to help you remember and 
understand each algorithm. For example your lecturer might have explained
binary search by talking about how you look up a name in a telephone book.
Make up a new analogy (your own!) for each of the following.

1. Binary Search




2. Linear Search




3. Selection Sort




4. Insertion Sort