Posted by: wai_wai January 29, 2010
Login in to Rate this Post:
0 
? 
?
I think here is a confusion
I was referring O(n) as Computational complexity.
O(n) is not the worst case running time.
The complexity order is { O(n^2), O(nlogn), O(n), O(logn)} worst case to best case respectively.
See the Order here
I was referring O(n) as Computational complexity.
O(n) is not the worst case running time.
The complexity order is { O(n^2), O(nlogn), O(n), O(logn)} worst case to best case respectively.
See the Order here