In this lesson, our instructor Tom Quayle goes through an introduction on algorithms: sorting. He starts by discussing sorting, then moves on to selection sort, insertion sort, merge sort, and quick sort.
Sorting is putting items in a collection in order (either ascending or
Can sort primitive types or objects of any class that implements the
Selection Sort is a simple but inefficient sorting algorithm
Insertion Sort is a simple but inefficient sorting algorithm
Merge Sort is a more efficient, recursive sorting algorithm
Quick Sort is a more efficient, recursive sorting algorithm (most efficient sort
algorithm for large collections of data but not in the AP subset)
Lecture Slides are screen-captured images of important points in the lecture. Students can download and print out these lecture slide images to do practice problems as well as take notes while watching the lecture.