Minimum swap required to Sort an Array

[@avtarchandra2407]

rupesh sir gazab ka logic hai and your skill of teaching is awesome ,,,keep teaching

[@CppNuts]

Thanks dude..

[@samuelluswata]

Best explanation on this thus far

[@ManishSharma-ys5ws]

What will be the Time Complexity of this code especially that swapping part... I think it may go upto (n^2)

[@kshitijgupta592]

O(n)

[@JEMohammadAtif]

O(2n) in worst case@@kshitijgupta592

[@koeber99]

@@kshitijgupta592 Sorting is O(n*Log(n)), So this code is Time complexity is O(n)+n*Log(n) +O(n).

[@ChandraShekhar-by3cd]

Thanks a lot for such an informative video. Please keep uplaodng more video on leetcode.

[@CppNuts]

Sure I will

[@badassopenpolling]

What kind of solution this is. !!!!
To get minimum swap in sort : you sorted the array first and then found out the location and comparing.
This is a hack , not a solution.

[@CppNuts]

Actually your function should return the correct output no matter what you do inside that function :D

[@badassopenpolling]

@@CppNuts hahahaahhahahaah anyways I read your rest of the contents and they are good.

[@CppNuts]

Thanks..

[@aby_yadav]

Rupesh could have used std::map instead of vector, then he didn't need to swap.

[@bl7327]

can we do no of swaps = no. of misplaced pairs/2 ??

[@faiazmahmud6277]

yes u can

[@mark100net1]

@@faiazmahmud6277 try that with [4,3,1,2]

[@ankitahlawat4812]

Nice explanation

[@CppNuts]

I saw you after long time, it makes me feel that i am still relevant.. :D

[@ankitahlawat4812]

@@CppNuts I added your videos in watch later list due to ofc work🙁🙁....I ll watch all of them ...
No doubt ..your videos always nice and wonderful.

[@CppNuts]

@@ankitahlawat4812 Felt good.. thanks..

[@bingumallarahul3922]

@@CppNuts yes your videos are good, do videod for greedy, dynamic programming,divide and conquer also

[@memeswallah5253]

amazing

[@pradeexsu]

nice and simple, 👍 thank you

[@CppNuts]

Thanks..