Announcements and Reminders
Repeatedly stepping through the list to be sorted, comparing each pair of adjacent items and swapping them if they are in the wrong order.
Example 1-9 - Bubble Sort
How can you make this code more efficient?
Video: Easy Programming - Beginner C++ Tutorial - The Bubble Sort (11 minutes)
Find the minimum value in the list, swap it with the value in the first position. Repeat the steps above for the remainder of the list (starting at the second position and advancing each time).
Each element is inserted, one at a time, into the sorted list
Searching an array
A binary search is a search in which the array data is repeatedly split in half until the search key is found or it is determined that the the search value is not present. The data must be sorted on the search key.
The Game: guess a secret number between 1 and 100.
Example 1-12 - Binary Search