CS 329
Analysis of Algorithms
Spring 2013
University of Bridgeport
Analysis of Algorithms
The field of computer science that studies efficiency of algorithms is known as analysis
of algorithms.
Example 1:
Bubblesort requires n2 statements to sort n elemen
CS 329
Mathematical Tools
Spring 2013
University of Bridgeport
Mathematical Tools
x
Floor of x:
x
Ceiling of x: smallest integer greater than or equal to x
largest integer less than or equal to x
Factorials
n!=1.2.3. .n Special case: 0!=1.
Comparison of g
Asymptotic Notation
Allows us to compare the complexity of a given function to a
known complexity.
We are mainly interested in the growth of functions as n gets
large, goes to infinity.
Asymptotic Notation O, , and
Set Notation
Big O upper bound
Big Omeg