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]<<" ";
	}
}

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=" ")