CST 370 Week 1 Learning Journal Entry
Algorithms and Analysis Framework This was our first week in CST 370, which focused on algorithms and analysis frameworks. An algorithm is a "sequence of unambiguous instructions for solving a problem." When you describe the sequence of steps, there is only one way to interpret it. For example, when finding the greatest common denominator, we can use Euclid's algorithm, which is found below. Euclid's algorithm (left) shows clear directions on how to find the greatest common denominator. The right shows another method for finding the greatest common denominator, the Middle school procedure. This method is not considered an algorithm because prime factorization is not defined and is considered ambiguous, as there are multiple ways to find a number's prime factors. Developing an algorithm is an important process before the code is developed. When a problem arises, the algorithms to solve the problem should be written out first before coding begins. The algorithm b...