Chapter 13, Problem 19E

Explanation of Solution

Program method

• The modified version of selection sort algorithm is

  //Declare method dualSelectionSort

  public static void dualSelectionSort(int[] a)

  {

 //Define for loop

  for (int i = 0; i < a.length / 2; i++)

  {

  // find index of smallest/largest element

  int smallest = i;

  int largest = i;

 //Define for loop

  for (int j = i + 1; j < a.length - i; j++)

  {

 if (a[j] < a[smallest])

 {

  smallest = j;

  }

  else if (a[j] > a[largest])

  {

  largest = j;

>&#x...