Data Structures & Algorithms Lecture Notes

3 November 2009 • Sorting Basics


static public void 
selectionSort(int a[]) {

  // Re-arrange the array elements a[0..n-1] 
  // so they are in ascending order.

  for (int i = 0; i < a.length - 1; i++) {
    int min = i;
    for (int j = i + 1; j < a.length; j++)
      if (a[min] > a[j])
	min = j;

    final int t = a[min];
    a[min] = a[i];
    a[i] = t;
    }
  }


This page last modified on 24 January 2006.