#include<bits/stdc++.h>

using namespace std;

void counting_sort(int arr[],int cnt)
{
    int n=cnt;
    int x = arr[1];
    for(int i=2; i<=n; i++)
    {
        if(arr[i]>x)
            x=arr[i];

    }
    int freq[x+1]= {0,};
    for(int i=1; i<=n; i++)
    {
        freq[arr[i]]++;
    }
    for(int i=1; i<=x; i++)
    {
        while(freq[i]--)
            cout<<i<<" ";
    }
    cout<<endl;

}
void bubble_sort(int arr[], int n)
{

    int i, j;
    for (i = 0; i < n-1; i++)
        for (j = 0; j < n-i-1; j++)
            if (arr[j] > arr[j+1])
                swap(arr[j], arr[j+1]);
      for(int i=0;i<n;i++)
      {
            cout<<arr[i]<<" ";
      }
      cout<<endl;
}

int main()
{
    string x;
    ifstream fin;
    int arr[100005],i=0,cnt=0;
    fin.open("input.txt");
    while(!fin.eof())
    {
        fin>>x;
        int n=stoi(x);
        arr[i++]=n;
        cnt++;

    }
    clock_t start = clock();

    counting_sort(arr,1000);

    printf("\nUsing Counting Sort = %0.5fms\n", (float)(clock() - start) / CLOCKS_PER_SEC);
      cout<<endl<<endl;
    clock_t start2 = clock();

    bubble_sort(arr,1000-1);
    printf("\n Using Bubble Sort = %0.5fms\n", (float)(clock() - start2) / CLOCKS_PER_SEC);
}