10327-Flip Sort

<br /> /* <br /> "Flip Sort"<br /> Level:1.5<br /> Date:2006/10/7<br /> 技巧:求前面比自己大的數有幾個,加總後便是inversion所需的次數. <br /> */<br /> #include <stdio.h><br /> main(){<br /> int n=0,i=0,j=0,tmp=0,times=0;<br /> int input[1000]={0};<br /> while(scanf("%d",&n)==1){<br /> for(i=0;i < n;i++) scanf("%d",&input[i]); for(i=0;i < n;i++) for(j=0;j < i;j++) if(input[j] > input[i])<br /> times++; <br /> printf("Minimum exchange operations : %d\n",times); <br /> times=0;<br /> } <br /> }<br />