There are many sorting algorithms, some of which take N^2 sorts (10^16 in this case) and some which take only 10 * ln(N) (or about 2*10^9) sorts. (The idea being that there are smarter ways to put a new number into an already-sorted list than comparing it with every item in the list. Such as a binary method, looking at the midpoint of the list, then the midpoint of the half that that the first comparison determined, etc.) See the ref.
2007-08-20 11:43:15
·
answer #1
·
answered by kirchwey 7
·
0⤊
0⤋
It can be done through a C or Fortran program but there may be memory problems. I don't know. If you use Javascript, you may still get an error message,"File too large."
I don't know if Excel or some other program can handle it.
Here is a javascript example, but only has 10 values and they are not in a file. They're within the program.
Databases contain several millions of info and they sort immediately. So, there must be a better way.
2007-08-17 13:07:28
·
answer #2
·
answered by cidyah 7
·
0⤊
1⤋
cidyah:
to sort 10^8 numbers your program will have to perform about 10^16 comparisons. Assuming 10^9 op/s it will take at least one year to finish.
There *is* a better way indeed.
2007-08-17 13:17:29
·
answer #3
·
answered by Alexander 6
·
0⤊
1⤋
I think the point of the question is that 100 million is quite a lot.
Excel would cr@p itself before it even started.
This seems like a non-trivial problem.
2007-08-17 13:03:24
·
answer #4
·
answered by Anonymous
·
0⤊
1⤋
1 2 3 so forth and so on
Good Luck
2007-08-17 12:34:09
·
answer #5
·
answered by fire_music_bk 4
·
0⤊
2⤋
MS Access would be good for this.
If you know how to write scripts then any C++ program can help.
Can you be more specific?
2007-08-17 12:43:22
·
answer #6
·
answered by Man 6
·
0⤊
1⤋
If you mean in order, you can use excel. It has a nifty button that will do this for you.
2007-08-17 12:39:40
·
answer #7
·
answered by kvolcom13 3
·
0⤊
1⤋
try numerical order
2007-08-17 12:40:25
·
answer #8
·
answered by Anonymous
·
0⤊
1⤋
use excel.
2007-08-17 12:34:00
·
answer #9
·
answered by Anonymous
·
0⤊
2⤋