ziyoudefeng的专栏

第一种：最基本的解法 void bubble_sort1( int a[], int size ) { bool swapped = true; int n = size; while ( swapped ) { swapped = false; for ( int i = 0; i < n - 1; i++ ) { if ( a[i] > a[i+1] )

// CalcPalindrome.cpp /******************************************************************** created: 2011/11/02 file base: CalcPalindrome file ext: cpp author: 小C purpose: 通过4位数反转求得8位对称数,