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

*To*: linux-india-programmers@xxxxxxxxxxxxxxxxxxxxx*Subject*: Re: "time complexity"*From*: Shridhar Daithankar <shridhar_daithankar@xxxxxxxxxx>*Date*: Wed, 17 Jan 2001 13:02:36 +0530*Organization*: Persistent Systems Pvt. Ltd.*References*: <20010115150701.50178.qmail@xxxxxxxxxxxxxxxxxxxxxxx> <3A652F23.BF86EDBD@xxxxxxxxxx> <20010117123349.A18157@xxxxxxxxxxxxxxxxxxxxxxxxxxx>

Oops.. Did I say it's not important? I mean I know how important it is but I would rather prefer to compute in theoretically ( which is going to be inaccurate) rather than computing it by examples. That's all I mean. At times even computing accurately might be the need. But that's rare if you ask me... Bye Shridhar P.S. My greycells are already dead. Why would I do a job otherwise? :-)) Amarendra GODBOLE wrote: > On Wed, Jan 17, 2001, the greycells of Shridhar Daithankar expressed: > > 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.

**Follow-Ups**:**Re: "time complexity"***From:*sreangsu acharyya

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

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

**Re: "time complexity"***From:*Amarendra GODBOLE

- 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):