Assignment 1 - Binary Search Practice Test Set Example

[rajibdasbhagat]

Is their any example for list of “n elements” with “n rotations”? I can’t think of any.

[Sebgolos (Sebastian)]

Assignment 1 - Binary Search and Linked Lists Practice

0 You have to find the minimal amount of rotations. You can rotate only 0 to n-1 times the initially sorted list before you go back to the original one. If you’ll rotate n times, you get back to original, sorted list. Rotating n+1 times, creates a list that would look as if it had been rotated only one time.