Skip to main content

CS201: Elementary Data Structures

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.
- Unit 7 Learning Outcomes Page
- 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.4: Linear Search
- 7.5: Fibonacci Search
- 7.6: Binary Search, and Bubble and Selection Sorts
- 7.7: Quicksort
- Unit 7 Assessment
  - Unit 7 Assessment Quiz
    Take this assessment to check your understanding of the materials presented in this unit.
    
    Notes:
    
    There is no minimum required score to pass this assessment, and your score on this assessment will not factor into your overall course grade.
    
    This assessment is designed to prepare you for the Final Exam that will determine your course grade. Upon submission of your assessment you will be provided with the correct answers and/or other feedback meant to help in your understanding of the topics being assessed.
    
    You may attempt this assessment as many times as needed, whenever you would like.