Изменения

Shakersort '''function''' shakerSort: count=0 for (int i = 0; i < n/2; i++) beg begin = 0;-1 end = n - 1; while beg<=end do count += 2 if a[beg] >a[beg + 1] Swap(a[beg],a[beg+1]); beg++ if a[end-1] > a[end] Swap(a[end - 1], a[end]); end--; '''function''' Shakersort: '''while''' swapped swapped = '''false''' begin++ '''for''' i = 0 '''begin to''' n - 2 end

swap(A[i], A[i+1]) swapped = '''true''' '''if''' swapped = '''false''' '''break''' \\выходим из while'а swapped = '''false''' end = end - 1 '''for''' i = n-2 end '''downto''' 0 begin '''if''' A[i]>A[i+1] swap (A[i],A[i+1]) swapped = '''true'''