Week 2 - CST 370

This week we learned about asymptotic notation, recursive and non-recursive algorithms, and brute force. The purpose of algorithm analysis is to analyze the efficiency of an algorithm using Big Oh, Big Theta and Big Omega. An example of a non-recursive algorithm would be a for loop with index ranging from 0 to n-1 which would have a time complexity of O(n)or Θ(n). Brute force is a straight forward approach to solving a problem, like a selection sort. This approach is not always the most complex or efficient but can be the easiest concept to implement.

Comments

Popular posts from this blog

Week 1 - CST 370

Week 1 - CST 438

Week 4