Class AlgorithmAnalysis With Main Class

// Class AlgorithmAnalysis
public class AlgorithmAnalysis {

public boolean LinearSearch(int[] arr, int key)
{
for (int i=0;i<arr.length;i++)
if(key==arr[i])
return true;
return false;
}
public boolean BinarySearch(int[] arr, int key)
{
int Low=0;
int Upper=arr.length-1;
int m=(Low+Upper)/2;

while(key!=arr[m] && Low>0 && Upper<arr.length)
{
if(key<arr[m])
Upper=m-1;
else
Low=m+1;
}
if (key==arr[m])
return true;
else
return false;
}

public void display(int[] arr) {
for (int i = 0; i < arr.length; i++)
System.out.print(arr[i]+" , ");
System.out.println();

}

}


import java.util.Arrays;
public class AlgorithmAnalysisDemo{
public static void main(String[] args) {
AlgorithmAnalysis Algo = new AlgorithmAnalysis();
int n= 100;
int[] arr = new int[n];
for(int i=0;i<n;i++){
arr[i] = (int)(Math.random()*1000)+1;
}
Algo.display(arr);

Arrays.sort(arr);
int StartTime = (int) System.nanoTime();
System.out.println(Algo.LinearSearch(arr, arr[n-1]));
int EndTime = (int) System.nanoTime();
System.out.println("Linear Search Run Time is "+ (EndTime-StartTime) + " nano seconds.");

int StartTime1 = (int) System.nanoTime();
System.out.println(Algo.BinarySearch(arr, arr[n-1]));
int EndTime1 = (int) System.nanoTime();
System.out.println("Binary Search Run Time is "+ (EndTime1-StartTime1) + " nano seconds.");

}
}