Implementing a custom sorting algorithm

We can try to implement a very simple sorting algorithm ourselves:
  • On each iteration select the smallest element from the array
  • Add that to the result
  • Remove that element from the initial array
Repeat this process as many times as the number of elements in the initial array, and we’ll obtain a perfectly sorted array.


The first line of the input contains a single integer n (1 ≀ n ≀ 1000) the number of elements in the array.
The next line contains n space-separated integers ( ≀ ≀ ).


The program should print the array in the input sorted in increasing order.


5 5 5 3 2 3
2 3 3 5 5


Time limit: 2 seconds

Memory limit: 512 MB

Output limit: 1 MB

To check your solution you need to sign in
Sign in to continue