By: |
Thm* ![]() ![]() ![]() ![]() ![]() ![]() ![]() Thm* count(x < y in swap(L;n;n+1) | P(x,y)) Thm* = Thm* count(x < y in L | P(x,y))+if P(L[n],L[(n+1)]) ![]() Thm* count(x < y in L | P(x,y))+if P(L[n],L[(n+1)]) ![]() ![]() Thm* count(x < y in L | P(x,y))+if P(L[n],L[(n+1)]) ![]() Thm* count(x < y in L | P(x,y))+if P(L[n],L[(n+1)]) ![]() 0 THEN Repeat SplitOnConclITE |
1 |
9. P(L1[(i+1)],L1[i]) ![]() ![]() | 1 step |
About:
![]() | ![]() | ![]() | ![]() | ![]() | ![]() | ![]() | ![]() |
![]() | ![]() | ![]() | ![]() | ![]() | ![]() | ![]() | ![]() |