k10.
x = c(n-1)
if c(n-1)=
x
1 else 0 fi = 0x 1 else 0 fi | x < k) = if c(n-1)=c(n-1) 1 else 0 fi sum(if c(n-1)=j 1 else 0 fi | j < k) = 1
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
sum(if c(n-1)=j 1 else 0 fi | j < k) = 1
n:, f:(n), m:n. (x:n. x = m f(x) = 0) sum(f(x) | x < n) = f(m)
[k;
j. if c(n-1)=j 1 else 0 fi;c(n-1)]
| 1 | 9. x: k 10. x = c(n-1) if c(n-1)=x 1 else 0 fi = 0 | 1 step |
| 2 | 9. sum(if c(n-1)=x 1 else 0 fi | x < k) = if c(n-1)=c(n-1) 1 else 0 fi sum(if c(n-1)=j 1 else 0 fi | j < k) = 1 | 1 step |
About:
 |  |  |  |  |
 |  |  |  |  |  |