UVA Problem 10327 (Flip Sort) Solution

Problem Solving, UVa

#include <bits/stdc++.h>

using namespace std;



int main()

{

  int n, array[5000],k, c,count,d,T, t;



  while(scanf("%d",&n)==1)

{

count=0;



    for (c = 0; c < n; c++)

       {

        cin>>array[c];

       }



      for (c = 1 ; c <= n - 1; c++) {

    d = c;

    

    while ( d > 0 && array[d] < array[d-1]) {

       

      t          = array[d];

      array[d]   = array[d-1];

      array[d-1] = t;



      d--;

      count++;

    }

  }





    printf("Minimum exchange operations : %d\n",count);

 

}

  return 0;   

  }

 

0 Comments

You may find interest following article