>- Open Your Mind -< Quoting from Brian Hawley's message (08-Jul-00 01:31:18). b> This either means resorting the list after every b> insert, using an incremental insertion sort, or making b> sure the data is inserted in order. Hmmm. :-> You mean something like this invented example? >> probe data == [15 98 60 52 10 2] >> insert/sorted/compare data 15 :method == [98 60 52 15 10 2] Hey, staff!.. How 'bout... :-> Alessandro Pini ([EMAIL PROTECTED]) "!naidne elttil etah I"
- [REBOL] Previous version Re:(4) malcolm
- [REBOL] Previous version Re:(5) jhagman
- [REBOL] Previous version Re:(6) malcolm
- [REBOL] Previous version Re:(7) jhagman
- [REBOL] Find speed Re:(3) brian . hawley
- [REBOL] Find speed Re:(4) jimg
- [REBOL] Find speed Re:(5) brian . hawley
- [REBOL] Find speed Re:(4) lmecir
- [REBOL] Re: Find speed Re:(3) giesse
- [REBOL] Find speed Re:(2) alex . pini
- [REBOL] Find speed Re:(2) brian . hawley
- [REBOL] Re: Find speed alex . pini
- [REBOL] Re: Find speed alex . pini
- [REBOL] Find speed /Databases Re:(2) tim
- [REBOL] Find speed Re: Galt_Barber
- [REBOL] Find speed Re:(2) lmecir
- [REBOL] Find speed Re:(3) icimjs
- [REBOL] Find speed Re:(4) lmecir
- [REBOL] Find speed Re: KGD03011