The Use of Big O Notation in Runtime Analysis.

by Kyle Stanton

Submitted : Fall 2014

The point of this project is to show the use of Big O notation in the rate of growth in algorithms and to present the limit method proof for either Big O, Big Θ or Big Ω. Big O notation is useful in describing the runtime for various algorithms and determining their efficiency. Whether a function can be described in Big O, Big Θ or Big Ω depends on the use of limits and L'Hˆopital’s Rule.

[ Back ]