CSUMB CS Online Learning Journal - Ryan

 This week we learned about two additional algorithms: Counting Sort and Radix Sort. Counting sort involved finding the frequency of a given value in an input array and then generating output based on that frequency. Radix Sort takes an set of input numbers and looks at the least significant digit in each entry and creates an output order based on that digit. The algorithm continues with each least significant digit and will order all the numbers once it is complete. One other topic I found this week to be interesting was the idea of dynamic programming where we keep an array of solutions to sub problems to help with future calculations.  Overall I felt this week provided great information on additional sorting algorithms and the concept of dynamic programming.

 This week we learned a great deal of new concepts. The first was how to utilize the quick sort algorithm and how it is based on the divide and conquer technique. This technique aims to break a problem into smaller and smaller parts until the problem is easily solvable, and then the solution is applied to essential conquer a big problem by breaking it apart. We also learned more about binary tree traversal and the different methods for moving through binary trees. We also learned about the concept of tree height calculation which is a good indicator of the worst case scenario in tree traversal. One of the big take aways from this week was learning about Kahn's algorithm and how it is useful for topologically sorting data. A lot of great concepts this week that I will have to revisit before the final.

 This week primarily consisted of the Mid term which encompassed the first three weeks of learning. So far, this class has been challenging, but I am beginning to grasp some of the main concepts. I find that doing a daily review of the materials I have learned helps me to feel a little more confident that I understand. I feel that the main ideas have been computing the time complexity of the algorithm and getting familiar with some established algorithms for solving common problems. I will continue to study the new material and review previous materials to continue to improve.