Shakespeare Sort (April Fools Series)
Quick Sort and Merge Sort are well known sorting algorithms using a divide-and-conquer paradigm.
As an ICT expert, Rock created a Shakespeare Sort that can sort numbers using a crazy-and-stupid paradigm.
Input
The first line contains an integer $N$. $N$ is the number of integers in the array $(1 \le N \le 100)$.
The next line contains an array of $N$ integers $D$ separated by spaces. $(0 \le D \le 9)$ . The integers may or may not be the same.
Output
Output the sorted array separated by spaces.
Sample Test Cases
Input | Output | |
---|---|---|
5 1 3 5 7 9 |
5 9 1 7 3 | |
Second clue: fifth number of the input array |
||
5 0 2 4 6 8 |
8 4 6 2 0 |
Scoring: Per Subtask
Authored by hclee
Appeared in 中國香港九龍華仁書院電腦科主任李海峻老師精心調製之全校青少年信息學奧林匹克六月愚人節編程競賽