File size: 1,302 Bytes
c574d3a |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 |
class Search{
Node first, last, t;
static class Node{
int data;
Node next;
// constructor
Node(int d){
this.data =d;
this.next = null;
}
}
void create(int a[], int n){
first = new Node(a[0]);
last = first;
for(int i=1; i <n; ++i){
t = new Node(a[i]);
last.next = t;
last = t;
}
}
void Display(){
Node p = first;
while(p!=null){
System.out.print(p.data+" ");
p = p.next;
}
}
// done
void search(Node o, int x){
int flag = 0;
while(o!=null){
if(o.data==x){
flag=1;
break;
}
else{
flag = 0;
}
o =o.next;
}
if(flag==1){
System.out.println("Element "+o.data+" is found");
}
else{
System.out.println("Element is not found");
}
}
void Recursive(Node p, int x){
if(p==null){
return;
}
if(p.data == x){
System.out.println(x+" Found");
}
else{
Recursive(p.next,x);
}
}
public static void main(String[] args){
Search l = new Search();
int a[] = {3,4,5,62,3,4,6};
int n = a.length;
l.create(a,n);
l.search(l.first,62);
l.search(l.first, 56);
l.Recursive(l.first,4);
l.Display();
}
}
|