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