11-05-2024, 09:39 AM
(translated by Google translator)
Hi all.
I'm making slow progress on writing the code for my sorting method.
Right now, my method would probably require 9 or 10 passes to sort an array containing 1024 random numbers.
The number of passes through the array is related to the number of elements in the array by a logarithmic dependence to the base 2.
Do you think this is a good result for a sorting method created by a simple amateur who enjoys programming in Small Basic?
Or do I need to think more before publishing the code for this method of mine?
At the moment, I have read about the "Quick Sort" and "Bubble Sort" methods.
All other sorting options that came into my head were my own.
Hi all.
I'm making slow progress on writing the code for my sorting method.
Right now, my method would probably require 9 or 10 passes to sort an array containing 1024 random numbers.
The number of passes through the array is related to the number of elements in the array by a logarithmic dependence to the base 2.
Do you think this is a good result for a sorting method created by a simple amateur who enjoys programming in Small Basic?
Or do I need to think more before publishing the code for this method of mine?
At the moment, I have read about the "Quick Sort" and "Bubble Sort" methods.
All other sorting options that came into my head were my own.