Runtime Analysis of an Algorithm

by Daniel Untiveros

 

Submitted : Fall 2014

An analysis of an asymptotic algorithm can be useful for optimizing the runtime of a computer program. It has several applications, such as determining the best case, worst case, and average case runtime. In a program that goes through a looping function, each permutation increases the overall runtime.  There should be a point where the size of the input begins to impact performance significantly.

Related Links:

 

---

 

[ Back ]

	Advisors :
	Arcadii Grinshpan, Mathematics and Statistics
	Tina Kouri, Computer Science & Engineering
	Michael Eggleston, CAE
	Suggested By :
	Tina Kouri