Linear_Search_In_A_LL.cpp

#include<bits/stdc++.h>
#include<stdio.h>
#include<stdlib.h>

struct Node{
    int data;
    struct Node *next;
}*first=NULL;

void create(int A[],int n){
    int i;
    struct Node *t,*last;
    first=(struct Node *)malloc(sizeof(struct Node));
    first->data=A[0];
    first->next=NULL;
    last=first;

    for(i=0;i<n;i++){
        t=(struct Node *)malloc(sizeof(struct Node));
        t->data=A[i];
        t->next=NULL;
        last->next=t;
        last=t;
    }
}

struct Node *LSearch(struct Node *p,int key){
    struct Node *q=NULL;
    while(p!=NULL){
        if(key==p->data){
            q->next=p->next;
            p->next=first;
            first=p;
            return p;
        }
        q=p;
        p=p->next;
    }
    return NULL;
};
struct Node *RSearch(struct Node *p,int key){
    if(p==NULL)
        return NULL;
    if(key==p->data)
        return p;
    return RSearch(p->next,key);
};



int main(){
    struct Node *temp;
    int A[]={3,5,7,10,25,8,32,2};
    create(A,8);
    temp=LSearch(first,8);
    if(temp)
        printf("Element is Found: %d",temp->data);
    else
        printf("Element Not Found");
    return 0;
}