1 条题解
-
0
C :
#include<stdio.h> int main(){ int i,j,n,a[101],k,temp; scanf("%d",&n) ; for(i = 0;i < n;i++){ scanf("%d",&a[i]); } for(i = 0;i < n-1;i++) { k = i; for(j = i + 1;j < n;j++){ if(a[j] < a[k]){ k = j; } } if(k != i){ temp = a[i]; a[i] = a[k]; a[k] = temp; } } for(i = 0;i < n;i++){ printf("%d ",a[i]); } return 0; }C++ :
#include <iostream> using namespace std; int main(){ //选择排序 int n,i,j,min,t; cin>>n; int a[n]; for(i = 0;i < n;i++){ cin>>a[i]; } for(i = 0;i < n - 1;i++){ min = i; for(j = i;j < n;j++){ if(a[j] < a[min]){ min = j; } } if(min != i){ t = a[min]; a[min] = a[i]; a[i] = t; } } for(i = 0;i < n;i++){ cout<<a[i]<<" "; } }Pascal :
var a:array[1..100] of integer; i,j,t,n:integer; begin readln(n); for i := 1 to n do read(a[i]); readln; for i:= 1 to n - 1 do begin for j := 1 to n - i do begin if a[j] > a[j + 1] then begin t := a[j]; a[j] := a[j + 1]; a[j + 1] := t; end; end; end; for i:= 1 to n do begin if i <> n then write(a[i],' ') else writeln(a[i]); end; readln; end.Java :
import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner scanner=new Scanner(System.in); String s=scanner.nextLine(); int n=Integer.valueOf(s); String str=scanner.nextLine(); String[] array=str.split(" "); for(int i=0;i<array.length-1;i++){ for(int j=0;j<array.length-1;j++){ if(Integer.valueOf(array[j+1])<=Integer.valueOf(array[j])){ int temp=Integer.valueOf(array[j]); array[j]=array[j+1]; array[j+1]=String.valueOf(temp); } } } for(int i=0;i<array.length;i++){ String temp=array[i]; if(i==array.length-1){ }else{ temp=array[i]+" "; } System.out.print(temp); } } }Python :
#!/usr/bin/env python3 n = int(input()) list1 = [] list1 = input().split() list2 = [] for i in range(0,n,1): m = int(list1[i]) list2.append(m) else: list2.sort(reverse=False) for i in list2: print(i,end=" ")
- 1
信息
- ID
- 10
- 时间
- 1000ms
- 内存
- 64MiB
- 难度
- 10
- 标签
- 递交数
- 2
- 已通过
- 2
- 上传者