Метод сортування “Бульбашка”
|
1 2 3 4 5 6 7 8 9 10 11 |
from random import * n = int (input()) a = [randint(0,100) for i in range(n)] print a n = 1 while n < len(a): for i in range(len(a)-n): if a[i] > a[i+1]: a[i],a[i+1] = a[i+1],a[i] n = n+1 print a |
Метод сортування вибором
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 |
from random import * n = int (input()) a = [randint(0,100) for i in range(n)] print a k = 0 while k < len(a) - 1: m = k i = k + 1 while i < len(a): if a[i] < a[m]: m = i i = i+1 p = a[k] a[k] = a[m] a[m] = p k = k+1 print a |