CST 370 - Week 1
This week focused on some of the introductory topics we will be learning about in class including what an algorithm, how pseudocode will be used in the class, different types of problems and how they relate to algorithms (sorting, searching, graphs, etc), data structures and algorithm analysis including best and worst case efficiencies. The portion of the class I found the most interesting was the overview of time and space efficiency. Essentially, these are covered in order to make sure an algorithm is not only running fast, but that the memory required for both the input and output is optimal. In the text, it states that computer scientists are moving away from space efficiency to focus on time, as memory prices are relatively cheap now. Overall, I gained a better understanding of some fundamental information related to algorithms.