1005 - Comb Sort

Time Limit: 2s Memory Limit: 256MB

Submissions: 957 Solved: 74
Description

 

  • Given a sequence of n 32-bit real values =<a1, a2, ..., an>
  • Problem: sort the sequence in increasing order by comb sort.

 

Input

The first line contains a positive integers N (1 N 106).

The second line contains N real values with exactly 2 digits aflter the decimal point even with integer values.

 

Output

The unique line contains N real sorted values with exactly 2 digits aflter the decimal point  even with integer values.

Sample Input
6
2.22 5.25 6.26 1.21 4.24 3.00
Sample Output
1.21 2.22 3.00 4.24 5.25 6.26
Hint
Source