CS2
Week 5: Algorithm
analysis, searching,
sorting
5
Comparison of algorithms
nAlgorithms are analyzed by considering n as unbounded and looking at the function of n: i.e. expressing the number of algorithm steps in n. As n becomes large we can ignore any housekeeping activities of a program and only consider constantly repeated tasks.
nAlgorithms are classified by the type of function that is related to them using "The Big Oh Notation". Big Oh gives a very general idea of
the type of algorithm.