package com.swain.cell;
public class LinearSearch {
public static void main(String[] args)
{
System.out.println("Linear Search List");
int[] arr = {0,2879, 15, 29, 78, 26, 24, 44, 167, 13,24,47};
int i;
int num = 44;
boolean flag=false;
for(i=0; i<arr.length; i++){
if(arr[i]==num){
flag=true;
break;
}
}//for
if(flag){
System.out.println(num + " index position "+i);
}
else{
System.out.println(num + " no not found");
}
}
}
public class LinearSearch {
public static void main(String[] args)
{
System.out.println("Linear Search List");
int[] arr = {0,2879, 15, 29, 78, 26, 24, 44, 167, 13,24,47};
int i;
int num = 44;
boolean flag=false;
for(i=0; i<arr.length; i++){
if(arr[i]==num){
flag=true;
break;
}
}//for
if(flag){
System.out.println(num + " index position "+i);
}
else{
System.out.println(num + " no not found");
}
}
}
No comments:
Post a Comment