Write a method that takes an array of integers as input. The method should find and...

Write a method that takes an array of integers as input. The method should find and display two indices m and n such that if you sort the elements from index m to index n the entire array would be sorted. The method should minimize m − n, that is it should find the smallest subsection for the array that needs to be sorted. For example,

int[] a = {2, 4, 6, 7, 9, 8, 12, 15, 5, 13, 18, 20}

get_unsorted_section(a); // prints 2 and 9

Please use Java. Thanks!

Expert Solution

class Main 
{ 
        static void get_unsorted_section(int arr[], int n) 
        { 
        int s = 0, e = n-1, i, max, min; 
        for (s = 0; s < n-1; s++) 
        { 
                if (arr[s] > arr[s+1]) 
                break; 
        } 
        if (s == n-1) 
        { 
                return; 
        } 
                
        for(e = n - 1; e > 0; e--) 
        { 
                if(arr[e] < arr[e-1]) 
                break; 
        } 
                
        max = arr[s]; min = arr[s]; 
        for(i = s + 1; i <= e; i++) 
        { 
                if(arr[i] > max) 
                max = arr[i]; 
                if(arr[i] < min) 
                min = arr[i]; 
        } 
                
        for( i = 0; i < s; i++) 
        { 
                if(arr[i] > min) 
                { 
                s = i; 
                break; 
                }        
        } 
                
        for( i = n -1; i >= e+1; i--) 
        { 
                if(arr[i] < max) 
                { 
                e = i; 
                break; 
                } 
        } 
                        
        System.out.println(s+" "+e); 
        return; 
        } 
                
        public static void main(String args[]) 
        { 
        int arr[] = {2, 4, 6, 7, 9, 8, 12, 15, 5, 13, 18, 20}; 
        int arr_size = arr.length; 
        get_unsorted_section(arr, arr_size); 
        } 
}

Here is the desire code. Please check it out. I hope it helps.
Thank you

venereology answered 6 months ago

Write a function ‘sort1’ that takes in an array of non-zero positive integers as input and...

Write a function ‘sort1’ that takes in an array of non-zero positive integers as input and returns a second vector that contains only the odd numbers. It will return zero if all elements are even. Use error-traps to check against probable errors in user input. In case of an error, it will return NaN. You are allowed to use Matlab built-in function round(). Check your code with the following arrays: >> y1 = [18, -5, 89, -7, 4, 10, 12,...

Write a Java method that takes an array of char and a String as input parameters...

Write a Java method that takes an array of char and a String as input parameters and and returns an boolean. The method returns true if we can find the input string inside the array by starting at any position of the array and reading either forwards or backwards.

use java for : 1. Write a method called indexOfMax that takes an array of integers...

use java for : 1. Write a method called indexOfMax that takes an array of integers and returns the index of the largest element. 2. The Sieve of Eratosthenes is “a simple, ancient algorithm for finding all prime numbers up to any given limit” (https://en.wikipedia. org/wiki/Sieve_of_Eratosthenes).Write a method called sieve that takes an integer parameter, n, and returns a boolean array that indicates, for each number from 0 to n -1, whether the number is prime.

.. Write a method called findNums that takes a two-dimension array of integers as a parameter...

.. Write a method called findNums that takes a two-dimension array of integers as a parameter and returns the number of times a two-digit number appears in the array. For example, if the array (as created by the program below) is 10 45 3 8 2 42 3 21 44 The value returned would be 5 (there are 5 two-digit numbers in the array) public class Question2 { public static void main(String args[]){ int arr[][] = {{10, 45,...

FOR JAVA Write a method called findNum that takes a two-dimension array of integers and an...

FOR JAVA Write a method called findNum that takes a two-dimension array of integers and an int as parameters and returns the number of times the integer parameter appears in the array. For example, if the array (as created by the program below) is 10 45 3 8 2 42 3 21 44 And the integer parameter is 3, the value returned would be 2 (the number 3 appears two times in the array) public class HomeworkA { public static...

Write a method, remove, that takes three parameters: an array of integers, the length of the array, and an integer called removeItem.

Java programming:Write a method, remove, that takes three parameters: an array of integers, the length of the array, and an integer called removeItem. The method should find and delete the first occurrence of removeItem in the array. If the value does not exist or the array is empty, output an appropriate message. (Note that after deleting the element, the array size is reduced by 1.) You may assume that the array is unsorted.Now re-do this exercise and name it ExInsertionSort....

in java language Write a method called findNums that takes a two-dimension array of integers and...

in java language Write a method called findNums that takes a two-dimension array of integers and an int as parameters and returns the number of times the integer parameter appears in the array. For example, if the array (as created by the program below) is 10 45 3 8 2 42 3 21 44 And the integer parameter is 3, the value returned would be 2 (the number 3 appears two times in the array) public class Question2 { ...

java/ netbeans Write a recursive method smallestNumber which takes an ArrayList of Integers as input and...

java/ netbeans Write a recursive method smallestNumber which takes an ArrayList of Integers as input and returns the smallest number in the array. You can use a helper method if needed. Write a main method that asks the user for a series of numbers, until the user enters a period. Main should create an ArrayList of these Integers and call smallestNumber to find the smallest number and print it. Compile and test your code in NetBeans and then on Hackerrank.

Code in Java Write a recursive method smallestNumber which takes an ArrayList of Integers as input...

Code in Java Write a recursive method smallestNumber which takes an ArrayList of Integers as input and returns the smallest number in the array. You can use a helper method if needed. Write a main method that asks the user for a series of numbers, until the user enters a period. Main should create an ArrayList of these Integers and call smallestNumber to find the smallest number and print it. Input Format A series of integers Constraints None Output Format...

Write a function that takes a list of integers as input and returns a list with...

Write a function that takes a list of integers as input and returns a list with only the even numbers in descending order (Largest to smallest) Example: Input list: [1,6,3,8,2,5] List returned: [8, 6, 2] Do not use any special or built in functions like append, reverse etc.

Question