Assignment 2
Due: January 21 at 11:59 PM GMT
📌 This is an individual assignment. You are expected to work independently.
If you get stuck, confused, or have trouble with the assignment, you should use the #help-dsa channel in Discord or message an instructor. Remember not to spoil the assignment for others - do not post code samples from your work to public spaces.
Implementing and Analyzing Sorting Algorithms
This week we learned about how to sort collections of data using various algorithms. We also learned how to analyze the efficiency of these algorithms using big-O notation.
In this assignment, you will analyze an unnamed sorting algorithm by counting the number of operations the sorting algorithm makes. You will then take those measurements and use them to derive the big-O notations of the algorithm under different conditions. Finally, you will implement radix sort and analyze it empirically as well.
▶️ Access the assignment on GitHub Classroom
Remember...
- Read the instructions carefully
- Plan before you code
- Debug if you aren't getting the desired output
- Attend office hours if you need additional support
- Ask for help in Discord