Problem 2.3 from SCHAUM’S OUTLINE OF Principles of COMPUTER SCIENCE

Count the primitive operations in your algorithm to find the mean.
What is the order of growth of your mean algorithm?



setup 4
loop 5 * length (length = n, the count of numbers to be averaged)
return 2


Order of growth :  Θ( n )

related source : SCHAUM’S OUTLINE OF Principles of COMPUTER SCIENCE
related resource : http://www.cs.nott.ac.uk/~nza/G52ADS/lecture2.pdf