java code that completes tasks forr an array integers.
Swaped the first and last elements in array.
Replace all even elements with 0.
Shift all elements by one to the right and move the last element into the first position. For example, 1 4 9 16 25 would be turned i into 25 1 4 9 16.
Replace each element except first and last the larger of its two neighbors.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here