Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

%3Cp%3EFor%20each%20of%20the%20three%20sort%20methods%20edit%20them%20to%20count

ID: 3552208 • Letter: #

Question

%3Cp%3EFor%20each%20of%20the%20three%20sort%20methods%20edit%20them%20to%20count%20and%0Adisplay%20the%20numbr%20of%20theoretical%20element%20comparisons%20and%20movements%0Aas%20well%20as%20the%20actual%20number%20of%20element%20comparisons%20and%0Amovements.%3C%2Fp%3E%0A%3Cp%3E%3Cbr%20%2F%3E%3C%2Fp%3E%0A%3Cp%3Evoid%20AList%3A%3ABubbleSort()%3C%2Fp%3E%0A%3Cp%3E%7B%3C%2Fp%3E%0A%3Cp%3Efor(int%20i%3D0%3Bi%26lt%3Bsize-1%3Bi%2B%2B)%3C%2Fp%3E%0A%3Cp%3Efor(int%20j%3D0%3Bj%26lt%3Bsize-1%3Bj%2B%2B)%3C%2Fp%3E%0A%3Cp%3E%7B%3C%2Fp%3E%0A%3Cp%3Eif(items%5Bj%5D%26gt%3Bitems%5Bj%2B1%5D)%3C%2Fp%3E%0A%3Cp%3E%7B%3C%2Fp%3E%0A%3Cp%3ESwap(j%2Cj%2B1)%3B%3C%2Fp%3E%0A%3Cp%3E%7D%3C%2Fp%3E%0A%3Cp%3E%3Cbr%20%2F%3E%3C%2Fp%3E%0A%3Cp%3Eelse%3C%2Fp%3E%0A%3Cp%3E%3B%3C%2Fp%3E%0A%3Cp%3E%7D%3C%2Fp%3E%0A%3Cp%3E%7D%3C%2Fp%3E%0A%3Cp%3E%3Cbr%20%2F%3E%3C%2Fp%3E%0A%3Cp%3Evoid%20AList%3A%3AInsertionSort()%3C%2Fp%3E%0A%3Cp%3E%7B%3C%2Fp%3E%0A%3Cp%3Ebool%20done%3B%3C%2Fp%3E%0A%3Cp%3Eint%20j%3B%3C%2Fp%3E%0A%3Cp%3E%3Cbr%20%2F%3E%3C%2Fp%3E%0A%3Cp%3Efor(int%20i%3D1%3Bi%26lt%3Bsize%3Bi%2B%2B)%3C%2Fp%3E%0A%3Cp%3E%7B%3C%2Fp%3E%0A%3Cp%3Ej%3Di%3B%3C%2Fp%3E%0A%3Cp%3Edone%3Dfalse%3B%3C%2Fp%3E%0A%3Cp%3E%3Cbr%20%2F%3E%3C%2Fp%3E%0A%3Cp%3Ewhile((j%26gt%3B%3D1)%26amp%3B%26amp%3B(done!%3Dtrue))%3C%2Fp%3E%0A%3Cp%3E%7B%3C%2Fp%3E%0A%3Cp%3Eif(items%5Bj%5D%26lt%3Bitems%5Bj-1%5D)%3C%2Fp%3E%0A%3Cp%3E%7B%3C%2Fp%3E%0A%3Cp%3ESwap(j%2Cj-1)%3B%3C%2Fp%3E%0A%3Cp%3Ej--%3B%3C%2Fp%3E%0A%3Cp%3E%7D%3C%2Fp%3E%0A%3Cp%3E%3Cbr%20%2F%3E%3C%2Fp%3E%0A%3Cp%3Eelse%3C%2Fp%3E%0A%3Cp%3E%7B%3C%2Fp%3E%0A%3Cp%3Edone%3Dtrue%3B%3C%2Fp%3E%0A%3Cp%3E%7D%3C%2Fp%3E%0A%3Cp%3E%7D%3C%2Fp%3E%0A%3Cp%3E%7D%3C%2Fp%3E%0A%3Cp%3E%7D%3C%2Fp%3E%0A%3Cp%3E%3Cbr%20%2F%3E%3C%2Fp%3E%0A%3Cp%3Evoid%20AList%3A%3ASelectionSort()%3C%2Fp%3E%0A%3Cp%3E%7B%3C%2Fp%3E%0A%3Cp%3Eint%20maxpos%3B%3C%2Fp%3E%0A%3Cp%3E%3Cbr%20%2F%3E%3C%2Fp%3E%0A%3Cp%3Efor(int%20i%3D(size-1)%3Bi%26gt%3B0%3Bi--)%3C%2Fp%3E%0A%3Cp%3E%7B%3C%2Fp%3E%0A%3Cp%3Emaxpos%3D0%3B%3C%2Fp%3E%0A%3Cp%3E%3Cbr%20%2F%3E%3C%2Fp%3E%0A%3Cp%3Efor(int%20j%3D1%3Bj%26lt%3B%3Di%3Bj%2B%2B)%3C%2Fp%3E%0A%3Cp%3E%7B%3C%2Fp%3E%0A%3Cp%3Eif(items%5Bj%5D%26gt%3Bitems%5Bmaxpos%5D)%3C%2Fp%3E%0A%3Cp%3E%7B%3C%2Fp%3E%0A%3Cp%3Emaxpos%3Dj%3B%3C%2Fp%3E%0A%3Cp%3E%7D%3C%2Fp%3E%0A%3Cp%3E%3Cbr%20%2F%3E%3C%2Fp%3E%0A%3Cp%3Eelse%3C%2Fp%3E%0A%3Cp%3E%7B%3C%2Fp%3E%0A%3Cp%3ESwap(i%2Cmaxpos)%3B%3C%2Fp%3E%0A%3Cp%3E%7D%3C%2Fp%3E%0A%3Cp%3E%7D%3C%2Fp%3E%0A%3Cp%3E%7D%3C%2Fp%3E%0A%3Cp%3E%7D%3C%2Fp%3E%0A

Explanation / Answer

/* use count with initialization as zero to count the number of comparison made , count++ increase each time comparison is made */