We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
if the numbers are not consecutive this code right below will work
static int minimumSwaps(int[] a) {
int swap=0,ctr=0,small=Integer.MAX_VALUE;
while(ctr!=(a.length-1)){
for(int i=ctr;ia[i]){
small=a[i];
}
}
for(int i=ctr+1;i
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Minimum Swaps 2
You are viewing a single comment's thread. Return to all comments →
if the numbers are not consecutive this code right below will work static int minimumSwaps(int[] a) { int swap=0,ctr=0,small=Integer.MAX_VALUE; while(ctr!=(a.length-1)){ for(int i=ctr;ia[i]){ small=a[i]; } } for(int i=ctr+1;i