{"id":27667,"date":"2018-04-09T20:16:05","date_gmt":"2018-04-09T14:46:05","guid":{"rendered":"https:\/\/www.wikitechy.com\/technology\/?p=27667"},"modified":"2018-09-16T13:26:21","modified_gmt":"2018-09-16T07:56:21","slug":"c-algorithm-move-last-element-front-given-linked-list-2","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/technology\/c-algorithm-move-last-element-front-given-linked-list-2\/","title":{"rendered":"C Algorithm – Move last element to front of a given Linked List"},"content":{"rendered":"

Write a C function that moves last element to front in a given Singly Linked List. For example, if the given Linked List is 1->2->3->4->5, then the function should change the list to 5->1->2->3->4.<\/span><\/p>\n

Algorithm:
\nTraverse the list till last node. Use two pointers: one to store the address of last node and other for address of second last node. After the end of loop do following operations.
\ni) Make second last as last (secLast->next = NULL).
\nii) Set next of last as head (last->next = *head_ref).
\niii) Make last as head ( *head_ref = last)<\/p>\n

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

<\/div> 
\/* C Program to move last element to front in a given linked list *\/#include<stdio.h>#include<stdlib.h> \/* A linked list node *\/struct node{    int data;    struct node *next;}; \/* We are using a double pointer head_ref here because we change   head of the linked list inside this function.*\/void moveToFront(struct node **head_ref){    \/* If linked list is empty, or it contains only one node,      then nothing needs to be done, simply return *\/    if (*head_ref == NULL || (*head_ref)->next == NULL)        return;     \/* Initialize second last and last pointers *\/    struct node *secLast = NULL;    struct node *last = *head_ref;     \/*After this loop secLast contains address of second last    node and last contains address of last node in Linked List *\/    while (last->next != NULL)    {        secLast = last;        last = last->next;    }     \/* Set the next of second last as NULL *\/    secLast->next = NULL;     \/* Set next of last as head node *\/    last->next = *head_ref;     \/* Change the head pointer to point to last node now *\/    *head_ref = last;} \/* UTILITY FUNCTIONS *\/\/* Function to add a node at the begining of Linked 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;}  \/* Function to print nodes in a given linked list *\/void printList(struct node *node){    while(node != NULL)    {        printf("%d ", node->data);        node = node->next;    }} \/* Druver program to test above function *\/int main(){    struct node *start = NULL;     \/* The constructed linked list is:     1->2->3->4->5 *\/    push(&start, 5);    push(&start, 4);    push(&start, 3);    push(&start, 2);    push(&start, 1);     printf("\\n Linked list before moving last to front\\n");    printList(start);     moveToFront(&start);     printf("\\n Linked list after removing last to front\\n");    printList(start);     return 0;}<\/code><\/pre> <\/div>\n
Output:<\/strong><\/p>\n
 Linked list before moving last to front \r\n1 2 3 4 5 \r\n Linked list after removing last to front \r\n5 1 2 3<\/pre>\n
Time Complexity: O(n) where n is the number of nodes in the given Linked List.<\/p>\n","protected":false},"excerpt":{"rendered":"
C Algorithm – Move last element to front of a given Linked List – Linked List – Write a C function that moves last element to front in a given Singly<\/p>\n","protected":false},"author":1,"featured_media":31285,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[79476,79478],"tags":[81917,81924,81919,81920,81922,81925,81918,81586,81923,81921],"class_list":["post-27667","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-linked-list","category-singly-linked-list","tag-java-linked-list-move-element-to-front","tag-java-list-move-element-to-another-position","tag-move-last-element-to-front-of-a-given-linked-list-java","tag-move-node-from-one-linked-list-to-another","tag-move-to-front-java","tag-sorted-vector","tag-swap-every-two-nodes-in-a-linked-list","tag-swapping-two-nodes-in-a-singly-linked-list","tag-unsorted-linked-list","tag-write-a-method-to-add-two-polynomial-equations-using-linked-list"],"_links":{"self":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/27667","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=27667"}],"version-history":[{"count":0,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/27667\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media\/31285"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media?parent=27667"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/categories?post=27667"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/tags?post=27667"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}