Question

Need help with my Java Hw:

Consider an algorithm that sorts an array of n elements by finding the smallest and largest elements and then exchanges those elements with the elements in the first and last positions in the array. Then the size of the array is reduced by two elements after excluding the two elements that are already in the proper positions, and the process is repeated on the remaining part of the array until the entire array is sorted.

Write a code to implement the above algorithm.

Write a driver program to show the novel sorting algorithm works correctly.

Please complete all steps and show proof of code working

DO THIS IN JAVA PLEASE

Answer 1

JAVA Program:

import java.io.*;
import java.util.*;

class Sorter {
   public static int findMinIndex(int arr[],int start,int end){
int minIndex=start;
for(int i=start+1;i<=end;i++){
if(arr[i]<arr[minIndex])
minIndex=i;
}
       return minIndex;
}
public static int findMaxIndex(int arr[],int start,int end){
int maxIndex=start;
for(int i=start+1;i<=end;i++){
if(arr[i]>arr[maxIndex])
maxIndex=i;
}
return maxIndex;
}
public static void swap(int arr[],int pos1,int pos2){
int temp=arr[pos1];
arr[pos1]=arr[pos2];
arr[pos2]=temp;
}
public static void sorter(int arr[],int n){
int start=0,end=n-1;
while(start<end){
int minIndex=findMinIndex(arr,start,end);
           int maxIndex=findMaxIndex(arr,start,end);
           swap(arr,start,minIndex);
swap(arr,end,maxIndex);
start++;
end--;
}
}
   public static void main (String[] args) {
       int n;
       System.out.println("Enter the size of the array: ");
       Scanner sc = new Scanner(System.in);
       n=sc.nextInt();
       int []arr=new int[n];
       System.out.println("Enter the values of array: ");
       for(int i=0;i<n;i++)
       arr[i]=sc.nextInt();
       sorter(arr,n);
       System.out.println("Sorted array:");
       for(int i=0;i<n;i++)
       System.out.print(arr[i]+" ");
   }
}

Output: