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

Re: "time complexity"

Guilty of starting this thread, I must intervene at this point. The purpose for using computer for obtaining time complexity was not for an accuracy. The tool would allow me to save me the time of doing it manually. However there is a more important reason.

If I use a specialised container, such as a map or priority que, provided by the STL, I would like to their impact on the time-complexity. It would take a lot of time to look at the STL implementations, hence a computer doing the job would be nice.


From: Shridhar Daithankar <shridhar_daithankar@xxxxxxxxxx>
Reply-To: linux-india-programmers@xxxxxxxxxxxxxxxxxxxxx
To: linux-india-programmers@xxxxxxxxxxxxxxxxxxxxx
Subject: Re: [LIP] "time complexity"
Date: Wed, 17 Jan 2001 13:02:36 +0530

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

That's all I mean. At times even computing accurately might be the need. But that's
rare if you ask me...


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.

LIP is all for free speech.  But it was created
for a purpose.  Violations of the rules of
this list will result in stern action.

Get Your Private, Free E-mail from MSN Hotmail at http://www.hotmail.com.