| Python: запоминание алгоритмов |
| 1 | import random |
| 2 | def qsort(arr, l, r): if l >= r: return arr else: q = random.choice(arr[l:r + 1]) i = l j = r while i <= j: while arr[i] < q: i += 1 while arr[j] > q: j -= 1 if i <= j: arr[i], arr[j] = arr[j], arr[i] i += 1 j -= 1 qsort(arr, l, j) qsort(arr, i, r) a = [] |
| 3 | for i in range(22): a.append(random.randint(1, 99)) |
| 4 | print(a) qsort(a, 0, len(a) - 1) print(a) |
Комментарии