答:C++中冒泡排序:

 void swap( int& a, int& b ){ 
 int c=a; a = b; b = c; 
 } 
 void bubble( int* p, int len ){ 
 bool bSwapped; 
 do { 
 bSwapped = false; 
 for( int i=1; i<len; i++ ){ 
 if( p[i-1]>p[i] ){ 
 swap( p[i-1], p[i] ); 
 bSwapped = true; 
 } 
 } 
 }while( bSwapped ); 
 }