Big O Notation and Program Run-Time

by Kowit Karunas

 

Submitted : Spring 2014

The goal of this project was to get a basic understanding of a big O notation and its application in program run time. By finding big O notations of closed form functions, we can see how fast the function grows. This is important due to its direct applications in the field of computer science and seeing how a computer algorithm scales with input size. Seeing how different algorithm scales allows best use and worse use cases for an algorithm. Conclusions drawn from this project shows how to analyze series and recursive functions and using the RAM model of computation to find a program’s runtime.

Related Links:

 

---

 

[ Back ]

	Advisors :
	Arcadii Grinshpan, Mathematics and Statistics
	Noureddine Elmehraz, Computer Science & Engineering
	Suggested By :
	Noureddine Elmehraz