/*
 * CS210: Data Structures
 * Assignment 1
 *
 * File       : SortAndSearchInterface.java
 * Description: Interface for sorting and searching an integer 
 *              array.
 * 
 * Department of Computer Science and Engineering,
 * Indian Institute of Technology, Kanpur.
 * India.
 *
 * Dated: 5 Aug, 2001.
 */


public interface SortAndSearchInterface
{
	/* 
	 * Method QuickSort() sorts the integer array using 
	 * Quick Sort algorithm.  The pivot value is to be 
	 * chosen randomly.
	 */
	
	public void QuickSort(int array[]);


	/*
	 * Method MergeSort() sorts the integer array using
	 * Merge Sort algorithm.
	 */
	
	public void MergeSort(int array[]);

	
	/* 
	 * Method BinarySearch() searches for an integer value
	 * "valueToSearch" and returns true if successful, else
	 * returns false.  Assumes that the array is already
	 * sorted.  If it is not, then return value is undefined.
	 */
	
	public boolean BinarySearch (int array[], int valueToSearch);

}