Submit | All submissions | Best solutions | Back to list |
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
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 |
hide comments
|
||||||||||
2015-08-05 08:41:25 Arif Awate
quicksort with C++.. 0.34 |
||||||||||
2015-05-16 15:05:28 candide
Native C qsort : 0.44s inlined glibc qsort : 0.32s Native C++ STL sort with vector and push_back : 0.32s Native C++ STL sort with array : 0.29s Native Python 2.7 or PyPy sort method : TLE Last edit: 2016-03-05 00:08:34 |
||||||||||
2015-03-29 10:50:50 Lehar
Count sort works :) |
||||||||||
2015-02-16 18:17:53 thelazycoder
Merge sort using vector :) |
||||||||||
2015-01-24 09:15:20 Abhinandan Agarwal
Quick sort and count sort both got accepted .. Quick sort gave 0.43s while count sort gave .28s ... How to Further reduce the time ? |
||||||||||
2014-10-07 15:37:11 Amir Katkoot
Don't use cin/cout it cost me 2 TLEs... |
||||||||||
2014-10-03 11:24:59 SHIVAM DIXIT
counting sort gets accepted :P Last edit: 2014-10-03 11:25:13 |
||||||||||
2014-06-28 15:48:37 Devashish
Abhinav Gupta ..you don't remove the duplicate numbers |
||||||||||
2014-06-27 19:18:03 Abhinav Gupta
How to remove duplicate numbers? |
||||||||||
2014-06-26 19:57:41 Ankit Aggarwal
use qsort() function in c Ac-3.34s |