Untitled
user_9492606
plain_text
a year ago
936 B
17
Indexable
import java.util.*;
import java.lang.*;
import java.io.*;
class Codechef
{
public static void update(int marks[]){
for(int i=0;i<marks.length;i++){
marks[i]+=1;
}
}
public static int linearSearch(int numbers[],int key){
for(int i=0;i<numbers.length;i++){
if(numbers[i]==key){
return i;
}
}
return -1;
}
public static void main (String[] args) throws java.lang.Exception
{
// int marks[]={56,60,67};
// update(marks);
// for(int i=0;i<marks.length;i++){
// System.out.println(marks[i]+" ");
// }
int numbers[]={0,7,1,2,3,4,5,6,7,8,9,10,11};
int key=100;
int value=linearSearch(numbers,key);
if(value<0){
System.out.println("key doesn't exist");
}else{
System.out.println("Key is "+value);
}
}
}
Editor is loading...
Leave a Comment