Selection Sort

/* Sort A[0..n] into non-decreasing order. */

public void sort(int[] A, int n)

{

for ( int k = 0; k < n; k++ )

{

/* Given that A[0..k-1] is finished,

finish A[0..k]. */

int minLoc; // subscript of

// smallest in A[k..n]

/* Set minLoc so A[minLoc] is

smallest in A[k..n]. */

minLoc = k;

for (int i=k+1; i <= n; i++)

if (A[i] < A[minLoc])

minLoc = i;

/* Exchange A[k] and A[minLoc] */

{

int temp = A[k];

A[k] = A[minLoc];

A[minLoc] = temp;

}

}

}

All cases: O(n2)

Previous slide

Next slide

Back to first slide

View graphic version