Go: package main

import (
	"fmt"
	"sort"
)

func main() {
	var a, b, c, d, e int
	fmt.Scan(&a, &b, &c, &d, &e)
	dataset := []int{a, b, c, d, e}

	sort.Sort(sort.Reverse(sort.IntSlice(dataset)))
	fmt.Printf("%d %d %d %d %d\n", dataset[0], dataset[1], dataset[2], dataset[3], dataset[4])
}

C++: #include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
using namespace std;

int main()
{
	vector<int> n;
	int x;
	for (int i = 0; i < 5; ++i){
		cin >> x;
		n.push_back(x);
	}

	sort(n.begin(), n.end(),greater<int>());

	for (int i = 0; i < 5; ++i){
		cout << n[i];
		if (i != 4)
			cout << " ";
		else
			cout << endl;
	}

	return 0;
}

C++: #include<iostream>
int main()
{
	int n[5];
	for (int i = 0; i < 5; i++)
	{
		std::cin >> n[i];
	}
	for (int i = 0; i < 5; i++)
	{
		int max = -100001, max_index = 0;
		for (int j = i; j < 5; j++)
		{
			if (max < n[j])
			{
				max = n[j];
				max_index = j;
			}
		}
		std::swap(n[i], n[max_index]);
	}
	for (int i = 0; i < 5; i++)
	{
		std::cout << n[i] << ' ';
	}
	std::cout << std::endl;
	return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
  int a[5];
  for(int i = 0;i < 5;i++) cin >> a[i];
  sort(a,a+5);
  for(int i = 4;i >= 0;i--){
    cout << a[i];
    if(i == 0) cout << endl;
    else cout << " ";
  }
  return 0;
}

C++: #include <stdio.h>

int main()
{
	int a[5], t;

	scanf("%d %d %d %d %d", &a[0], &a[1], &a[2], &a[3], &a[4]);

	for (int i = 0; i < 5; ++i){
		for (int i = 0; i < 4; i++){
			if(a[i] < a[i+1]){
				t = a[i];
				a[i] = a[i+1];
				a[i+1] = t;
			}
		}
	}

	printf("%d %d %d %d %d\n", a[0], a[1], a[2], a[3], a[4]);

	return 0;
}

C++: #include<iostream>
using namespace std;

