Talk:Sorting algorithms/Permutation sort: Difference between revisions
Content added Content deleted
No edit summary |
(tcl incorrect?) |
||
| Line 1: | Line 1: | ||
How is this different from [[Bogosort]]? |
How is this different from [[Bogosort]]? |
||
:I just changed the description to show how. Trying out permutations in any ordered fashion is not the same as randomly shuffling (which is what bogosort does).--[[User:Mwn3d|Mwn3d]] 19:13, 7 May 2008 (MDT) |
:I just changed the description to show how. Trying out permutations in any ordered fashion is not the same as randomly shuffling (which is what bogosort does).--[[User:Mwn3d|Mwn3d]] 19:13, 7 May 2008 (MDT) |
||
The Tcl example does not contain an explicit loop. It seems unlikely to me that "firstperm" is itself doing a permutation sort, and a web search didn't turn up anything informative (I don't know Tcl myself). Could someone who knows more add explanation/mark incorrect/fix? --[[User:Kevin Reid|Kevin Reid]] 23:40, 25 May 2009 (UTC) |
|||
Revision as of 23:40, 25 May 2009
How is this different from Bogosort?
- I just changed the description to show how. Trying out permutations in any ordered fashion is not the same as randomly shuffling (which is what bogosort does).--Mwn3d 19:13, 7 May 2008 (MDT)
The Tcl example does not contain an explicit loop. It seems unlikely to me that "firstperm" is itself doing a permutation sort, and a web search didn't turn up anything informative (I don't know Tcl myself). Could someone who knows more add explanation/mark incorrect/fix? --Kevin Reid 23:40, 25 May 2009 (UTC)