Swaps to sort

Calculating the number of swaps to sort an array

Problem

Given an array of N distinct elementsA[ ]. The task is to find the minimum number of swaps required to sort the array. Your are required to complete the function which returns an integer denoting the minimum number of swaps, required to sort the array.

Solution

Matching initial and final positions of the elements, form a graph with cycles. No of swaps in each cycle are one less than the no. of edges.

Editorial - gfg

Code - swapsort.cpp