Unsortable
  Home FAQ Contact Sign in
 
Advanced search
MATCHING GROUPS



more...
POPULAR GROUPS

more...

found 78 articles for 0.000 sec
Re: Sorting routine     

Group: comp.lang.forth · Group Profile · Search for Unsortable in comp.lang.forth
Author: Jos van de Ven
Date: Sep 6, 2008 06:51

... 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.
Show full article (4.07Kb) · Show article thread
Re: Sorting routine     

Group: comp.lang.forth · Group Profile · Search for Unsortable in comp.lang.forth
Author: Marcel Hendrix
Date: Sep 5, 2008 10:29

...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 ...
Show full article (1.35Kb) · Show article thread
Re: Sorting routine     

Group: comp.lang.forth · Group Profile · Search for Unsortable in comp.lang.forth
Author: Frank
Date: Aug 29, 2008 14:42

... 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 ...
Show full article (1.27Kb) · Show article thread
Re: Sorting routine     

Group: comp.lang.forth · Group Profile · Search for Unsortable in comp.lang.forth
Author: John Passaniti
Date: Aug 29, 2008 14:26

...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...
Show full article (0.68Kb) · Show article thread
Re: Elementary but surprisingly difficult.     

Group: comp.lang.forth · Group Profile · Search for Unsortable in comp.lang.forth
Author: Jonah Thomas
Date: Jun 4, 2008 10:41

...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 "...
Show full article (3.62Kb) · Show article thread
Re: Elementary but surprisingly difficult.     

Group: comp.lang.forth · Group Profile · Search for Unsortable in comp.lang.forth
Author: Bruce McFarling
Date: Jun 3, 2008 09:36

... 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 ...
Show full article (1.87Kb) · Show article thread
Re: Elementary but surprisingly difficult.     

Group: comp.lang.forth · Group Profile · Search for Unsortable in comp.lang.forth
Author: Jonah Thomas
Date: Jun 2, 2008 15:45

...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-...
Show full article (3.93Kb) · Show article thread
FAIL Math-String-Charset-Wordlist-0.08 MSWin32-x86-multi-thread 5.1     

Group: perl.cpan.testers · Group Profile · Search for Unsortable in perl.cpan.testers
Author: Dagolden
Date: May 13, 2008 03:09

...'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' # ...
Show full article (8.37Kb)
Re: Am I Conscious of my own Consciousness?     

Group: alt.philosophy · Group Profile · Search for Unsortable in alt.philosophy
Author: D H
Date: Mar 13, 2008 08:04

... 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...
Show full article (1.60Kb) · Show article thread
Re: cyclists win     

Group: uk.transport · Group Profile · Search for Unsortable in uk.transport
Author: JNugent
Date: Feb 17, 2008 10:19

... "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.
Show full article (0.43Kb) · Show article thread
1 · 2 · 3 · 4 · 5 · 6 · 7 · 8 · next