Topic: Greedy Algorithm Problem / Level: beginner

Problem: Find the minimum number of swaps required to sort an array using adjacent swaps in a greedy manner.

Run the code to see the output here...