Minimum Number of Swaps Required to Sort the Array

In this video we will discuss about the problem minimum number of swaps to make an array sorted using a simple and intuitive algorithm.

#sorting#dsa#coding#dsa#swaps#arrays

[depressinglyfunny]

int minSwaps(vector<int>&nums)
{
vector<int>test=nums;
sort(test.begin(), test.end());
int count=0;
for(int i=0;i<nums.size();i++){
if(nums[i]!=test[i]){
count+=1;
}
}
return ceil(count/2);
}

why won't this work?