If you're going to make a big claim about sort speed, tell me how speed is better/worse for various data. How do the algorithms compare when the data is already ordered, when it's almost (but not quite) already ordered, when it's largely ordered, when it's completely random, and it's in the opposite order. This stuff, as well as the size of the dataset, is what we need to know in practice.
JesseSort: A novel sorting algorithm that is faster than Python's default sort.
11–20 of 65 posts
Re: JesseSort: A novel sorting algorithm that is faster than Python's default sort.
#12I have mixed feelings about the naming. Isn't it kinda off-putting that he named it after himself? usually it's other people who name your algorithm after you. At least that's how it's like in science and engineering (Fourier didn't call it "Fourier transform", Laplace didn't call it "Laplace transform", Kalman didn't name it "Kalman filters", etc.)
Re: JesseSort: A novel sorting algorithm that is faster than Python's default sort.
#13I have mixed feelings about the naming. Isn't it kinda off-putting that he named it after himself? usually it's other people who name your algorithm after you. At least that's how it's like in science and engineering (Fourier didn't call it "Fourier transform", Laplace didn't call it "Laplace transform", Kalman didn't name it "Kalman filters", etc.)
Like Dijkstra's algorithm? Knuth-Morris-Pratt algorithm? Huffman coding?
Re: JesseSort: A novel sorting algorithm that is faster than Python's default sort.
#14If you're going to make a big claim about sort speed, tell me how speed is better/worse for various data. How do the algorithms compare when the data is already ordered, when it's almost (but not quite) already ordered, when it's largely ordered, when it's completely random, and it's in the opposite order. This stuff, as well as the size of the dataset, is what we need to know in practice.
Re: JesseSort: A novel sorting algorithm that is faster than Python's default sort.
#15I have mixed feelings about the naming. Isn't it kinda off-putting that he named it after himself? usually it's other people who name your algorithm after you. At least that's how it's like in science and engineering (Fourier didn't call it "Fourier transform", Laplace didn't call it "Laplace transform", Kalman didn't name it "Kalman filters", etc.)
He should have at least called it eejss-sort
Re: JesseSort: A novel sorting algorithm that is faster than Python's default sort.
#16Python's default is gallop sort however radixsort is much faster and performs in O(n).
Re: JesseSort: A novel sorting algorithm that is faster than Python's default sort.
#17Python's default is gallop sort however radixsort is much faster and performs in O(n).
I thought it was Timsort?
Re: JesseSort: A novel sorting algorithm that is faster than Python's default sort.
#18I have mixed feelings about the naming. Isn't it kinda off-putting that he named it after himself? usually it's other people who name your algorithm after you. At least that's how it's like in science and engineering (Fourier didn't call it "Fourier transform", Laplace didn't call it "Laplace transform", Kalman didn't name it "Kalman filters", etc.)
its only ok if your name is Tim?
Re: JesseSort: A novel sorting algorithm that is faster than Python's default sort.
#19I have mixed feelings about the naming. Isn't it kinda off-putting that he named it after himself? usually it's other people who name your algorithm after you. At least that's how it's like in science and engineering (Fourier didn't call it "Fourier transform", Laplace didn't call it "Laplace transform", Kalman didn't name it "Kalman filters", etc.)
Like Dijkstra's algorithm? Knuth-Morris-Pratt algorithm? Huffman coding?
Did any of these guys put their name on the algorithm by themselves?