Jump to content

Sorting algorithms/Quicksort: Difference between revisions

Sorting algorithms/Quicksort (view source)

Revision as of 13:34, 26 April 2008

45 bytes removed ,  16 years ago
→‎{{header|UnixPipes}}
Line 442:
 
=={{header|UnixPipes}}==
split() {
# though it looks imperative at first sight, the logic is actually
(pivot=$1; lc=$2; gc=$3;
# a pipeline split again and again into smaller ones and joined together.
while read n ; do
test $pivot -gt $n && echo $n > $lc || echo $n > $gc
done)▼
}
 
qsort() {
lc="1.$1" ; gc="2.$1"
read pivot; while readtest -n ;"$pivot" && do(
testsplit $pivot -gt $n && echo $n>(cat >> $lc) ||>( echo $ncat >> $gc);
test -n "$pivot" && ( (cat -s $lc | qsort $lc ); echo $pivot; (cat -s $gc | qsort $gc ))▼
▲ done
)
▲ test -n "$pivot" && ( (cat -s $lc | qsort $lc ); echo $pivot; (cat -s $gc | qsort $gc ))
rm -f $lc $gc;
}
 
 
cat to.sort | qsort
Rahul
418

edits

Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/34590"
Cookies help us deliver our services. By using our services, you agree to our use of cookies.
More information