@asutosh:: all ur efforts 2 write some code wud be worthless if it cant work for some inputs...if it can , then no one does bother about time complexity.
since it doesn for large i/ps.... v hav 2 write some efficient code (although i agree wid u dat its painful :P ) On Aug 17, 9:45 pm, Dave <dave_and_da...@juno.com> wrote: > For 30 years, I developed mathematical software (linear equation > solvers, eigenvalue routines, fast Fourier transforms, etc.) on a wide > variety of high-performance computers with interesting architectures. > For those, the optimal-order algorithms are well known. My principal > goal was to implement a variant of the best algorithm that made the > constant as small as possible. > > Dave > > On Aug 17, 8:24 am, Ashutosh Tamhankar <asshuto...@gmail.com> wrote: > > > > > Greetings > > > How many of you guys calculate the time complexity of an algorithm > > before implementing it on a day to day basis? > > > When you review your code, before committing it to the live source > > code base, does anybody discuss the time complexity? > > > Would love to hear your interesting experiences.. > > > Regards > > Ashutosh -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
