Linear Array

/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */
package cse220;

/**
 *
 * @author acer
 */

public class LinearArray{
  public static void main(String [] args){
    int [] a = {10, 20, 30, 40, 50, 60};

    System.out.println("\n///// TEST 01: Copy Array example /////");
    int [] b = copyArray(a, a.length);
    printArray(b); // This Should Print: { 10, 20, 30, 40, 50, 60 }

    System.out.println("\n///// TEST 02: Print Reverse example /////");
    printArray(a); // This Should Print: { 10, 20, 30, 40, 50, 60 }
    printReverse(a); // This Should Print: { 60, 50, 40, 30, 20, 10 }


    System.out.println("\n///// TEST 03: Reverse Array example /////");
    reverseArray(b);
    printArray(b); // This Should Print: { 60, 50, 40, 30, 20, 10 }


    System.out.println("\n///// TEST 04: Shift Left k cell example /////");
    b = copyArray(a, a.length);
    b=shiftLeft(b,3);
    printArray(b); // This Should Print: { 40, 50, 60, 0, 0, 0 }

    System.out.println("\n///// TEST 05: Rotate Left k cell example /////");
    b = copyArray(a, a.length);
    printArray(b); // This Should Print: { 10, 20, 30, 40, 50, 60 }
    b=rotateLeft(b,3);
    printArray(b); // This Should Print: { 40, 50, 60, 10, 20, 30 }

    System.out.println("\n///// TEST 06: Shift Right k cell example /////");
    b = copyArray(a, a.length);
    printArray(b); // This Should Print: { 10, 20, 30, 40, 50, 60 }
    b=shiftRight(b,3);
    printArray(b);  // This Should Print: { 0, 0, 0, 10, 20, 30 }

    System.out.println("\n///// TEST 07: Rotate Right k cell example /////");
    b = copyArray(a, a.length);
    printArray(b); // This Should Print: { 10, 20, 30, 40, 50, 60 }
    b=rotateRight(b,3);
    printArray(b); // This Should Print: { 40, 50, 60, 10, 20, 30 }


    System.out.println("\n///// TEST 08: Insert example 1 /////");

    b = copyArray(a, a.length);
    printArray(b);  // This Should Print: { 10, 20, 30, 40, 50, 60 }
    boolean bol=insert(b,6, 70, 2); // This Should Print: No space Left
    System.out.println(bol); // This Should Print: false
    printArray(b);  // This Should Print: { 10, 20, 30, 40, 50, 60 }

    System.out.println("\n///// TEST 09: Insert example 2 /////");
    int [] c = {10, 20, 30, 40, 50, 0, 0};
    printArray(c);  // This Should Print: { 10, 20, 30, 40, 50, 0, 0 }
    bol=insert(c,5, 70, 2);  // This Should Print: Number of elements after insertion: 6
    System.out.println(bol); // This Should Print: true
    printArray(c); // This Should Print: { 10, 20, 70, 30, 40, 50, 0 }

    System.out.println("\n///// TEST 10: Insert example 3 /////");
    printArray(c); // This Should Print: { 10, 20, 70, 30, 40, 50, 0 }
    bol=insert(c,6, 70, 6); // This Should Print: Number of elements after insertion: 7
    System.out.println(bol); // This Should Print: true
    printArray(c); // This Should Print: { 10, 20, 70, 30, 40, 50, 70 }

    System.out.println("\n///// TEST 11: Remove example 1 /////");

    printArray(c); // This Should Print: { 10, 20, 70, 30, 40, 50, 70 }
    bol=removeAll(c,7,90);
    System.out.println(bol); // This Should Print: false
    printArray(c); // This Should Print: { 10, 20, 70, 30, 40, 50, 70 }

    System.out.println("\n///// TEST 12: Remove example 2 /////");
    printArray(c);  // This Should Print: { 10, 20, 70, 30, 40, 50, 70 }
    bol=removeAll(c,7,70);
    System.out.println(bol); // This Should Print: true
    printArray(c);  // This Should Print: { 10, 20, 30, 40, 50, 0, 0 }

      System.out.println("____________________");
      int []p={1,1,2,3,2,2,5};
      System.out.println(findIndex(p,1));



  }

  // Prints the contents of the source array
  public static void printArray(int [] source){
    // TO DO
    for(int i=0;i<source.length;i++){
        if(i==source.length-1){
            System.out.print(source[i]);
        }
        else{
        System.out.print(source[i]+",");
    }
    }
      System.out.println();
  }

