1 solutions
-
0
C :
#include<stdio.h> #include<math.h> int main() { int a[10]; int i,j,t; for(i=0;i<10;i++) { scanf("%d",&a[i]); } for(i=0;i<10;i++) for(j=0;j<9-i;j++) { if(a[j]>a[j+1]) { t=a[j]; a[j]=a[j+1]; a[j+1]=t; } } for(i=0;i<10;i++) { printf("%d\n",a[i]); } return 0; }
C++ :
#include<iostream> using namespace std; int a[11]; int main() { for (int i=1; i<=10; i++) cin>>a[i]; for (int i=1; i<10; i++) //选择排序 { int k=i; for (int j=i+1; j<=10; j++) if (a[k]>a[j]) k=j; if (k!=i) { int t=a[k]; a[k]=a[i]; a[i]=t; } } for (int i=1; i<=10; i++) cout<<a[i]<<endl; return 0; }
- 1
Information
- ID
- 2199
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- (None)
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By