//  Data Structures with Java by John R. Hubbard
//  Copyright McGraw-Hill, 2001
//  Problem 2.8 on page 42

public class Pr0208
{ private static final int SIZE = 16;
  private static int[] a = new int[SIZE];
  public static void main(String[] args)
  { schaums.dswj.Arrays.load(a,40,20);
    schaums.dswj.Arrays.print(a);
    System.out.println("isSorted(a) = " + isSorted(a));
    java.util.Arrays.sort(a);
    schaums.dswj.Arrays.print(a);
    System.out.println("isSorted(a) = " + isSorted(a));
  }

  private static boolean isSorted(int[] a)
  { if (a.length<2) return true;
    for (int i=1; i<a.length; i++)
      if (a[i]<a[i-1]) return false;
    return true;
  } 
}