Jump to content

Sorting algorithms/Permutation sort: Difference between revisions

Sorting algorithms/Permutation sort (view source)

Revision as of 13:52, 9 November 2010

35 bytes removed ,  13 years ago
m
→‎{{header|Tcl}}: use better template
m (→‎{{header|Tcl}}: use better template)
Line 780:
 
=={{header|Tcl}}==
{{tcllib|struct::list}}
using package <code>struct::list</code> from {{libheader|tcllib}}. The <code>firstperm</code> procedure actually returns the lexicographically first permutation of the input list. However, to meet the letter of the problem, let's loop:
<lang tcl>package require Tcl 8.5
package require struct::list
Anonymous user
Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/72769"
Cookies help us deliver our services. By using our services, you agree to our use of cookies.
More information