To start off, this was probably the easiest part of the course. Describing how fast an algorithm would run is easy compared to figuring out how to write a one-line recursion code that appends all possible paths of a Binary Tree into a list (in my opinion). Plus, this algorithm stuff and runtime is all covered in Math Expression and Reasoning for Computer Science course, so that helped.
Although this sorting algorithm analysis stuff was easy and boring, I cannot say it wasn't of any use. In fact, knowing which algorithm runs faster and when it begins to perform worse than another algorithm is essential knowledge for creating new algorithms that perform dynamically and in turn save a lot of time. Because sorting is used almost everywhere in programming, it is essential to know this stuff no matter how tedious or boring it may be, so I'm fine with it.
I don't know what else to write but that I am satisfied with taking this course. The second test seemed a little too difficult to finish in 50 minutes, but other than that I really don't have any complaints - the TA was friendly, taught effectively and helped explain things when I was stuck on a problem.
