This week we're covering recursive sorting algorithms, how they differ from iterative sorting algorithms, how we can improve upon O(n^2) complexities, and more!
This week is a little more of a lighter week since there isn't much I can do without explicitly teaching... which I obviously cannot do. Instead, we have a series of activities that show the differences between the sorting algorithms.
Because I'm such a nice FSG Leader, I've decided to omit homework this week :D
Translation: There isn't anything relevant/worth your time to assign as homework, hence why I'm not assigning any.
If we don't get to certain questions this week, then that's your "unofficial" homework.
Solutions can be found in the Solutions folder.
Quick Links:
All solutions provided are provided outside of FSG hours, and are not endorsed neither by the UTM RGASC nor the CSC148H5 Course Staff. These solutions are meant to be used as a reference, and not a replacement for the problem solving process. Use at your own risk. You are encouraged to attend office hours and ask questions during lectures if there are any parts of the solution that you do not understand. Should you find anything that is incorrect, please open an issue on this repository and I will address it as soon as possible.