... input values. \ Sorting .. 0.099 seconds elapsed. ok \ Win32Forth P4 between 2.8 - 3.25 Ghz Creating 10000000 input values. Sorting .. Elapsed time: 00:00:20.419 ok cell sort sedge-c RANDOM-FILL: 10,000,000 items UNsorted Elapsed time: 00:00:25.019 sorted (* End of Source *) == 4ePost: 4,095 bytes in mail. Elapsed time to buffer: .000112 sec.

...mhx/monsterbench.html For educational purposes, I recommend Henning Hansen's paper for the 1989 Rochester Forth Conference, with the title "Sort it out". It has ," none (unsorted partitions)" ," Odd/Even Transport" ," Bubblesort" ," Shakersort" ," Shuttlesort - Sifting" ," Straight Insertionsort" ," Binary Insertionsort" ," Selectionsort" ," Stacksort (new)" ," Heapsort ...

... archives and nothing turned up. What kind of data is in each element of the array? What kind of comparison is needed to know the order? How many elements in the array? How unsorted is the array (completely random, only a few entries out of order, unknown)? How often do you need to sort (just once when you start, whenever you get new data, periodically at some ...

...did search the archives and nothing turned up. What kind of data is in each element of the array? What kind of comparison is needed to know the order? How many elements in the array? How unsorted is the array (completely random, only a few entries out of order, unknown)? How often do you need to sort (just once when you start, whenever you get new data, periodically at some rate...

...then you don't really need a sort, you can do it the way I coded it. Instead of sorting your duplicates and then discarding the extras, you just consider them discarded immediately. But with the unique items unsorted you have potentially a lot of comparisons to do for each new item. Yes, you have many of the comparisons that you would have to do to sort the array ... however, since you "...

... you don't really need a sort, you can do it the way I coded it. Instead of sorting your duplicates and then discarding the extras, you just consider them discarded immediately. But with the unique items unsorted you have potentially a lot of comparisons to do for each new item. Yes, you have many of the comparisons that you would have to do to sort the array ... however, since you "know" the ...

...then you don't really need a sort, you can do it the way I coded it. Instead of sorting your duplicates and then discarding the extras, you just consider them discarded immediately. But with the unique items unsorted you have potentially a lot of comparisons to do for each new item. If that matters you could sort fresh each time you get a new unique item. Use a sort routine that's good for almost-...

...'th' # expected: 'string' # Failed test at t/setwpm.t line 185. # got: 'l' # expected: 'test' # Failed test at t/setwpm.t line 186. # got: 'ring' # expected: 'unsorted' # Failed test at t/setwpm.t line 187. # got: 't' # expected: 'wordlist' # Failed test at t/setwpm.t line 190. # got: undef # expected: '2' # ...

... where relations converge? If not, then discriminated information would always have this kind of "monadic subject" that it is centered around. This might even be the case with raw and unsorted information throughout the universe, with Einstein's "light-cones" as a metaphor for these ubiquitous convergence / integration nodes of cosmic relations. This doesn't solve whether or not the POV is...

... "Contents and personal possessions cover" means cover against loss of or damage to those items. Whoever heard of the public being put at risk by (say) your stamp collection? Have you ever seen the chaos and confusion an unsorted and catalogued stamp collection can cause? It's not a pretty sight. I was thinking exactly the same thing as soon as I pressed the "send" button.