The past few weeks, we've been doing a lot of recursion that makes code more efficient. For example, Binary Search V.s Linear Search, where binary search is much faster than linear, well, when you are dealing with sufficiently larger list sizes. I get why CSC 165 is taken along with CSC 148, since at the moment we are studying big-oh notation, which explains breaking points and such.
I had done some Sort algorithms in High School, so the concept of bubble sort and such wasn't new, although much clearer now. I found it interesting how there are so many different ways to achieve the same task, but all having different efficiency. Linked Lists was a concept that was quite abstract at the beginning, since I was so used to being able to reference anything on a list, but now I feel much more comfortable with the concept. With Test #2 coming up, I think the topics that I have to focus on the most are Linked Lists and Sorts.
No comments:
Post a Comment