131
правка
Изменения
→Модификации
combsort(a):
jump = n
bool swapped = true;
while (jump > 1 '''and''' swapped) {
if (jump > 1)
jump /= 1.24733;
swapped = false;
for ( i = 0; i + jump < size; ++i)
if (a[i + jump]< array[i])) {
swap(array[i], array[i + jump]);
swapped = true;
'''function''' shakerSort:
begin = -1
end = n - 2
'''while''' swapped
swapped = ''false''
begin++
'''for''' i= begin to end
'''if''' A[i] > A[i+1]
swap(A[i],A[i+1])
swapped = ''true''
'''if''' swapped = false
'''break'''
swapped = ''false''
end = end - 1
'''for''' i = end '''downto''' begin
'''if''' A[i]>A[i+1]
swap(A[i],A[i+1])
swapped = ''true''
