class SelectionSortAlgorithm extends SortAlgorithm {
  void sort(int a[]) throws Exception {

    // Fill in the holes in the following code:
    for ([ fill in the outer loop ]) {
      for ( [ fill in the inner loop ]) {

	  // Put code in here that 
	  // finds the largest of the remaining (unsorted) items


	// Leave the following line in, but don't worry about it
	if (stopRequested) { return; }

      } // End of inner loop

      // put code here that swaps the largest item found in the inner loop
      // with the item occupying the position in which this largest belongs

    } // End of outer loop

    // Leave the following line in, but don't worry about it
    pause();

  } // End of sort method

} // End of class declaration