We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Minimum Swaps 2
  2. Discussions

Minimum Swaps 2

  • sergeyvnyan
     + 0 comments

    I though might be helpfull to someone..

    int minimumSwaps(int arr_count, int* arr) {

    int index = 0;
    int swaps = 0;
    int elem = 0;
    int tmp = 0;

    while (true)
    {
        elem = arr[index];
        if (elem != index +1) 
        {
            tmp = arr[index];
            arr[index] = arr[elem - 1];
            arr[elem - 1] = tmp;
            swaps++;
        }
        if (index + 1 == arr[index])
        {
            // move on to the next element
            index++;
        }
        if (arr_count == index + 1)
        {
            // we are done
            break;
        }
    }
    return swaps;
}