Skip to content

O(N) implementation to solve deduplication and sorting problem

Notifications You must be signed in to change notification settings

windyon9/dedupsort

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 

Repository files navigation

dedupsort

O(N) implementation to solve deduplication and sorting problem

Problem Description:

Sorting and deduplication are the basis in data compression and optimization. Now there are N big numbers between 0 and 9999999999 generated by computer randomly, where n <= 500000. Your task is to get rid of repeated numbers, and sort them. (The judge system is a 32-bit system with memory limit of <=512M.)

About

O(N) implementation to solve deduplication and sorting problem

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages