Talk:Sorting algorithm: Difference between revisions

Revision as of 15:46, 31 March 2005

Revision as of 19:53, 31 March 2005

Line 399:

::::::: Why are you being so vague? What do you consider to be the difference between them? Simply that your "double bubble sort" wastes time doing whole swaps? Or is there some other subtle difference that really renders them distinct algorithms? -- [[User:Smjg|Smjg]] 15:46, 31 Mar 2005 (UTC)

:::::::The wasteful swaping bit is the bubble. [http://linux.wku.edu/~lamonml/algor/sort/insertion.html] is what I understand to be an insertion sort as opposed to a bubble. Have you checked Knuth?--[[User:Irate|Jirate]] 19:53, 2005 Mar 31 (UTC)

::::::The other point is that I think you insertion sort is actually not an insertion sort. It a modified double bubble.--[[User:Irate|Jirate]] 12:40, 2005 Mar 31 (UTC)

::::::: Do you know of an algorithm that is more accurately called insertion sort? -- [[User:Smjg|Smjg]] 15:46, 31 Mar 2005 (UTC)

::::::::[http://linux.wku.edu/~lamonml/algor/sort/insertion.html] --[[User:Irate|Jirate]] 19:53, 2005 Mar 31 (UTC)