File size: 1,385 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 |
class Search{
Node first, last, t;
static class Node{
int data;
Node next;
Node(int d){
data =d;
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){
if(p!=null){
System.out.print(p.data+" ");
Display(p.next);
}
}
void Search(Node p, int x){
while(p!=null){
if(p.data == x){
System.out.println("\n"+x+" is Found");
break;
}
p = p.next;
}
}
int Recur(Node p, int x){
if(p.data!=x){
return Recur(p.next,x);
}
return p.data;
}
// search based on the index
int Length(Node p){
int len =0;
while(p!=null){
len++;
p =p.next;
}
return len;
}
void Sind(Node p, int index){
for(int i=1; i <=Length(p);i++){
if(i==index){
System.out.println(p.data+" is in "+index+" index");
break;
}
p = p.next;
}
}
public static void main(String[] args){
Search l = new Search();
int a[] = {1,3,3,4,5};
int n = a.length;
l.create(a,n);
l.Display(l.first);
l.Search(l.first,3);
System.out.println(l.Recur(l.first,4));
System.out.println();
l.Sind(l.first,4);
}
}
|