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 algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
