Minimum Swaps 2

  • + 40 comments

    a simple sol

    static int minimumSwaps(int[] a) {
            int swap=0;
            for(int i=0;i<a.length;i++){
                if(i+1!=a[i]){
                    int t=i;
                    while(a[t]!=i+1){
                        t++;  
                    }
                    int temp=a[t];
                    a[t]=a[i];
                    a[i]=temp;
                    swap++;
                }
            }
            return swap;
    
        }