A message in the Forum inquired on sorting strings in APL with a custom comparison function.
First, sorting strings without a custom comparison function obtains with a terse expression:
{⍵[⍋↑⍵]} 'syzygy' 'boustrophedon' 'kakistocracy' 'chthonic'
┌─────────────┬────────┬────────────┬──────┐
│boustrophedon│chthonic│kakistocracy│syzygy│
└─────────────┴────────┴────────────┴──────┘
Sorting strings with a custom comparison function can also be accomplished succinctly by simple modifications to the Quicksort function
Q←{1≥≢⍵:⍵ ⋄ S←{⍺⌿⍨⍺ ⍺⍺ ⍵} ⋄ ⍵((∇<S)⍪=S⍪(∇>S))⍵⌷⍨?≢⍵}
in a Dyalog blog post in 2014. A version that accepts a comparison function operand is:
QS←{1≥≢⍵:⍵ ⋄ (∇ ⍵⌿⍨0>s),(⍵⌿⍨0=s),∇ ⍵⌿⍨0<s←⍵ ⍺⍺¨ ⍵⌷⍨?≢⍵}
The operand function ⍺ ⍺⍺ ⍵
is required to return ¯1
, 0
, or 1
, according to whether ⍺
is less than, equal to, or greater than ⍵
. In QS
, the phrase s←⍵ ⍺⍺¨ ⍵⌷⍨?≢⍵
compares each element of ⍵
against a randomly chosen pivot ⍵⌷⍨?≢⍵
; the function then applies recursively to the elements of ⍵
which are less than the pivot (0>s)
and those which are greater than the pivot (0<s)
.
Example with numbers:
(×-)QS 3 1 4 1 5 9 2 6 5 3 5 8 97 9
1 1 2 3 3 4 5 5 5 6 8 9 9 97
3(×-)4
¯1
3(×-)3
0
3(×-)¯17
1
Example with strings:
strcmp←{⍺≡⍵:0 ⋄ ¯1*</⍋↑⍺ ⍵}
'syzygy' strcmp 'syzygy'
0
'syzygy' strcmp 'eleemosynary'
1
'syzygy' strcmp 'zumba'
¯1
strcmp QS 'syzygy' 'boustrophedon' 'kakistocracy' 'chthonic'
┌─────────────┬────────┬────────────┬──────┐
│boustrophedon│chthonic│kakistocracy│syzygy│
└─────────────┴────────┴────────────┴──────┘
A more efficient string comparison function is left as an exercise for the reader. 🙂
This prompted me to go and check on a paper I wrote just before I left Sellafield and joined I.P.Sharp. Published in 1978. A few years prior to that I found the book in the works library that changed my life. “A Programming Language”. I never used a flowchart again. Every thing was designed in what we called “Iverson Notation”. Anyway, to get to the point I implemented a version of Quicksort in IBM Assembler which I think was based on Ken’s version. If anyone has a copy can they tell me if I am right and is it on Page 141?
Nick Telfer
In Dyalog’s copy of A Programming Language page 141 has a section called “Controlled scan” and a diagram of a binary search algorithm.
Quicksort doesn’t seem to be mentioned in the book. The algorithm was published in 1961, and the book was published in 1962, so he would have had to work fast to get it in there!