# Count rotations in sorted and rotated linked list

Given a linked list of n nodes which is first sorted, then rotated by k elements. Find the value of k.

The idea is to traverse singly linked list to check condition whether current node value is greater than value of next node. If the given condition is true, then break the loop. Otherwise increase the counter variable and increase the node by node->next. Below is the implementation of this approach.

`// Program for count number of rotations in ` `// sorted linked list. ` `#include <bits/stdc++.h> ` `using` `namespace` `std; ` `/* Linked list node */` `struct` `Node { ` ` ` `int` `data; ` ` ` `struct` `Node* next; ` `}; ` ` ` `// Function that count number of ` `// rotation in singly linked list. ` `int` `countRotation(` `struct` `Node* head) ` `{ ` ` ` `// declare count variable and assign it 1. ` ` ` `int` `count = 0; ` ` ` ` ` `// declare a min variable and assign to ` ` ` `// data of head node. ` ` ` `int` `min = head->data; ` ` ` ` ` `// check that while head not equal to NULL. ` ` ` `while` `(head != NULL) { ` ` ` ` ` `// if min value is greater then head->data ` ` ` `// then it breaks the while loop and ` ` ` `// return the value of count. ` ` ` `if` `(min > head->data) ` ` ` `break` `; ` ` ` ` ` `count++; ` ` ` ` ` `// head assign the next value of head. ` ` ` `head = head->next; ` ` ` `} ` ` ` `return` `count; ` `} ` ` ` `// Function to push element in linked list. ` `void` `push(` `struct` `Node** head, ` `int` `data) ` `{ ` ` ` `// Allocate dynamic memory for newNode. ` ` ` `struct` `Node* newNode = ` `new` `Node; ` ` ` ` ` `// Assign the data into newNode. ` ` ` `newNode->data = data; ` ` ` ` ` `// newNode->next assign the address of ` ` ` `// head node. ` ` ` `newNode->next = (*head); ` ` ` ` ` `// newNode become the headNode. ` ` ` `(*head) = newNode; ` `} ` ` ` `// Display linked list. ` `void` `printList(` `struct` `Node* node) ` `{ ` ` ` `while` `(node != NULL) { ` ` ` `printf` `(` `"%d "` `, node->data); ` ` ` `node = node->next; ` ` ` `} ` `} ` ` ` `// Driver functions ` `int` `main() ` `{ ` ` ` `// Create a node and initialize with NULL ` ` ` `struct` `Node* head = NULL; ` ` ` ` ` `// push() insert node in linked list. ` ` ` `// 15 -> 18 -> 5 -> 8 -> 11 -> 12 ` ` ` `push(&head, 12); ` ` ` `push(&head, 11); ` ` ` `push(&head, 8); ` ` ` `push(&head, 5); ` ` ` `push(&head, 18); ` ` ` `push(&head, 15); ` ` ` ` ` `printList(head); ` ` ` `cout << endl; ` ` ` `cout << ` `"Linked list rotated elements: "` `; ` ` ` ` ` `// Function call countRotation() ` ` ` `cout << countRotation(head) << endl; ` ` ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

Output:

Linked List: 15 18 5 8 11 12 Linked list rotated elements: 2

This article is contributed by **Dharmendra Kumar**. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: **DSA Self Paced**. Become industry ready at a student-friendly price.

## Recommended Posts:

- Count triplets in a sorted doubly linked list whose sum is equal to a given value x
- Count triplets in a sorted doubly linked list whose product is equal to a given value x
- Find the Rotation Count in Rotated Sorted array
- Count of rotations required to generate a sorted array
- Merge K sorted Doubly Linked List in Sorted Order
- Insert value in sorted way in a sorted doubly linked list
- Construct a Maximum Sum Linked List out of two Sorted Linked Lists having some Common nodes
- Given a linked list which is sorted, how will you insert in sorted way
- Sorted Linked List to Balanced BST
- Check if a Linked List is Pairwise Sorted
- Merge two sorted linked list without duplicates
- Finding Median in a Sorted Linked List
- Sort a k sorted doubly linked list
- Remove duplicates from a sorted linked list
- Sorted insert for circular linked list
- Check if linked list is sorted (Iterative and Recursive)
- Remove duplicates from a sorted linked list using recursion
- Remove all occurrences of duplicates from a sorted Linked List
- Create a sorted linked list from the given Binary Tree
- Sort linked list which is already sorted on absolute values