C Program - Array Positive and Negative Rotations Make a program that creates two arrays by asking the size n of the arrays (the two arrays have the same size) and their corresponding n integer inputs. Example: Input size of the arrays: 5 Array 1 elements: 1 2 3 4 5 Array 2 elements: 3 4 5 1 2 You are tasked to determine the minimum # of positive and negative rotations of Array 2 to become Array 1. A positive rotation is a rotation to the right while a negative rotation is a rotation to the left. Given the example elements of Array 1 and Array 2 above, here's a sample computation: Right Rotations 3 4 5 1 2 -> 2 3 4 5 1 -> 1 2 3 4 5 = 2 rotations Left Rotations 3 4 5 1 2 -> 4 5 1 2 3 -> 5 1 2 3 4 -> 1 2 3 4 5 = -3 rotations Output the number with the highest absolute value (but still display the negative sign, if the selected value is the value of the left rotations which is negative). If the two values are equal, output the negative value and if it's impossible to determine the # of rotations (i.e. Array 2 can never become Array 1 no matter how much we rotate it), output the message "Impossible." SAMPLE 1: Input size of the arrays: 5 Array 1 elements: 1 2 3 4 5 Array 2 elements: 3 4 5 1 2 Minimum # of rotations: 2 SAMPLE 2: Input size of the arrays: 6 Array 1 elements: 7 8 2 2 5 6 Array 2 elements: 2 2 5 6 8 7 Impossible. SAMPLE 3: Input size of the arrays: 3 Array 1 elements: 7 8 2 Array 2 elements: 2 7 8 Minimum # of rotations: -1

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

C Program - Array Positive and Negative Rotations

Make a program that creates two arrays by asking the size n of the arrays (the two arrays have the same size) and their corresponding n integer inputs.

Example:

Input size of the arrays: 5 Array 1 elements: 1 2 3 4 5 Array 2 elements: 3 4 5 1 2

You are tasked to determine the minimum # of positive and negative rotations of Array 2 to become Array 1. A positive rotation is a rotation to the right while a negative rotation is a rotation to the left.

Given the example elements of Array 1 and Array 2 above, here's a sample computation:

Right Rotations 3 4 5 1 2 -> 2 3 4 5 1 -> 1 2 3 4 5 = 2 rotations

Left Rotations 3 4 5 1 2 -> 4 5 1 2 3 -> 5 1 2 3 4 -> 1 2 3 4 5 = -3 rotations

Output the number with the highest absolute value (but still display the negative sign, if the selected value is the value of the left rotations which is negative).

If the two values are equal, output the negative value and if it's impossible to determine the # of rotations (i.e. Array 2 can never become Array 1 no matter how much we rotate it), output the message "Impossible."

SAMPLE 1:

Input size of the arrays: 5

Array 1 elements: 1 2 3 4 5

Array 2 elements: 3 4 5 1 2

Minimum # of rotations: 2

SAMPLE 2:

Input size of the arrays: 6

Array 1 elements: 7 8 2 2 5 6

Array 2 elements: 2 2 5 6 8 7

Impossible.

SAMPLE 3:

Input size of the arrays: 3

Array 1 elements: 7 8 2

Array 2 elements: 2 7 8

Minimum # of rotations: -1

Expert Solution

Step by step

Solved in 4 steps with 2 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Fundamentals of Multithreaded Algorithms

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-engineering and related others by exploring similar questions and additional content below.

Similar questions