Talk:Sorting algorithms/Permutation sort: Difference between revisions

Content added Content deleted

Inline

Revision as of 00:06, 26 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)

Tcl wrong?

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)

From the docs it seems that a solution has only just started to be etched out. How do you mark incorrect? --Paddy3118 00:06, 26 May 2009 (UTC)

@@ Line 2: / Line 2: @@
 :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)
+==Tcl wrong?==
 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)
+:From [http://tcllib.sourceforge.net/doc/struct_list.html the docs] it seems that a solution has only just started to be etched out. How do you mark incorrect? --[[User:Paddy3118|Paddy3118]] 00:06, 26 May 2009 (UTC)