猫史档案馆

选择排序+冒泡：

#include <iostream>
#define N 100
int Long(int arr[]){
	return sizeof(arr)/sizeof(arr[0]);
}
int main(int argc,char *argv[]){
	int op[N]={78,112,45,90,123,89,56,11,22,1238};
	int n=9;
	int o;
	for(int i=1;i<n;++i){
		for(int j=1;j<=n-i;++j){
			if(op[j]>op[j+1]){
				o=op[j];
				op[j]=op[j+1];
				op[j+1]=o;
			}
		}
	}
	for(int i=0;i<=9;++i){
		std::cout<<op[i]<<std::endl;
	}
} 
___________________________________________________________________________
#include <iostream>
int main(void){
	int op[]={10,33,678,91,11,603,123,90};
	for(int i=1;i<=5;++i){
		int max=i;
		for(int j=i+1;j<=5;++j){
			if(op[j]<op[max]){
				max=j;
			}
		}
		std::swap(op[i],op[max]);
	}for(int i=0;i<=5;++i){
		std::cout<<op[i]<<std::endl;
	}	
}