Question: In Java please Consider an array of n distinct integers, A = [aa, a,-..,a- You can swap any two elements of the array any number

In Java please
Consider an array of n distinct integers, A = [aa, a,-..,a- You can swap any two elements of the array any number of times. An array is beautiful if the sum of la-al among 0 n is minimal possible (after, possibly, performing some swaps). Given the array A, find and print the minimum number of swaps that should be performed in order to make the array beautiful. Input Format The first line contains a single integer, n, denoting the number of elements in the array A The second line contains n space-separated integers describing the respective distinct values of ao, a,.an- Constraints n105 Output Format Print the minimum number of swaps that should be performed in order to make the array beautiful Sample Input 2 5 3 1 Sample Output Explanation Let's define array B 1,2,3,5] to be the beautiful reordering of array A, as the sum of the absolute values of differences between its adjacent elements is minimal among all permutations and only two swaps (1 with 2 and then 2 with 5) was performed
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
