adnan15110

 Profile Answers by adnan15110 

• Jan 3rd, 2010

 

Time complexity usually expressed by asymptotic notation.

To find out time complexity we need to see the growth of function of that algorithm. Which means to identify how the loops or comparisons behave with increasing input size try to create a series. (for reference see corman's algorithm book chapter 3). Then try to solve the arithmetic series highest term in result is the time complexity of that algorithm.