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