Programming Forums > Script Programming > Python

MicDareall · Apr 19th, 2006, 9:43 AM

its cool.... thankx for trying..... Proffesor said just turn in what I got....... So on to the next problem....

Dietrich · Apr 19th, 2006, 2:48 PM

Your other problem is that you want to compare the absolute slowest way to sort with one of the fastest ways to sort. I would pick a heap or a mergesort and compare it to the quicksort. Now you are talking about somewhat more reasonable speeds.

In essence you are comparing a bicycle to a racecar. That's okay for the first few meters, but after several kilometers it gets to be silly!

Apr 19th, 2006, 2:48 PM	#12
Dietrich Professional Programmer Join Date: Feb 2005 Posts: 434 Rep Power: 4	Your other problem is that you want to compare the absolute slowest way to sort with one of the fastest ways to sort. I would pick a heap or a mergesort and compare it to the quicksort. Now you are talking about somewhat more reasonable speeds. In essence you are comparing a bicycle to a racecar. That's okay for the first few meters, but after several kilometers it gets to be silly! __________________ I looked it up on the Intergnats!

Thread Tools
Show Printable Version Email this Page
Display Modes
Linear Mode Switch to Hybrid Mode Switch to Threaded Mode

Apr 19th, 2006, 9:43 AM	#11
MicDareall Programmer Join Date: Dec 2005 Posts: 67 Rep Power: 0	its cool.... thankx for trying..... Proffesor said just turn in what I got....... So on to the next problem....

Currently Active Users Viewing This Thread: 1 (0 members and 1 guests)

Programming Forums > Script Programming > Python

Sorting algorithms problem.......