// CS7 - 
// some methods that may help in the Keno project 

// numberPresent()
// given some integer (n), this method will tell you if it is
// present somewhere in the array between locations low and high
// (not including high).
// This will be handy in detecting duplicates 
static boolean numberPresent(int n, int low, int high, int [] a) {
	for (int i=low; i<high; i++)
		if (a[i] == n)
			return true;
	return false;  // if the loop ends, we made it through w/out finding n
}

// reads a number between low and high from the keyboard.
static int getIntInRange(int low, int high) {
	int n=low-1;
	while (n < low || n > high) {
		System.out.print("Please enter an integer between " + low + " and "
					+ high + ": ");
		n = Console.in.readInt();
	}
	return n;
}

// prints the integers in an array all on one line.
static void printPicks(int a []) {
	for (int i=0; i<a.length; i++)
  		System.out.print(a[i] + " ");
	System.out.println();
}