• Unit 7: Searching and Sorting Algorithms

    In this unit, students will learn to apply searching and sorting algorithms to arrays. Students will also learn how to conduct worst-case and best-case analysis for these algorithms, determine their efficiency, and assign them generalized Big O notations.

    Completing this unit should take approximately 7 hours.

    • 7.1: Peak Finding via Vector Search

    • 7.2: Models of Computation and Document Distance

    • 7.3: Why Sort? Insertion Sort and Merge Sort

      • 7.3.1: Big-O Analysis of Merge and Insertion Sort

      • 7.3.2: Merge and Insertion Sort in C/C++

    • 7.4: Linear Search

    • 7.5: Fibonacci Search

    • 7.6: Binary Search, Bubble Sort, and Selection Sorts

    • 7.7: Quicksort

    • Unit 7 Assessment

      • View Receive a grade