Hey guys, i'm working on a problem where I have to sort large array of long long int ( array size of nearly 1000000). I've tried to do it with merge sort as it has a complexity of O(n*log(n)) in worst case but still getting TLE. So , is there's a most efficient way (time speaking) to sort all this data ? thank you :) asked 09 Mar '14, 20:21

i dont know why but answered 09 Mar '14, 23:26

Advice: shortn your long integer to their decimals by dividing it to {100,1000 or 1000000}. put them in new array , apply function "Sort" on the new array, then arange your real 'the long' array according to the positions of the small array. Note: this way is way successful with diffrent long Numbers array, but i don't now for simlar big no. with least digits changes, for ex: 966662.. 966661.. 966663.. 9666631.. answered 11 Mar '14, 14:02