int main(){
int a,b,c,d,e;
int A,B,C,D,E;
cin>>a>>b>>c>>d>>E;
if(a>b){
A=a;
B=b;}
else{
A=b;
B=a;}
if(c<B){
C=c;}
else{
C=B;
if(c<A){
B=c;}
else{
B=A;
A=c;}}
if(d<C){
D=d;}
else{
D=C;
if(d<B){
C=d;}
else{
C=B;
if(d<A){
B=d;}
else{
B=A;
A=d;}}}
if(e<D){
E=e;
else{
E=D;
if(e<C){
D=e;}
else{
D=C;
if(e<B){
C=e;}
else{
C=B;
if(e<A){
B=e;}
else{
B=A;
A=e;}}}}
cout<<A<<" "<<B<<" "<<C<<" "<<D<<" "<<E;
}

C++: #include<iostream>
using namespace std;
int main() {
	int a[11];
	for (int i = 1; i <= 5; i++) {
		cin >> a[i];
	}
	int dai = -999999;
	int o;
	for (int i = 1; i <= 5; i++) {
		int dai = -999999;
		for (int z = 1; z <= 5; z++) {
			if (dai <= a[z]) {
				dai = a[z];
				o = z;
			}
		}
		a[o] = -9999999;
		cout << dai<<" ";
	}
}

C++: #include<iostream>
using namespace std;

int main(){
int a,b,c,d,e;
int A,B,C,D,E;
cin>>a>>b>>c>>d>>e;
if(a>b){
A=a;
B=b;}
else{
A=b;
B=a;}
if(c<B){
C=c;}
else{
C=B;
if(c<A){
B=c;}
else{
B=A;
A=c;}}
if(d<C){
D=d;}
else{
D=C;
if(d<B){
C=d;}
else{
C=B;
if(d<A){
B=d;}
else{
B=A;
A=d;}}}
if(e<D){
	E=e;}
else{
E=D;
if(e<C){
D=e;}
else{
D=C;
if(e<B){
C=e;}
else{
C=B;
if(e<A){
B=e;}
else{
B=A;
A=e;}}}}
cout<<A<<" "<<B<<" "<<C<<" "<<D<<" "<<E;
}

C++: 
#include <iostream>
using namespace std;

int main() {
	int a[5+1];

	for (int i = 1; i <= 5; i++) 
		cin >> a[i];

	for (int j = 2; j <= 5; j++) {
		int key = a[j];
		int i = j-1;
		while (i >= 1 && a[i] < key) {
			a[i+1] = a[i];
			i--;
		}
		a[i+1] = key;
	}

	for (int i = 1; i < 5; i++) {
		cout << a[i] << " ";
	}
	cout << a[5] << endl;

	return 0;
}

C++: #include <iostream>
#include <algorithm>

using namespace std;

int cell[5];

int main() {
    cin >> cell[0] >> cell[1] >> cell[2] >> cell[3] >> cell[4];

    sort(cell, cell + 5);

    cout << cell[4] << " " << cell[3] << " " << cell[2] << " " << cell[1] << " " << cell[0] << endl;

    return 0;
}

C++: #include <algorithm>
#include <iostream>

int main(void) {
  int ary[5], i;

  for (i = 0; i < 5; i++) {
    std::cin >> ary[i];
  }

  std::sort(ary, ary + 5, std::greater<int>());

  for (i = 0; i < 5; i++) {
    std::cout << ary[i] << ' ';
  }

  return 0;
}

C++: #include <iostream>
#include <algorithm>
 
using namespace std;
 
int main(void) {
  int n[5];

  cin >> n[0] >> n[1] >> n[2] >> n[3] >> n[4];

  sort(n,n+5,greater<int>());

  cout<<n[0]<<" "<<n[1]<<" "<<n[2]<<" "<<n[3]<<" "<<n[4]<<" "<<endl;
  return 0;
}

C++: #include <iostream>
#include <algorithm>

using namespace std;

int main(int argc, char *argv[]) {
  int nums[5];

  for (int i = 0; i < 5; i++)
    cin >> nums[i];

  sort(nums, nums + 5);

  for (int i = 0; i < 5; i++)
    cout << nums[4 - i] << ' ';
  cout << '\b' << endl;
  return 0;
}

C++: #include <iostream>
#include <list>
#include <functional>
using namespace std;

int main() {
    int a, b, c, d, e;
    cin >> a >> b >> c >> d >> e;
    list<int> lis = {a, b, c, d, e};
    lis.sort(greater<int>());
    list<int>::iterator it = lis.begin();
    while(it != lis.end()) {
        cout << *it << " " << flush;
        it++;
    }
    cout << endl;
    return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <vector>
#include <cstdio>

using namespace std;

int main() {
	vector<int> num(5);
	cin >> num[0] >> num[1] >> num[2] >> num[3] >> num[4];
	sort(num.begin(), num.end());
	printf("%d %d %d %d %d\n", num[0],num[1],num[2],num[3],num[4]);
	return 0;
}

C++: #include<iostream>
#include<algorithm>
using namespace std;
int main()
{
    int a,b,c,d,e,i,k,arr[6];
    cin>>a>>b>>c>>d>>e;
    arr[0]=a;
    arr[1]=b;
    arr[2]=c;
    arr[3]=d;
    arr[4]=e;
    sort(arr,arr+5);
    for(i=4;i>=0;i--)
    {
        if(i==0)
            cout<<arr[i];
        else
        cout<<arr[i]<<" ";
    }
    return 0;
}

C++: #include <algorithm>
#include <cstdio>
#include <cstdlib>

using namespace std;

int arr[5];

int main()
{
	for(int a=0;a<5;a++)
	{
		scanf("%d",&arr[a]);
	}
	sort(arr,arr+5);
	for(int a=4;a>=0;a--)
	{
		printf("%d ",arr[a]);
	}
	return 0;
}

C++: #include <iostream>
#include <string>
#include <algorithm>
#include <utility>
#include <iomanip>
#include <functional>
#include <queue>
#include <cmath>
#define INF 100000000
#define MOD 1000000007
using namespace std;


int main(){
    int a[5];
    for(int i=0; i<5; i++){
        cin >> a[i];
    }
    
    sort(a,a+5);
    
    for(int i=4; i>=0; i--){
        cout<<a[i];
        if(i==0){
            cout<<endl;
        }else{
            cout<<" ";
        }
    }
    return 0;
}

C++: #include <iostream>
#include <string>
#include <math.h>
#include <stdio.h>
#include <algorithm>

using namespace std;

int main() {
    int a[5];
    
    for(int i=0; i<5; i++){
        cin>>a[i];
    }
    sort(a,a+5);

    cout<<a[4]<<" "<<a[3]<<" "<<a[2]<<" "<<a[1]<<" "<<a[0]<<endl;;
    
    return 0;
}

C++: #include<iostream>
#include<vector>
std::vector<int> qsort(std::vector<int> xs);


int main(){
	std::vector<int> vec(5);
	for(int i=0;i<5;i++){
		std::cin>>vec[i];
	}
	vec=qsort(vec);
	for(int i=0;i<5;i++){
		std::cout<<vec[i];
		std::cout<<" ";
	}
	std::system("pause");
	return 0;
}

std::vector<int> qsort(std::vector<int> xs){

	if(xs.empty())return xs;
	else{
			int x=xs[0];
		std::vector<int> left;
		std::vector<int> right;
		for(int i=1;i<xs.size();i++){
			if(x>xs[i])left.push_back(xs[i]);
			else if(x<=xs[i])right.push_back(xs[i]);
		}
		left=qsort(left);
		right=qsort(right);
		left.push_back(x);
		left.insert(left.end(),right.begin(),right.end());
		return left;
	}
}

C++: #include <stdio.h>
#include <iostream>
#include <algorithm>
#include <math.h>
 
using namespace std;
 
int main(){
 
    int array[5];
    scanf("%d %d %d %d %d",&array[0],&array[1],&array[2],&array[3],&array[4]);
 
    for(int i=1;i<=4;i++){
        for(int k=4;k>=i;k--){
            if(array[k]>array[k-1])swap(array[k],array[k-1]);
        }
    }
 
    for(int i=0;i<4;i++)printf("%d ",array[i]);
    printf("%d\n",array[4]);
 
    return 0;
}