[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 11:05:31 +0530*Organization*: Persistent Systems Pvt. Ltd.*References*: <20010115150701.50178.qmail@xxxxxxxxxxxxxxxxxxxxxxx>

Hi 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. Bye Shridhar > > yup! i thinks so too ? is there a tool that actually > is able to compute the number of times loops execute > or depth fo recurrsion and also the most expensive > operation and estimate the time complexity based on > some parameter n that the user can specify. >

**Follow-Ups**:**Re: "time complexity"***From:*Amarendra GODBOLE

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

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