Decorate-sort-undecorate idiom: Difference between revisions
m
→{{header|Fōrmulæ}}
(Added C++ solution) |
|||
| (5 intermediate revisions by 4 users not shown) | |||
Line 1:
{{task}}
[[Category:Sorting]]
;Introduction
Line 348 ⟶ 350:
'''Solution'''
Let us create an array for testing:
[[File:Fōrmulæ - Decorate-sort-undecorate idiom 01.png]]
'''Decorate-sort-undecorate:''' The following is a solution using a decorate-sort-undecorate idiom:
Line 357 ⟶ 363:
[[File:Fōrmulæ - Decorate-sort-undecorate idiom 03.png]]
[[File:Fōrmulæ - Decorate-sort-undecorate idiom
Line 786 ⟶ 792:
│ 6 │ chrestomathy │
╰───┴──────────────╯
</pre>
=={{header|Perl}}==
<syntaxhighlight lang="perl">#!/usr/bin/perl
use strict; # https://rosettacode.org/wiki/Decorate-sort-undecorate_idiom
use warnings;
use List::AllUtils qw( nsort_by );
my @list = ("Rosetta", "Code", "is", "a", "programming", "chrestomathy", "site");
print "@list\n";
my @sortedlist = nsort_by { length } @list;
print "@sortedlist\n";</syntaxhighlight>
{{out}}
<pre>
Rosetta Code is a programming chrestomathy site
a is Code site Rosetta programming chrestomathy
</pre>
Line 1,008 ⟶ 1,032:
cached: ["a", "is", "Code", "site", "Rosetta", "programming", "chrestomathy"]
transform: ["a", "is", "Code", "site", "Rosetta", "programming", "chrestomathy"]
</pre>
=={{header|Sidef}}==
<syntaxhighlight lang="ruby">var str = "Rosetta Code is a programming chrestomathy site"
# Built-in
say str.split.sort_by{.len}
# Same thing explicitly
say str.split.map {|w| [w, w.len] }.sort{|a,b| a[1] <=> b[1] }.map { _[0] }
# Sort by word length, then lexical:
var str2 = str+" seven extra words added to this demo"
say str2.split.sort_by{|word| [word.len, word] }</syntaxhighlight>
{{out}}
<pre>
["a", "is", "Code", "site", "Rosetta", "programming", "chrestomathy"]
["a", "is", "Code", "site", "Rosetta", "programming", "chrestomathy"]
["a", "is", "to", "Code", "demo", "site", "this", "added", "extra", "seven", "words", "Rosetta", "programming", "chrestomathy"]
</pre>
Line 1,015 ⟶ 1,058:
It's not specified how words of equal length are to be sorted. The standard sort() method used here (quicksort under the hood) is unstable and so the sort order for such words is not guaranteed.
<syntaxhighlight lang="
System.print(a.map { |e| [e, f.call(e)] } // decorate
.toList
| |||