sum(if c(n-1)=
j
1 else 0 fi | j < k) = 1j 1 else 0 fi | j < k) = 1 n-1+sum(if c(n-1)=j 1 else 0 fi | j < k) = n
n
k
k( List)
j:k, x,y:||p(j)||. x < y 
(p(j))[x] > (p(j))[y]
j:k, x:||p(j)||. (p(j))[x] < n-1 & c((p(j))[x]) = j
n-1+sum(if c(n-1)=j 1 else 0 fi | j < k) = n
j 1 else 0 fi | j < k) = 1)
| 1 | sum(if c(n-1)=j 1 else 0 fi | j < k) = 1 | 3 steps |
| 2 | 9. sum(if c(n-1)=j 1 else 0 fi | j < k) = 1 n-1+sum(if c(n-1)=j 1 else 0 fi | j < k) = n | Auto |
About:
 |  |  |  |  |  |
 |  |  |  |  |  |