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.
