Regarding Time Complexity

Question

I would want to ask a question that while doing the comparison of two algos based on time complexity it is said dat worst case is considered. No doubt it is, however if a code which seemingly looks as if it has a high time complexity, then while it's running time be calculated in powers of 2(in case of worst case input) comes out to be a better one. Kindly guide in this context. With some example to support ur answer. :). Thanx in advance.

Comments

not only the worst case but we have average case also for this purposes...as all the real time applications are based on the average cases.

---

Please tell me how to compare two codes based on d power of 2 to find its worst/best case.

---

when they are functions of the same then the constant factors play the role...u can guess but ..when u implement in the real world applications they give different results...as they depend on several factors like how they use the cache etc..both quicksort and heap sort have the same best time complexity but quick sort beats heap sort ..

u can read this link further http://ddeville.me/2010/10/sorting-algorithms-comparison

---

Look not just sorting but any type of algorithm. Iterative ones especially. Please can you support ur answer by working out on a random code.I simply want to know tat where i/p is concerned we take d worst possible scenario i.e. in powers of 2. So please help with this. By taking an exmaple. It'll be a big help as far as clearing my doubt is concerned.