Your Friendly Array Neighbor   Program only in java not in python Create a Java program that takes an array called ar as an input that keeps track of arrays. Every day a new array is produced using the array of the previous day. On the n’th day, the following operations are performed on the array of day n – 1 to produce the array of day n:   -If an element is smaller than both left and right neighbor, then this element is incremented -If an element is bigger than both its left neighbor and its right neighbor, then this element is decremented. -The first and last elements should never change   Eventually after some days the array will not change, some examples:   Example: Input from user: ar = [6,2,3,4] Output from program: [6,3,3,4] After the first day the array is changed from [6,2,3,4] to [6,3,3,4] and no further operations may be completed.   Example: Input from user: ar = [1,6,3,4,3,5] Output from program: [1,4,4,4,4,5]   After the first day the array is changed from [1,6,3,4,3,5] to [1,5,4,3,4,5]. After the second day the array is changed from [1,5,4,3,4,5] to [1,4,4,4,4,5] and no further operations may be completed.

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...
icon
Related questions
Question

Your Friendly Array Neighbor

 

Program only in java not in python

Create a Java program that takes an array called ar as an input that keeps track of arrays. Every day a new array is produced using the array of the previous day. On the n’th day, the following operations are performed on the array of day n – 1 to produce the array of day n:

 

-If an element is smaller than both left and right neighbor, then this element is incremented

-If an element is bigger than both its left neighbor and its right neighbor, then this element is decremented.

-The first and last elements should never change

 

Eventually after some days the array will not change, some examples:

 

Example:

Input from user: ar = [6,2,3,4]

Output from program: [6,3,3,4]

After the first day the array is changed from [6,2,3,4] to [6,3,3,4] and no further operations may be completed.

 

Example:

Input from user: ar = [1,6,3,4,3,5]

Output from program: [1,4,4,4,4,5]

 

After the first day the array is changed from [1,6,3,4,3,5] to [1,5,4,3,4,5].

After the second day the array is changed from [1,5,4,3,4,5] to [1,4,4,4,4,5] and no further operations may be completed.

Expert Solution
steps

Step by step

Solved in 2 steps with 3 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY