Printable View
What is the name of the following sorting method?
It seems to be the opposite of bubble sort, with lighter elements going in their proper positions first. However, this one does not compare a[j] with a[j+1], as the normal bubble sort does.Code:for (i=0; i<n-1; i++)
for (j=i+1; j<n; j++)
if (a[i]>a[j])
swap(&a[i], &a[j]);
Looks very simple, and I wonder why I couldn't find it anywhere on the net!
> lighter elements going in their proper positions first
or larger elements being pushed down - this is the definition of a bubble sort because the items percolate to their proper places. That and the code looks like a bubble sort to me.
As you say, bubble sort swaps adjacent elements. It also sets a flag to show that a swap has taken place and repeats until the flag remains unset on a pass through the array.Quote:
Originally Posted by noodles
This is a Shell sort that gets the first element from wherever it is in the rest of the array and then gets the second element, etc. no need for a flag and usually more efficient.
>As you say, bubble sort swaps adjacent elements.
Not necessarily.
>It also sets a flag to show that a swap has taken place and repeats until the flag remains unset
Again, not necessarily.
>This is a Shell sort
It's most certainly not a Shell sort. If Shell sort were so trivial, life would be grand indeed.
Oh yeah ... it's that other one init ... I'm always getting those two confused ... um ... ?Quote:
Originally Posted by Prelude
[guesses] It's not an insert sort either. [/guesses]Quote:
Originally Posted by risby
It's a bubble sort, just like I said.