Well, there is no easy answer. You'll have to fix up the computing model (RAM model etc) and then calculate the number of operations. Memory hierarchy and parallelism make it nearly impossible to come with an exact number for random data on a modern computer but you could see it as
cost of loads + cost of stores + cost of arithmetic operations + cost of branches On Nov 22, 2007 3:26 PM, Sherry <[EMAIL PROTECTED]> wrote: > > I know how the complexity of an algorithms is calculated, but how > would this relate to the time it takes? Let's say I have 25000 random > numbers I'd like to sort with the selection sort. Now how could I use > Big O notation to calculate the time taken to sort these numbers?? I > mean I understand it's a O(n^2) sort, but how do you approximate time > taken?? > > Thanks in advance. > > > --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
