Re: "time complexity"

[Amarendra GODBOLE <amarg@xxxxxxxxxxxxxxxxxxxxx>]

On Wed, Jan 17, 2001, the greycells of Shridhar Daithankar expressed:
 
> These things such as time complexity are best left with theory. It can tell you
> something at a glance what computer may take a life time. Learnt that hard way
> while writing a program for analog inverse FT/LT. Not eveything is solvable by
> writing a computer program for it.
######################################################################

Hi,

No, Shridhar, time complexity analysis is very important for a large 
project. It gives you a fair estimate of the various resource and 
processor requirements.

Every sort or search, when used, is FIRST analysed for its time complexity
(space complexity is not so important). Then a proper selection is made
as to which is to be used.
Linux has n number of utilities which utilize sort or search in 
one form or the other. 

Never underestimate the time complexity issue, you are sure to run into
trouble.

Cheers,
-amar-

-- 
Amarendra GODBOLE (http://ag.dnsq.org)
Public Key: http://pubkey.dnsq.org
18.97 deg. N / 72.83 deg. E
+0530 GMT