Question

in java no mathcall please

ennas are out of date.Please sign was wkollieemail.cpeedu so we can verily your subscription Sign In ASSIGNMENT Unit 9 Methods, Arrays, and the Java Standard Class Library Reimplementing the Arrays class (60 points) The Arrays class, which is also part of the Java standard class library, provides various class methods that perform common tasks on arrays, such as searching and sorting. Write a public class called MyArrays, which provides some of the functionality which is also provided by the Arrays class. This class should define the public and static methods described below:

Answer 1

Java program :

MyArrays.java

public class MyArrays
{
    public static int linearSearch(int arr[],int key, int start, int end) // linear search with start and end positions of array
    {
        for(int i=start; i<end; i++)
        {
            if(arr[i] == key)    // if element found then return its index
            {
                return i;
            }
        }
        return -1;      // if element not found return -1
    }
    
    public static int linearSearch(int arr[],int key) // linear search of all elements in array
    {
        for(int i=0; i<arr.length; i++)
        {
            if(arr[i] == key)
            {
                return i;
            }
        }
        return -1;
    }
    
    public static boolean equals(int arr1[], int arr2[])  // checks if two arrays are equal or not
    {
        int n1 = arr1.length;
        int n2 = arr2.length;
        if(arr1==null && arr2==null)  // check if both arrays are null
        {
            return true;
        }
        else if((arr1!=null && arr2==null) || (arr1==null && arr2!=null) || n1!=n2) // check if one of the array is null
        {
            return false;
        }
        else
        {
            for(int i=0; i<n1; i++)
            {
                if(arr1[i] != arr2[i])
                {
                    return false;
                }
            }
            return true;
        }
    }
    
    public static void fill(int arr[], int val, int start, int end)  // fills the array with the given value from start to end
    {
        for(int i=start; i<end; i++)
        {
            arr[i] = val;
        }
    }

    public static void fill(int arr[], int val) // fills the whole array with the given value
    {
        for(int i=0; i<arr.length; i++)
        {
            arr[i] = val;
        }
    }
    
    public static int[] copyOf(int arr[], int start, int end) // creates a copy of sub-array and returns it
    {
        int[] array = new int[end-start];
        int k=0;
        for(int i=start; i<end; i++)
        {
            array[k]=arr[i];
            k++;
        }
        return array;
    }

    public static int[] copyOf(int arr[])  // creates a copy of entire array and returns it
    {
        int[] array = new int[arr.length];
        for(int i=0; i<arr.length; i++)
        {
            array[i]=arr[i];
        }
        return array;
    }
    
    public static void sort(int arr[],int start, int end)  // sorts a part of array fom start...end
    {
        int min, temp;
        int i=start;
        
        while(i != end-1)
        {
            min = arr[i];
            for(int j=i; j<end; j++)
            {
                if(arr[j] < min)
                {
                    min = arr[j];
                    
                    temp = arr[i];
                    arr[i] = arr[j];
                    arr[j] = temp;
                }
            }
            i++;
        }
    }
    
    public static void sort(int arr[])   // sorts the entire array in ascending order
    {
        int n = arr.length;
        int min, temp;
        int i=0;
        
        while(i != n-1)
        {
            min = arr[i];
            for(int j=i; j<n; j++)
            {
                if(arr[j] < min)
                {
                    min = arr[j];
                    
                    temp = arr[i];
                    arr[i] = arr[j];
                    arr[j] = temp;
                }
            }
            i++;
        }
    }
    
    public static String toString(int arr[])   // converts a array to a string 
    {
       String str = "[";
       for(int i =0 ;i<arr.length;i++)
       {
           if(i!=arr.length-1)
           {
               str = str + Integer.toString(arr[i]) + ", ";
           }
           else
           {
               str = str + Integer.toString(arr[i]) + "]";
           }
       }
       return str;
    }
}

Screenshot :

public class MyArrays { public static int linearSearch(int arr[], int key, int start, int end) // linear search with start and end positions of array { for(int i=start; i<end; i++) { if(arr[i] key) // if element found then return its index { return i; } } return -1; // if element not found return -1 } public static int linear Search(int arr[], int key) // linear search of all elements in array { for(int i=0; i<arr.length; i++) if(arr[i] key) { return i; } } return } public static boolean equals(int arr1[], int arr2[]) // checks if two arrays are equal or not { int n1 = arr1.length; int n2 = arr2.length; if(arr1==null && arr2==null) // check if both arrays are null { return true; } else if((arr1!=null && arr2==null) || (arr1==null && arr2!=null) || n1!=n2) // check if one of the array is null { return false; } else { for(int i=0; i<n1; i++) { if(arr1[i] != arr2[i]) { return false; } } return true; } }

public static void fill(int arr[], int val) // fills the whole array with the given value { for(int i=0; i<arr.length; i++) { arr[i] = val; } } public static int[] copyOf(int arr[], int start, int end) // creates a copy of sub-array and returns it { int[] array = new int[end-start]; int k=0; for(int i=start; i<end; i++) { array[k]=arr[i]; k++; } return array; } public static int[] copyOf(int arr[]) // creates a copy of entire array and returns it { int[] array = new int[arr.length]; for(int i=0; i<arr.length; i++) { array[i]=arr[i]; } return array; } public static void sort(int arr[], int start, int end) // sorts a part of array fom start...end { int min, temp; int i=start; while(i != end-1) { min = arr[i]; for(int j=i; j<end; j++) { if(arr[j] < min) { min = arr[j]; temp arr[i]; arr[i] = arr[j]; arr[j] = temp; } } i++; } }

// sorts the entire array in ascending order public static void sort(int arr[]) { int n = arr.length; int min, temp; int i=0; while(i != n-1) { min = arr[i]; for(int j=i; j<n; j++) { if(arr[j] < min) { min = arr[j]; temp = arr[i]; arr[i] = arr[j]; arr[j] = temp; } } i++; } } public static String toString(int arr[]) // converts a array to a string { String str = "["; for(int i =0 ;i<arr.length; i++) { if(i!=arr.length-1) { str = str + Integer.toString(arr[i]) } else { str = str + Integer.toString(arr[i] + "]"; } } return str; } }