CST370 Week 1
Hello, This week in Design and Analysis of Algorithms we defined an algorithm as a finite, unambiguous sequence of steps that gives a problem a solution. We learned to show those steps in pseudocode, a language neutral way that reads like code without strict syntax. Graph theory, showing how vertices (nodes) and edges model networks. Finished with the introduction to algorithm analysis which measures how much time and memory different solutions use as data grows. Common time-efficiency classes constant- 1 logarithmic- log n linear- n linearithmic- n log n quadratic- n² cubic- n³ exponential- 2ⁿ factorial- n!