[Subject Prev][Subject Next][Thread Prev][Thread Next][Subject Index][Thread Index]

*To*: linux-india-programmers@xxxxxxxxxxxxxxxxxxxxx*Subject*: Re: "time complexity"*From*: Amarendra GODBOLE <amarg@xxxxxxxxxxxxxxxxxxxxx>*Date*: Wed, 17 Jan 2001 12:33:49 +0530*In-reply-to*: <3A652F23.BF86EDBD@xxxxxxxxxx>; from shridhar_daithankar@xxxxxxxxxx on Wed, Jan 17, 2001 at 11:05:31AM +0530*References*: <20010115150701.50178.qmail@xxxxxxxxxxxxxxxxxxxxxxx> <3A652F23.BF86EDBD@xxxxxxxxxx>*User-agent*: Mutt/1.2.5i

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

**Follow-Ups**:**Re: "time complexity"***From:*Shridhar Daithankar

**Re: "time complexity"***From:*Shishir Pandey

**References**:**RE: "time complexity"***From:*sindhoor pangal

**Re: "time complexity"***From:*Shridhar Daithankar

- Prev by Subject:
**Re: "time complexity"** - Next by Subject:
**Re: "time complexity"** - Previous by thread:
**Re: "time complexity"** - Next by thread:
**Re: "time complexity"** - Index(es):