[UVa]10327:Flip Sort

即是計算Bubble Sort的交換次數。

[C](0.088)

	#include<stdio.h>
	int main()
	{
	int N;
	while( scanf( "%d", &N ) != EOF )
	{
	int array[1005] = {0};
	int i, j;
	for( i = 0 ; i < N ; i++ )
	scanf( "%d", &array[i] );
	int swap = 0;
	for( i = 0 ; i < N ; i++ )
	for( j = N-1 ; j > i ; j-- )
	if( array[j] < array[j-1] )
	{
	array[j] ^= array[j-1] ^= array[j] ^= array[j-1];
	swap++;
	}
	printf( "Minimum exchange operations : %d\n", swap );
	}
	return 0;
	}

view raw UVa10327.c hosted with ❤ by GitHub