RE: "time complexity"

[sindhoor pangal <sindhoor@xxxxxxxxx>]

--- Vinod Pathangay <vinod@xxxxxxxxxxxxxxxxxxx> wrote:
> list:
> 
> i think time complexity and time of execution are
> two different things..
> Of course execution time depends on time complexity
> of the algoritm but
> also on the CPU, etc...
> 
> Time complexity is expressed as a function on "n"
> being the number of
> inputs... refer Dikstra
> 

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.

> I have not come accross any tool that gives the time
> complexity of the
> algorithm. If some one has pls enlighten me..
> 
> It will be an interesting project to write one such
> tool...
> 
> vinod...
> 
> On Mon, 15 Jan 2001, shubhendu wrote:
> 
> > hai friend 
> > 
> > there  is one more good way to get the time taken
> by some process 
> > use times system call
> > first call this at the start of the program and
> once at the end
> > and get the differance in the time values returned
> by both the calls 
> > we can all the time usrtime , systime etc ..
> > 
> > see 
> > 
> > <>
> > man 2 times  
> > <>
> > 
> > shell command time may be using same system call
> > 
> > shubh
> > REC-Surat
> > 
> > 
> > ---------------------------------------------
> > 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.
> > 
> 
> -- 
> 
> 
> ---------------------------------------------
> Find out more about this and other Linux India
> mailing lists at http://lists.linux-india.org/


__________________________________________________
Do You Yahoo!?
Get email at your own domain with Yahoo! Mail. 
http://personal.mail.yahoo.com/