# 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. ## Recommended: Please try your approach on {IDE} first, before moving on to the solution.

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 ` `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; ` `} `

Output:

```Linked List:
15 18 5 8 11 12
```

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.

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.

My Personal Notes arrow_drop_up

Improved By : Akanksha_Rai

Article Tags :
Practice Tags :

5

Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.