1 Mar
2000
1 Mar
'00
12:28 p.m.
"Fred Cisin (XenoSoft)" <cisin(a)xenosoft.com> wrote:
Lately I keep running into people who are using
"SORT" programs when that
isn't even what is called for.
1) Large sorted data file. Additional records are appended to the file.
Then the file is "SORTED" again. All of the "good" sorts being
mentioned
take the same amount of time to sort the file regardless of whether the
content is random, or almost in order. For this particular example,
therefore, they take significantly LONGER than a properly written Bubble
sort (needs to be written to make each pass going down)
for (j=n-1; j>0; j--) . . .
Hi
Usually I first sort the new data and do a merge, which
is essentially a single pass bubble sort.
Dwight