Go: package main

import (
	"bufio"
	"os"
	"strconv"
	"sort"
	"fmt"
)

var scanner = bufio.NewScanner(os.Stdin)

func nextInt() int {
	scanner.Scan()
	i, e := strconv.Atoi(scanner.Text())
	if e != nil {
		panic(e)
	}
	return i
}
func main() {
	scanner.Split(bufio.ScanWords)
	nums := make([]int, 5)
	for i := 0; i < 5; i++ {
		nums[i] = nextInt()
	}
	sort.Sort(sort.Reverse(sort.IntSlice(nums)))
	for i, v := range nums {
		if i == len(nums)-1 {
			fmt.Printf("%d\n", v)
		} else {
			fmt.Printf("%d ", v)
		}
	}
}

C++: #include <bits/stdc++.h>
using namespace std;

int main() {
	int a[5];
	while(cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4]){
		sort(a, a + 5, greater<int>());
		for(int i = 0; i < 5; ++i){
			if(i)
				cout << " ";
			cout << a[i];
		}
		cout << endl;
	}
	return 0;
}

C++: #include <iostream>
#include <stdio.h>
#include <algorithm>
using namespace std;

int main()
{
	int a[5];

	for(int i=0; i<5; i++)
	{
		scanf("%d",& a[i]);
	}

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

	for(int i=0; i<5; i++)
	{
		printf("%d ",a[i]);
	}

	return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <cstdio>
#include <deque>
#include <functional>

using namespace std;

int main(void)
{
	int a,b,c,d,e;
	while(cin>>a>>b>>c>>d>>e)
	{
		deque<int> nums;
		nums.push_back(a);
		nums.push_back(b);
		nums.push_back(c);
		nums.push_back(d);
		nums.push_back(e);
		sort( nums.begin(), nums.end(), greater<int>() );
		deque<int>::iterator it = nums.begin();
		while( it != nums.end() )
		{
			cout <<*it<<' ';
			++it;
		}
		puts("");
	}
	return 0;
}

C++: #include<stdio.h>
#define n 5

int main(void)
{
	int a[n],i,j,t;

	for(i=0;i<n;i++)
	  scanf("%d",&a[i]);

	for( i = 1; i < n; ++i )
	{
		t = a[i];
		for( j = i; j > 0 && a[j-1] > t; --j )
		{
			a[j] = a[j-1];
		}
		a[j] = t;
	}
	for(i=n-1;i>-1;i--)
		printf("%d ",a[i]);
	printf("\n");
  return 0;
}

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

int main(){
	int a[5],tmp;
	for(int i=0; i<5 ; i++){
		cin >> a[i];
	}
	for(int j=0;j<4;j++){
		for(int k=j+1;k<5;k++){
			if(a[j]<a[k]){
				tmp = a[j];
				a[j] = a[k];
				a[k] = tmp;
			}
		}
	}

	for(int l =0; l<4 ; l++) {
		cout << a[l] << " ";
	}
	cout << a[4] << "\n";
}

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

using namespace std;

int main() {
  int n;
  int count = 0;
  priority_queue<int> que;
  while (cin >> n) {
    que.push(n);
    count++;
  }
  cout << que.top(); que.pop();
  for (int i = 0; i < count-1; i++) {
    cout << " " << que.top(); que.pop();
  }
  cout << endl;

  return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
  int a[5]={};
  for(int i=0;i<5;i++)
    cin>>a[i];
  for(int j=0;j<5;j++)
    for(int i=1;i<=5;i++)
      if(a[i-1]<a[i]) swap(a[i-1],a[i]);

  for(int i=0;i<5;i++)
    cout<<a[i]<<' ';
  cout<<endl;
  return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

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

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

int main(){
	int ch[5];
	for( int i = 0; i < 5; i++ ){
		cin >> ch[i];
	}
	sort(ch, ch+5, greater<int>());
	for( int i = 0; i < 4; i++ ){
		cout << ch[i] << " ";
	}
	cout << ch[4] << endl;
}

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

int main(){
	priority_queue<int> que;
	for(int i = 0;i < 5;i++){
		int a;
		cin >> a;
		que.push(a);
	}
	while(!que.empty()){
		cout << que.top() << " ";
		que.pop();
	}
	cout << endl;
	return 0;
}

C++: #include<stdio.h>
#define n 5

int main(void)
{
	int a[n],i,j,t;

	for(i=0;i<n;i++)
	  scanf("%d",&a[i]);

	for( i = 1; i < n; ++i )
	{
		t = a[i];
		for( j = i; j > 0 && a[j-1] > t; --j )
		{
			a[j] = a[j-1];
		}
		a[j] = t;
	}
	printf("%d",a[n-1]);
	for(i=n-2;i>-1;i--)
		printf(" %d",a[i]);
	printf("\n");
  return 0;
}

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

#define FOR(var, start, end)    for(var = start; var < end; ++var)
#define WHILE(var, end)  while(var != end)
#define SHOW_ALL(a, b, c)    cout << a << endl; \
                                cout << b << endl; \
                                cout << c << endl;

using namespace std;


void BubbleSort(vector <int> &num)
{
      int i, j, flag = 1;    // set flag to 1 to start first pass
      int temp;             // holding variable
      int numLength = num.size( ); 
      for(i = 1; (i <= numLength) && flag; i++)
     {
          flag = 0;
          for (j=0; j < (numLength -1); j++)
         {
               if (num[j+1] > num[j])      // ascending order simply changes to <
              { 
                    temp = num[j];             // swap elements
                    num[j] = num[j+1];
                    num[j+1] = temp;
                    flag = 1;               // indicates that a swap occurred.
               }
          }
     }
     return;   //arrays are passed to functions by address; nothing is returned
}

int main()
{
    int input;
    vector<int> input_array;
    while(cin >> input){
        input_array.push_back(input);
    }
    BubbleSort(input_array);
    for(auto num:input_array){
        cout << num << " ";
    }
    
}

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

using namespace std;

int main(){
	
	int ary[5];

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

	for (int i = 0; i < 5; i++){
		for (int j = i + 1; j < 5; j++){
			if (ary[i] < ary[j]){
				swap(ary[i], ary[j]);
			}
		}
	}

	for (int i = 0; i < 5; i++){
		cout << ary[i] << endl;
	}

	return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;

int main() {
    int T;
    string input;

    while(getline(cin, input)) {
        stringstream temp(input);

        int number;
        vector<int> vec;
        while(temp>>number) vec.push_back(number);

        sort( vec.rbegin(), vec.rend() );

        int size=vec.size();
        for(int i=0; i<size-1; i++) cout<<vec[i] <<" ";

        cout << vec[size-1] <<"\n";
    }
}

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);reverse(a,a+5);
    for(int i=0;i<5;i++)cout<<(i?" ":"")<<a[i];
    cout<<endl;
}

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

int main(){
  int a,b,c,d,e;
  std::scanf("%d %d %d %d %d",&a,&b,&c,&d,&e);
  //std::cout << a << b << c << d << e << std::endl;
  int flag = 0,temp;
  do{
    flag = 0;
    if(a<b){
      temp = a;
      a = b;
      b = temp;
      flag = 1;
    }
    if(b<c){
      temp = b;
      b = c;
      c = temp;
      flag = 1;
    }
    if(c<d){
      temp = c;
      c = d;
      d = temp;
      flag = 1;
    }
    if(d<e){
      temp = d;
      d = e;
      e = temp;
      flag = 1;
    }
  }while(flag);
  std::printf("%d %d %d %d %d\n",a,b,c,d,e);
}

C++: 
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <stack>
#include <cctype>
#include <complex>
#include <vector>
#include <functional>
#include <algorithm>

using namespace std;


bool solve(){
	vector<int> a(5);
	for(int i=0;i<5;i++){
		cin>>a[i];
	}
	sort(a.begin(),a.end(),greater<int>());
	for(int i=0;i<5;i++){
		cout<<a[i];
		if(i!=4) cout<<" ";
	}
	cout<<endl;
	return true;
}

int main(){
	cout.setf(ios::fixed);
	cout.precision(10);
	solve();

	return 0;
}