05-01-2006, 11:25 PM
Yetifoot:
Sorry I did'nt see you had already posted a link to your code. 190 seconds is a lot better than your first 400. After all qucksort is almost the fastest sorting method around.
Don't know if my "idea" will do better, after all "traditional" methods with a merge phase are used for some reason.
I must thank Mac for opening the QBasic 1.1 category, this made me think a little, and devise a very simple method that works pretty well. Now I must add it the bells and whistles of FB: after all, 100 times more data have to be sorted there, my QB1.1 code would do it in 3.5 hours!
Mac:
I think you designed the data of the QB1.1 category to be able to use that trick
But other categories can't use it as they sort binary data so to be fair...
Sorry I did'nt see you had already posted a link to your code. 190 seconds is a lot better than your first 400. After all qucksort is almost the fastest sorting method around.
Don't know if my "idea" will do better, after all "traditional" methods with a merge phase are used for some reason.
I must thank Mac for opening the QBasic 1.1 category, this made me think a little, and devise a very simple method that works pretty well. Now I must add it the bells and whistles of FB: after all, 100 times more data have to be sorted there, my QB1.1 code would do it in 3.5 hours!
Mac:
I think you designed the data of the QB1.1 category to be able to use that trick
But other categories can't use it as they sort binary data so to be fair...
Antoni