## Unit 3: Sorting, Searching, and Big O

In this unit, students will look at a few different ways to sort a group of numbers, a few ways to search for numbers in a sorted group, and how to analyse these methods for efficiency.

By the end of this unit, students should be familiar with selection sort, bubble sort, and insertion sort. We will also take a look at merge sort, but this is not a required to know the exact implementation of the method (we will do this in class though). For searching, we will look at the sequential search and the binary search algorithms. Finally, students will be able to analyse the efficiency of these methods and others using the Big O notation.

By the end of this unit, students should be familiar with selection sort, bubble sort, and insertion sort. We will also take a look at merge sort, but this is not a required to know the exact implementation of the method (we will do this in class though). For searching, we will look at the sequential search and the binary search algorithms. Finally, students will be able to analyse the efficiency of these methods and others using the Big O notation.