Question

Write array methods that carry out the following tasks for an array of integers by completing the ArrayMethods class below. For each method, provide a test program. public class

    ArrayMethods
    {        
        private int[] values; 
        public ArrayMethods(int[] initialValues) { values = initialValues; } 
        public void swapFirstAndLast() { . . . } 
        public void shiftRight() { . . . } 
        .. .
    }

• a. Swap the first and last elements in the array.
• b. Shift all elements to the right by one and move the last element into the first
• c. Replace all even elements with 0.
• d. Replace each element except the first and last by the larger of its two neighbors.
• e. Remove the middle element if the array length is odd, or the middle two elements if the length is even.
• f. Move all even elements to the front, otherwise preserving the order of the elements.
• g. Return the second-largest element in the array.
• h. Return true if the array is currently sorted in increasing order.
• i. Return true if the array contains two adjacent duplicate elements.
• j. Return true if the array contains duplicate elements (which need not be adjacent).

Answer 1

Too many question try submitting in different question

package mis;

public class ArrayMethods {
   private int[] values;
   public ArrayMethods(int[] initialValues){
       values=new int[initialValues.length]; //set size to given array
       for(int i=0;i<values.length;i++){
           values[i]=initialValues[i]; //copy one by one each element to value array
       }
   }
   public void swapFirstAndLast() {
       int val=values[values.length-1]; //swap first and last element
       values[values.length-1]=values[0];
       values[0]=val;
   }
   public void shiftRight(){
       int last=values[values.length-1]; //keep last element
       for(int i=values.length-1;i>0;i--){
           values[i]=values[i-1]; //copy prev element to cur element
       }
       values[0]=last; //set last to first
   }
   public void replaceEvenWithZero(){
       for(int i=0;i<values.length;i++){
           if(values[i]%2==0) //replace all even to zero
               values[i]=0;
       }
   }
   public void replaceLargetsOfTwoNeb(){
       for(int i=1;i<values.length-1;i++){
          
               values[i]=Integer.max(values[i-1], values[i+1]); //set cur value to max of left and right value
       }
   }
   public void removeMiddle(){
       int l=values.length;
       int temp[];
       int mid=-1;
       int mid1=-1;
       if(l%2==0){ //if length is even
           temp=new int[l-2]; //temp value will be 2 less
       }
       else{
           temp=new int[l-1]; //else 1
       }
       if(l%2==1){
           mid=l/2; //mid element
             
       }
       else{
           mid=l/2; //tow mid element
           mid1=mid-1;
       }
         
       int k=0;
       for(int i=0;i<values.length;i++){
          
             
           if(mid==i || mid1==i){ //if mid element do not copy to tem array
              
               continue;
           }
           else{
               temp[k++]=values[i]; //else copy
           }
       }
       values=temp; //make temp array to value
   }
   //to print
   public void print(){
       for(int i=0;i<values.length;i++){
               System.out.print(values[i]+" ");
           }
       System.out.println();
   }
   //driver program to test
   public static void main(String[] args) {
       int ar[]={1,2,3,4,5,0};
       ArrayMethods a=new ArrayMethods(ar);
       a.print();
       a.swapFirstAndLast();
       a.print();
       a.shiftRight();
       a.print();
       a.replaceEvenWithZero();
       a.print();
       a.replaceLargetsOfTwoNeb();
       a.print();
       a.removeMiddle();
       a.print();
   }

}

output

1 2 3 4 5 0
0 2 3 4 5 1
1 0 2 3 4 5
1 0 0 3 0 5
1 1 3 3 5 5
1 1 5 5