Java -

Make an algorithm that sorts an array of n elements by finding 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 untile the entire array is sorted. Write codde to implement the above algorithm. Show that the novel sorting algorithm works correctly.