import java.util.*;

public class ArrayTools {
	// class constant
	private static final int MAX_LIST_SIZE = 1000;

	public static int sequentialSearch(int[] data, int key) {
		for (int i = 0; i < data.length; ++i) {	
			if (data[i] == key) {	
				return i;	
			}	
		}	
		return -1;	
	}

	public static void putList(int[] data) {	
		for (int i = 0; i < data.length; ++i) {	
			System.out.print(data[i] + " ");
		}
		System.out.println ();
	}	


	public static int[] getList() {
		
		Scanner stdin = new Scanner (System.in);
	
		int[] buffer = new int[MAX_LIST_SIZE];
	
		int listSize = 0;	
	
		for (int i = 0; (i < MAX_LIST_SIZE) && stdin.hasNext(); ++i) {
			buffer[i] = stdin.nextInt();
			++listSize;
		}
	
		int[] data = new int[listSize];
		for (int i = 0; i < listSize; ++i) {
			data[i] = buffer[i];
		}
	
		return data;
	}	

	public static void reverse(int[] data) {
		int[] clone = data.clone();
		for ( int i = 0; i < clone.length; ++i ) {
			data[i] = clone[clone.length-1-i];
		}	
	}

	public static void selectionSort(int[] v) {
		for (int i = 0; i < v.length-1; ++i) {
		   // find the location of the ith smallest element
			int spot = i;
			for (int j = i+1; j < v.length; ++j) {
			   if (v[j] < v[spot]) { // is current location ok?
			      // update spot to index of smaller element
				spot = j;
			   }
			}
	
			// spot is now correct, so swap elements
			int rmbr = v[i];
			v[i] = v[spot];
			v[spot] = rmbr;
		}
	}

	public static int binarySearch (int[] data, int key) {
		int i = 0;              // left endpoint of search interval
		int j = data.length-1;  // right endpoint of search interval
		while ( i < j ) {
			int m = (i+j)/2;
			if ( key > data[m] ) {
				i = m+1;
			} else {
				j = m;
			}
		}
		if ( key == data[i] ) {
			return i;
		} else {
			return -1;
		}
	}


}