  // Prints the contents of the source array in reverse order
  public static void printReverse(int [] source){
    // TO DO
    for(int i=source.length-1;i>=0;i--){
        if(i==0){
            System.out.print(source[i]);
        }else{
        System.out.print(source[i]+",");
    }
    }
  }

  // creates a copy of the source array and returns the reference of the newly created copy array
  public static int [] copyArray(int [] source, int len){
    // TO DO
    int [] cpy=new int [len];
    for(int i=0;i<len;i++){
        cpy[i]=source[i];
    }
    return cpy;
    //return null; // remove this line
  }

  // creates a reversed copy of the source array and returns the reference of the newly created reversed array
  public static void reverseArray(int [] source){
    // TO DO
    int [] cpy=new int [source.length];
    for(int i=source.length-1;i>=0;i--){
        cpy[i]=source[i];
    }
    for(int i=0;i<cpy.length;i++){
        source[i]=cpy[i];
    }

  }

  // Shifts all the elements of the source array to the left by 'k' positions
  // Returns the updated array
  public static int [] shiftLeft(int [] source, int k){
    // TO DO
    for(int i=0;i<source.length-k;i++){
        source[i]=source[i+k];
    }
    for(int i=source.length-1;i>=k;i--){
        source[i]=0;
    }
    return source; // remove this line
  }

  // Rotates all the elements of the source array to the left by 'k' positions
  // Returns the updated array
  public static int [] rotateLeft(int [] source, int k){
    // TO DO
    int [] temp=copyArray(source,source.length);
    for(int i=0;i<source.length-k;i++){
        source[i]=source[i+k];

    }

    int i=source.length-1;
    int j=k-1;

    for(int c=0;c<k;c++){
    source[i]=temp[j];
    i--;
    j--;
    }
    return source; // remove this line
  }

  // Shifts all the elements of the source array to the right by 'k' positions
  // Returns the updated array
  public static int [] shiftRight(int [] source, int k){
    for(int i=0;i<source.length-k;i++){
        source[i+k]=source[i];
    }

    for(int i=0;i<k;i++){
        source[i]=0;
    }
    return source; // remove this line
  }

  // Rotates all the elements of the source array to the right by 'k' positions
  // Returns the updated array
  public static int [] rotateRight(int [] source, int k){
    // TO DO

    int [] cpy=LinearArray.copyArray(source, source.length);
     for(int i=0;i<source.length-k;i++){
        source[i+k]=source[i];
    }
     int j=k;
     for(int i=0;i<k;i++){
         source[i]=cpy[j];
         j++;
     }


    return source; // remove this line
  }

  /** @return true if insertion is successful; @return false otherwise
    * @param arr the reference to the linear array
    * @param size the number of elements that exists in the array. size<=arr.length
    * @param elem the element that is to be inserted
    * @param index the index in which the element is required to be inserted
    * if insertion is not successful due to lack space, print "No space Left"
    * if given index is invalid, print "Invalid Index"
    * if insertion is successful, print the 'Number of elements after insertion' is completed
    */
  public static boolean insert(int [] arr, int size, int elem, int index){
    // TO DO
    if(size+1>arr.length){
        return false;
    }
    else if(index<0 || index>arr.length-1){
        return false;
    }
    else{
       for(int i=size-1;i>=index;i--){
           arr[i+1]=arr[i];

       }
       arr[index]=elem;
        return true;
    }
  }

  /**
   * removes all the occurences of the given element
   * @param arr the reference to the linear array
   * @param size the number of elements that exists in the array. size<=arr.length
   * @param elem the element to be removed
   * @return true if removal is successful; return false otherwise
   * if removal is successful, print the 'Number of elements after removal' is completed
   */
  public static boolean removeAll(int [] arr, int size, int elem){
    // TO DO
    boolean a=false;
        int index=0;
        for(int i=0;i<arr.length;i++){
            if(arr[i]==elem){
                if(i==arr.length-1)
                {
                    arr[i]=0;
                }
                else
                {
                    index=i;
                }
                a=true;
            }
        }
        if(a){
            for(int i=index;i<=size-2;i++){
                arr[i]=arr[i+1];
            }
        arr[size-1]=0;
        return true;
        }
        else
        {
            return false;
        }

  }

  public static int findIndex(int [] arr,int elem){

      int occ=-1;
      for(int i=0;i<arr.length;i++){
          if(elem==arr[i]){
              occ=i;
              break;
          }
      }
      return occ;
  }

}