{"id":26916,"date":"2017-12-26T21:17:37","date_gmt":"2017-12-26T15:47:37","guid":{"rendered":"https:\/\/www.wikitechy.com\/technology\/?p=26916"},"modified":"2017-12-26T21:17:37","modified_gmt":"2017-12-26T15:47:37","slug":"c-algorithm-search-element-linked-list-iterative-recursive","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/technology\/c-algorithm-search-element-linked-list-iterative-recursive\/","title":{"rendered":"C Algorithm – Search an element in a Linked List both Iterative and Recursive"},"content":{"rendered":"

Write a C function that searches a given key \u2018x\u2019 in a given singly linked list. The function should return true if x is present in linked list and false otherwise.<\/span><\/p>\n

   bool search(Node *head, int x)<\/pre>\n
For example, if the key to be searched is 15 and linked list is 14->21->11->30->10, then function should return false. If key to be searched is 14, then the function should return true.<\/p>\n
Iterative Solution<\/strong><\/p>\n
2) Initialize a node pointer, current = head.\r\n3) Do following while current is not NULL\r\n    a) current->key is equal to the key being searched return true.\r\n    b) current = current->next\r\n4) Return false<\/pre>\n
C Programming:<\/strong><\/p>\n
 
 <\/div> 
\/\/ Iterative C program to search an element in linked list#include<stdio.h>#include<stdlib.h> \/* Link list node *\/struct node{    int key;    struct node* next;}; \/* Given a reference (pointer to pointer) to the head  of a list and an int, push a new node on the front  of the list. *\/void push(struct node** head_ref, int new_key){    \/* allocate node *\/    struct node* new_node =            (struct node*) malloc(sizeof(struct node));     \/* put in the key  *\/    new_node->key  = new_key;     \/* link the old list off the new node *\/    new_node->next = (*head_ref);     \/* move the head to point to the new node *\/    (*head_ref)    = new_node;} \/* Checks whether the value x is present in linked list *\/bool search(struct node* head, int x){    struct node* current = head;  \/\/ Initialize current    while (current != NULL)    {        if (current->key == x)            return true;        current = current->next;    }    return false;} \/* Driver program to test count function*\/int main(){    \/* Start with the empty list *\/    struct node* head = NULL;    int x = 21;     \/* Use push() to construct below list     14->21->11->30->10  *\/    push(&head, 10);    push(&head, 30);    push(&head, 11);    push(&head, 21);    push(&head, 14);     search(head, 21)? printf("Yes") : printf("No");    return 0;}<\/code><\/pre> <\/div>\n[ad type=”banner”]\n
Output:<\/strong><\/p>\n
Yes<\/pre>\n
Recursive Solution<\/strong><\/p>\n
bool search(head, x)<\/strong>\r\n1) If head is NULL, return false.\r\n2) If head's key is same as x, return true;\r\n2) Else return search(head->next, x)<\/pre>\n
C Programming:<\/strong><\/p>\n
 
 <\/div> 
\/\/ Recursive C program to search an element in linked list#include<stdio.h>#include<stdlib.h> \/* Link list node *\/struct node{    int key;    struct node* next;}; \/* Given a reference (pointer to pointer) to the head  of a list and an int, push a new node on the front  of the list. *\/void push(struct node** head_ref, int new_key){    \/* allocate node *\/    struct node* new_node =            (struct node*) malloc(sizeof(struct node));     \/* put in the key  *\/    new_node->key  = new_key;     \/* link the old list off the new node *\/    new_node->next = (*head_ref);     \/* move the head to point to the new node *\/    (*head_ref)    = new_node;} \/* Checks whether the value x is present in linked list *\/bool search(struct node* head, int x){    \/\/ Base case    if (head == NULL)        return false;         \/\/ If key is present in current node, return true    if (head->key == x)        return true;     \/\/ Recur for remaining list    return search(head->next, x);} \/* Driver program to test count function*\/int main(){    \/* Start with the empty list *\/    struct node* head = NULL;    int x = 21;     \/* Use push() to construct below list     14->21->11->30->10  *\/    push(&head, 10);    push(&head, 30);    push(&head, 11);    push(&head, 21);    push(&head, 14);     search(head, 21)? printf("Yes") : printf("No");    return 0;}<\/code><\/pre> <\/div>\n[ad type=”banner”]\n
Output:<\/strong><\/p>\n
Yes<\/pre>\n","protected":false},"excerpt":{"rendered":"
C Algorithm – Search an element in a Linked List both Iterative and Recursive –  Linked List – Write a C function that searches a given key \u2018x\u2019 in a given<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[69866,1,79476,79478],"tags":[80299,80286,80289,80291,80290,80292,80298,80296,80294,80300,80293,80295,80297,80288,80287,80285],"class_list":["post-26916","post","type-post","status-publish","format-standard","hentry","category-c-programming","category-coding","category-linked-list","category-singly-linked-list","tag-algorithm-to-reverse-a-linked-list-in-data-structure","tag-algorithm-to-search-an-element-in-singly-linked-list","tag-binary-search-using-linked-list","tag-find-the-length-of-the-linked-list-using-recursion","tag-linked-list-recursion-c","tag-linked-list-recursion-java","tag-reverse-a-linked-list-algorithm","tag-reverse-a-linked-list-c","tag-reverse-a-linked-list-java","tag-reverse-a-linked-list-recursively-c","tag-reverse-a-linked-list-using-recursion-in-c","tag-reverse-a-singly-linked-list","tag-reverse-linked-list-recursive-java","tag-search-an-element-in-doubly-linked-list","tag-search-linked-list-complexity","tag-searching-in-linked-list-algorithm"],"_links":{"self":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/26916","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/comments?post=26916"}],"version-history":[{"count":0,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/26916\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media?parent=26916"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/categories?post=26916"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/tags?post=26916"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}