TSORT - Turbo Sort
Given the list of numbers, you are to sort them in non decreasing order.
Input
t – the number of numbers in list, then t lines follow [t <= 10^6].
Each line contains one integer: N [0 <= N <= 10^6]
Output
Output given numbers in non decreasing order.
Example
Input:
5 5 3 6 7 1
Output:
1 3 5 6 7
hide comments
Arif Awate:
2015-08-05 08:41:25
quicksort with C++.. 0.34
|
|
candide:
2015-05-16 15:05:28
Native C qsort : 0.44s
|
|
Lehar:
2015-03-29 10:50:50
Count sort works :) |
|
thelazycoder:
2015-02-16 18:17:53
Merge sort using vector :) |
|
Abhinandan Agarwal:
2015-01-24 09:15:20
Quick sort and count sort both got accepted ..
|
|
Amir Katkoot:
2014-10-07 15:37:11
Don't use cin/cout it cost me 2 TLEs... |
|
SHIVAM DIXIT:
2014-10-03 11:24:59
counting sort gets accepted :P Last edit: 2014-10-03 11:25:13 |
|
Devashish:
2014-06-28 15:48:37
Abhinav Gupta ..you don't remove the duplicate numbers |
|
Abhinav Gupta:
2014-06-27 19:18:03
How to remove duplicate numbers? |
|
Ankit Aggarwal :
2014-06-26 19:57:41
use qsort() function in c
|
Added by: | Roman Sol |
Date: | 2005-03-14 |
Time limit: | 2.700s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ERL JS-RHINO NODEJS PERL6 VB.NET |
Resource: | ZCon |