descendingRuns w
A descending run is a maximal subsequence of successive descents.
i1 : p = permutation {3,1,2,5,4} o1 = Permutation{3, 1, 2, 5, 4} o1 : Permutation
i2 : descendingRuns p o2 = {(3, 1), 1 : (2), (5, 4)} o2 : List
The object descendingRuns is a method function.