| Бейсик | Python |
|---|---|
| j = 7 WHILE A(j) > A(j+1) t = A(j) A(j) = A(j+1) A(j+1) = t j = j - 1 WEND | j = 7 while A[j] > A[j+1]: A[j], A[j+1] = A[j+1], A[j] j -= 1 |
| Алгоритмический язык | Паскаль |
| j := 7 нц пока A[j] > A[j+1] t := A[j] A[j] := A[j+1] A[j+1] := t j := j - 1 кц | j := 7; while A[j] > A[j+1] do begin t := A[j]; A[j] := A[j+1]; A[j+1] := t; j := j - 1; end; |
| С ++ | |
| j = 7; while (A[j] > A[j+1]) { t = A[j]; A[j] = A[j+1]; A[j+1] = t; j -= 1; } |
Ответ: