选择排序很简单

来源:互联网 发布:html与javascript分离 编辑:程序博客网 时间:2024/04/29 08:36


#include <iostream>using namespace std;int main(){printf("输入");int thenum[11];int i;for(i = 1; i < 11; i++){cout << "输入第" << i << "个数" ;     cin>>thenum[i];}int j;int jj;for(i = 1; i < 11; i++){j = i;for(int ii = i+1; ii < 11; ii++){if(thenum[ii] < thenum[j])   j = ii;}jj = j;j = thenum[jj];thenum[jj] = thenum[i];thenum[i] = j;}cout << "输出" << endl; for(i = 1; i < 11; i++)     cout << thenum[i]<< "   ";    return 1;} 


0 0
原创粉丝点击