Chapter 13, Problem 21E

Explanation of Solution

Program method

• The algorithm for implementing bogo sort is

  // Places the elements of a into sorted order.

  public static void bogoSort(int[] a)

  {

 while (!isSorted(a))

  {

  shuffle(a);

 }

 }

 // Returns true if a's elements are in sorted order.

 public static boolean isSorted(int[] a)

 {

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

  {

  if (a[i] > a[i + 1])

  {

  return false;

  }

  }

  return true;

 }

 // Shuffles an array of ints by randomly swapping each

 // element with an element ahead of it in the array.

 public static void shuffle(int[] a)

 {

  for (int i = 0; i < a...