{"id":27004,"date":"2018-01-02T20:39:14","date_gmt":"2018-01-02T15:09:14","guid":{"rendered":"https:\/\/www.wikitechy.com\/technology\/?p=27004"},"modified":"2018-01-02T20:39:14","modified_gmt":"2018-01-02T15:09:14","slug":"find-middle-given-linked-list","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/technology\/find-middle-given-linked-list\/","title":{"rendered":"C Algorithm – Find the middle of a given linked list"},"content":{"rendered":"

Given a singly linked list, find middle of the linked list. For example, if given linked list is 1->2->3->4->5 then output should be 3.<\/p>\n

If there are even nodes, then there would be two middle nodes, we need to print second middle element. For example, if given linked list is 1->2->3->4->5->6 then output should be 4<\/p>\n

Method 1:<\/strong>
\nTraverse the whole linked list and count the no. of nodes. Now traverse the list again till count\/2 and return the node at count\/2.
\n<\/span><\/p>\n

Method 2:<\/strong>
\nTraverse linked list using two pointers. Move one pointer by one and other pointer by two. When the fast pointer reaches end slow pointer will reach middle of the linked list.<\/p>\n

C Programming:<\/strong><\/p>\n

<\/div> 
#include<stdio.h>#include<stdlib.h> \/* Link list node *\/struct node{    int data;    struct node* next;}; \/* Function to get the middle of the linked list*\/void printMiddle(struct node *head){    struct node *slow_ptr = head;    struct node *fast_ptr = head;     if (head!=NULL)    {        while (fast_ptr != NULL && fast_ptr->next != NULL)        {            fast_ptr = fast_ptr->next->next;            slow_ptr = slow_ptr->next;        }        printf("The middle element is [%d]\\n\\n", slow_ptr->data);    }} 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;} \/\/ A utility function to print a given linked listvoid printList(struct node *ptr){    while (ptr != NULL)    {        printf("%d->", ptr->data);        ptr = ptr->next;    }    printf("NULL\\n");} \/* Drier program to test above function*\/int main(){    \/* Start with the empty list *\/    struct node* head = NULL;    int i;     for (i=5; i>0; i--)    {        push(&head, i);        printList(head);        printMiddle(head);    }     return 0;}<\/code><\/pre> <\/div>\n
Output:<\/strong><\/p>\n
5->NULL\r\nThe middle element is [5]\r\n\r\n4->5->NULL\r\nThe middle element is [5]\r\n\r\n3->4->5->NULL\r\nThe middle element is [4]\r\n\r\n2->3->4->5->NULL\r\nThe middle element is [4]\r\n\r\n1->2->3->4->5->NULL\r\nThe middle element is [3]<\/pre>\n[ad type=”banner”]\n
Method 3:<\/strong>
\nInitialize mid element as head and initialize a counter as 0. Traverse the list from head, while traversing increment the counter and change mid to mid->next whenever the counter is odd. So the mid will move only half of the total length of the list.
\nThanks to Narendra Kangralkar for suggesting this method.<\/p>\n
C Programming:<\/strong><\/p>\n
 
 <\/div> 
#include<stdio.h>#include<stdlib.h> \/* Link list node *\/struct node{    int data;    struct node* next;}; \/* Function to get the middle of the linked list*\/void printMiddle(struct node *head){    int count = 0;    struct node *mid = head;     while (head != NULL)    {        \/* update mid, when 'count' is odd number *\/        if (count & 1)            mid = mid->next;         ++count;        head = head->next;    }     \/* if empty list is provided *\/    if (mid != NULL)        printf("The middle element is [%d]\\n\\n", mid->data);}  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;} \/\/ A utility function to print a given linked listvoid printList(struct node *ptr){    while (ptr != NULL)    {        printf("%d->", ptr->data);        ptr = ptr->next;    }    printf("NULL\\n");} \/* Drier program to test above function*\/int main(){    \/* Start with the empty list *\/    struct node* head = NULL;    int i;     for (i=5; i>0; i--)    {        push(&head, i);        printList(head);        printMiddle(head);    }     return 0;}<\/code><\/pre> <\/div>\n
Output:<\/strong><\/p>\n
5->NULL\r\nThe middle element is [5]\r\n\r\n4->5->NULL\r\nThe middle element is [5]\r\n\r\n3->4->5->NULL\r\nThe middle element is [4]\r\n\r\n2->3->4->5->NULL\r\nThe middle element is [4]\r\n\r\n1->2->3->4->5->NULL\r\nThe middle element is [3]<\/pre>\n[ad type=”banner”]\n","protected":false},"excerpt":{"rendered":"
C Algorithm – Find the middle of a given linked list – Linked List – Given a singly linked list, find middle of the linked list<\/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":[80603,80604,80598,80601,80602,80600,80599,80597,80605],"class_list":["post-27004","post","type-post","status-publish","format-standard","hentry","category-c-programming","category-coding","category-linked-list","category-singly-linked-list","tag-find-middle-element-in-array","tag-find-middle-node-in-doubly-linked-list","tag-how-to-find-3rd-element-from-end-in-a-linked-list-in-one-pass","tag-how-to-find-a-loop-in-the-singly-linked-list","tag-how-to-find-if-linked-list-has-a-loop","tag-how-to-find-middle-element-of-linked-list-in-c","tag-how-to-find-middle-element-of-linked-list-in-one-pass-in-c","tag-how-to-find-middle-element-of-linked-list-in-one-pass-in-java","tag-write-a-program-to-find-the-middle-element-of-the-linked-list-in-c"],"_links":{"self":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/27004","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=27004"}],"version-history":[{"count":0,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/27004\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media?parent=27004"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/categories?post=27004"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/tags?post=27004"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}