{"id":27086,"date":"2018-01-02T22:13:16","date_gmt":"2018-01-02T16:43:16","guid":{"rendered":"https:\/\/www.wikitechy.com\/technology\/?p=27086"},"modified":"2018-01-02T22:13:16","modified_gmt":"2018-01-02T16:43:16","slug":"c-algorithm-write-function-counts-number-times-given-int-occurs-linked-list","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/technology\/c-algorithm-write-function-counts-number-times-given-int-occurs-linked-list\/","title":{"rendered":"C Algorithm – Write a function that counts the number of times a given int occurs in a Linked List"},"content":{"rendered":"

Given a singly linked list and a key, count number of occurrences of given key in linked list. For example, if given linked list is 1->2->1->2->1->3->1 and given key is 1, then output should be 4.<\/p>\n

Algorithm:<\/strong><\/p>\n

1. Initialize count as zero.\r\n2. Loop through each element of linked list:\r\n     a) If element data is equal to the passed number then\r\n        increment the count.\r\n3. Return count. \r\n<\/pre>\n
C Programming:<\/strong><\/p>\n
 
 <\/div> 
\/\/ C\/C++ program to count occurrences in a linked list#include<stdio.h>#include<stdlib.h> \/* Link list node *\/struct node{    int data;    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_data){    \/* allocate node *\/    struct node* new_node =            (struct node*) malloc(sizeof(struct node));     \/* put in the data  *\/    new_node->data  = new_data;     \/* 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;} \/* Counts the no. of occurences of a node   (search_for) in a linked list (head)*\/int count(struct node* head, int search_for){    struct node* current = head;    int count = 0;    while (current != NULL)    {        if (current->data == search_for)           count++;        current = current->next;    }    return count;} \/* Drier program to test count function*\/int main(){    \/* Start with the empty list *\/    struct node* head = NULL;     \/* Use push() to construct below list     1->2->1->3->1  *\/    push(&head, 1);    push(&head, 3);    push(&head, 1);    push(&head, 2);    push(&head, 1);     \/* Check the count function *\/    printf("count of 1 is %d", count(head, 1));    return 0;}<\/code><\/pre> <\/div>\n
Output:<\/strong><\/p>\n
count of 1 is 3<\/pre>\n
Time Complexity:<\/strong> O(n)
\nAuxiliary Space:<\/strong> O(1)<\/p>\n[ad type=”banner”]\n","protected":false},"excerpt":{"rendered":"
C Algorithm – Write a function that counts the number of times a given int occurs in a Linked List – Linked List – Given a singly linked list and a key <\/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":[80781,80785,80783,80788,80240,80782,80786,80787,80790,80789,80784],"class_list":["post-27086","post","type-post","status-publish","format-standard","hentry","category-c-programming","category-coding","category-linked-list","category-singly-linked-list","tag-algorithm-to-count-the-number-of-nodes-in-linked-list","tag-c-program-to-count-repeated-number-in-an-array","tag-count-nodes-in-linked-list-c","tag-count-the-number-of-nodes-in-a-doubly-linked-list","tag-find-length-of-linked-list-java","tag-how-to-count-the-number-of-nodes-in-a-linked-list-java","tag-linked-list-count-java","tag-pseudo-code-to-delete-a-singly-linked-list","tag-pseudocode-to-delete-a-singly-linked-list","tag-write-a-program-to-count-the-number-of-times-an-item-is-present-in-a-linked-list","tag-write-a-python-program-that-accept-a-word-from-the-user-and-reverse-it"],"_links":{"self":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/27086","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=27086"}],"version-history":[{"count":0,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/27086\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media?parent=27086"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/categories?post=27086"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/tags?post=27086"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}