import java.awt.LinearGradientPaint; public class searchComparision { /** * @param args */ public static void linearSearch(int arr[],int n) { for(int i =0;i=n) { break; } } System.out.println(\"\"); } static void binarySearch(int arr[],int start,int end,int n) { if(endn) { binarySearch(arr, start,mid-1,n); } else { binarySearch(arr,mid+1,end,n); } return; } public static void main(String[] args) { // TODO Auto-generated method stub int arr[] = {4,8,12,23,54,84,89,110}; int n=8; linearSearch(arr,n); binarySearch(arr,0,arr.length-1,n); n=33; linearSearch(arr,n); binarySearch(arr,0,arr.length-1,n); n=84; linearSearch(arr,n); binarySearch(arr,0,arr.length-1,n); } } Solution import java.awt.LinearGradientPaint; public class searchComparision { /** * @param args */ public static void linearSearch(int arr[],int n) { for(int i =0;i=n) { break; } } System.out.println(\"\"); } static void binarySearch(int arr[],int start,int end,int n) { if(endn) { binarySearch(arr, start,mid-1,n); } else { binarySearch(arr,mid+1,end,n); } return; } public static void main(String[] args) { // TODO Auto-generated method stub int arr[] = {4,8,12,23,54,84,89,110}; int n=8; linearSearch(arr,n); binarySearch(arr,0,arr.length-1,n); n=33; linearSearch(arr,n); binarySearch(arr,0,arr.length-1,n); n=84; linearSearch(arr,n); binarySearch(arr,0,arr.length-1,n); } }.

1. import java.awt.LinearGradientPaint;
public class searchComparision {
/**
* @param args
*/
public static void linearSearch(int arr[],int n)
{
for(int i =0;i=n)
{
break;
}
}
System.out.println("");
}
static void binarySearch(int arr[],int start,int end,int n)
{
if(endn)
{
binarySearch(arr, start,mid-1,n);
}
else
{
binarySearch(arr,mid+1,end,n);
}
return;
}
public static void main(String[] args) {
// TODO Auto-generated method stub
int arr[] = {4,8,12,23,54,84,89,110};
int n=8;
linearSearch(arr,n);
binarySearch(arr,0,arr.length-1,n);

2. n=33;
linearSearch(arr,n);
binarySearch(arr,0,arr.length-1,n);
n=84;
linearSearch(arr,n);
binarySearch(arr,0,arr.length-1,n);
}
}
Solution
import java.awt.LinearGradientPaint;
public class searchComparision {
/**
* @param args
*/
public static void linearSearch(int arr[],int n)
{
for(int i =0;i=n)
{
break;
}
}
System.out.println("");
}
static void binarySearch(int arr[],int start,int end,int n)
{
if(endn)
{
binarySearch(arr, start,mid-1,n);
}
else
{
binarySearch(arr,mid+1,end,n);

3. }
return;
}
public static void main(String[] args) {
// TODO Auto-generated method stub
int arr[] = {4,8,12,23,54,84,89,110};
int n=8;
linearSearch(arr,n);
binarySearch(arr,0,arr.length-1,n);
n=33;
linearSearch(arr,n);
binarySearch(arr,0,arr.length-1,n);
n=84;
linearSearch(arr,n);
binarySearch(arr,0,arr.length-1,n);
}
}