Question: How do I complete the following function that shifts all the elements of a list backward one place. The last element that gets shifted off
How do I complete the following function that shifts all the elements of a list backward one place. The last element that gets shifted off the back end of the list is copied into the first (0th) position. For example, if a list containing the elements 2, 1, 10, 4, 3, 6, 7, 9, 8, 5 is passed to the function, it would be transformed into 5, 2, 1, 10, 4, 3, 6, 7, 9, 8. The function must physically rearrange the elements within the list, not just print the elements in the shifted order. So for all I have is - def rotate(first):
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
