package t1;

import java.util.Arrays;

import edu.princeton.cs.algs4.BinarySearch;
import edu.princeton.cs.algs4.Insertion;
import edu.princeton.cs.algs4.Quick;
import edu.princeton.cs.algs4.QuickX;
import edu.princeton.cs.algs4.Selection;
import edu.princeton.cs.algs4.Shell;
import edu.princeton.cs.algs4.StdOut;
import edu.princeton.cs.algs4.StdRandom;
import edu.princeton.cs.algs4.Stopwatch;

public class BLTester {
	public static int bsearch(int[] arr,int n) {

		return BinarySearch.indexOf(arr,n);


	}
	public static int lsearch(int[] arr,int n) {
		for(int i = 0;i<arr.length;i++) {
			if(arr[i]==n) {
				return i;
			}

		}
		return 0;
	}
	public static void main(String[] args) {
		int N = 160000;
		int[] array = new int[N];
		for(int i = 0; i<N;i++) {
			array[i]=StdRandom.uniform(N);

		}
		Arrays.sort(array);

		Stopwatch bklukka = new Stopwatch();
		bsearch(array,StdRandom.uniform(N));
		StdOut.println("Binary Search time: "+bklukka.elapsedTime());

		Stopwatch lklukka = new Stopwatch();
		int found=lsearch(array,StdRandom.uniform(N));
		StdOut.println(found);
		StdOut.println("Linear search time: "+lklukka.elapsedTime());
	}

}