Module 1: Analyzing Algorithms
Welcome to Module 1
In this module, we will review some of the basic mathematical and computer science techniques for representing solutions to problems as algorithms and then analyzing them. The textbook examples of insertion sort and merge sort will be familiar to students of Data Structures and Algorithms as sorting techniques that are typically implemented using iteration and recursion respectively. While big-O notation should also be familiar, additional asymptotic notations will be introduced.
Module Learning Outcomes
Upon successful completion of this module, you will be able to:
- Write an algorithm using a particular pseudocode convention (CLO 1).
- Count number of instruction executes in algorithm based on input size (CLO 1).
- Differentiate multiple asymptotic measure of computation time (CLO 1).
(CLO = Course Learning Outcome)
To Do
Please read/watch all of the module learning materials (readings, presentations, videos, etc.) and complete all assignments/assessments listed below. If you have questions, please contact the course instructor or ask in the Questions About This Course forum.
Readings and Presentations:
- Read Chapter 1
- Read Chapter 2
- Read Section 3.1, 3.2
- Topic 1a: Analyzing Algorithms Online Lecture
- Topic 1b: Asymptotic Analysis Online Lecture
Videos:
- Insertion Sort (Card Sorting) Links to an external site.
- Example Proof for Little-O Links to an external site.
Assignments/Assessments:
- Exercise 1: Asymptotic Notations
Click the Next ▶ button to continue.