武道大会终于落幕,赛场上还能站起来的只剩下了10个人编号分别是ABCDEFGHIJ 他们分别赢了12,3,5,1,16,27,18,8,9,4 场,请输出他们的排序后的成绩和编号。
Input
无
Output
27 F
18 G
16 E
12 A
9 I
8 H
5 C
4 J
3 B
1 D
Sample Output
27 F
18 G
16 E
12 A
9 I
8 H
5 C
4 J
3 B
1 D
HINT
主函数已给出
/*C语言*/
#include <stdio.h>
#define N 10
void SelectSort(int *arr);
int main()
{
int i;
int _array[N] = {12,3,5,1,16,27,18,8,9,4};
SelectSort(_array);
//printf("选择排序后的数组如下:\n");
for(i = 0;i < N;i++)
{
printf("%2d ",_array[i]);
switch(_array[i])
{
case 1:printf("D\n");break;
case 3:printf("B\n");break;
case 4:printf("J\n");break;
case 5:printf("C\n");break;
case 8:printf("H\n");break;
case 9:printf("I\n");break;
case 12:printf("A\n");break;
case 16:printf("E\n");break;
case 18:printf("G\n");break;
case 27:printf("F\n");break;
}
}
printf("\n");
return 0;
}
/*c++*/
#include <iostream>
using namespace std;
#define N 10
void SelectSort(int *arr);
int main()
{
int i;
int _array[N] = {12,3,5,1,16,27,18,8,9,4};
SelectSort(_array);
//printf("选择排序后的数组如下:\n");
for(i = 0;i < N;i++)
{
cout<<_array[i]<<" ";
switch(_array[i])
{
case 1:cout<<"D\n";break;
case 3:cout<<"B\n";break;
case 4:cout<<"J\n";break;
case 5:cout<<"C\n";break;
case 8:cout<<"H\n";break;
case 9:cout<<"I\n";break;
case 12:cout<<"A\n";break;
case 16:cout<<"E\n";break;
case 18:cout<<"G\n";break;
case 27:cout<<"F\n";break;
}
}
cout<<"\n";
return 0;
}
Source
石昊甲
代码:
#include <iostream>
using namespace std;
#define N 10
void SelectSort(int *arr);
int main()
{
int i;
int _array[N] = {12,3,5,1,16,27,18,8,9,4};
SelectSort(_array);
for(i = 0;i < N;i++)
{
cout<<_array[i]<<" ";
switch(_array[i])
{
case 1:cout<<"D\n";break;
case 3:cout<<"B\n";break;
case 4:cout<<"J\n";break;
case 5:cout<<"C\n";break;
case 8:cout<<"H\n";break;
case 9:cout<<"I\n";break;
case 12:cout<<"A\n";break;
case 16:cout<<"E\n";break;
case 18:cout<<"G\n";break;
case 27:cout<<"F\n";break;
}
}
cout<<"\n";
return 0;
}
void SelectSort(int *arr)
{
int i,t,x;
for(i=0;i<N-1;i++)
{
for(t=0;t<N-i-1;t++)
{
if(arr[t]<arr[t+1])
{
x=arr[t];
arr[t]=arr[t+1];
arr[t+1]=x;
}
}
}
return ;
}