C :

#include<stdio.h>
int main()
{
	int a[10],i,j;
	for(i=0;i<10;i++){
		scanf("%d",&a[i]);
	}
 	for(i=1;i<10;i++){
		for(j=0;j<10-i;j++){
			if(a[j]<a[j+1]){
				int t;
				t=a[j];
				a[j]=a[j+1];
				a[j+1]=t;
				
			}
		} 
	} 
	for(i=0;i<10;i++){
		printf("%d ",a[i]);
	} 
	return 0;
 } 

C++ :

#include<iostream>
using namespace std;
const int MAXN=11;

int main() {
	int n;
	int a[MAXN];
	bool ok;
	n=10;
	for(int i=0;i<n;i++)
		cin>>a[i];
	

	for(int i=n-1;i>=1;i--){
		
		ok=true;
		 
	
		for(int j=0;j<i;j++){

			if(a[j]<a[j+1]){
			
				swap(a[j],a[j+1]);
				ok=false;
			}
		} 
		
	
		if(ok==true)
			break; 
	}
	
	for(int i=0;i<n;i++)
		cout<<a[i]<<" ";
	
}

Pascal :

var a:array[1..10] of longint;
    i,j,t:longint;
begin
for i:=1 to 10 do
read(a[i]);
for i:=1 to 10 do
for j:=i+1 to 10 do
if a[j]>a[i] then begin t:=a[i];a[i]:=a[j];a[j]:=t;end;
for i:=1 to 10 do
write(a[i],' ');
end.

Java :

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		@SuppressWarnings("resource")
		Scanner sc=new Scanner(System.in);
		int[] a=new int[10];
		for(int i=0;i<a.length;i++) {
			a[i]=sc.nextInt();		
			
		}
		for(int i=0;i<a.length-1;i++) {
			for(int j=0;j<a.length-1;j++) {
				int t=a[j];
				if(a[j]<a[j+1]) {
					a[j]=a[j+1];
					a[j+1]=t;
				}
			}
		}
		for(int i=0;i<a.length;i++) {			
			System.out.print(a[i]+" ");
		}		
	}		
}

Python :

m = list(map(int,input().split()))
m.sort(reverse=True)
for i in m:
    print(i,end=' ')