>- Open Your Mind -< Quoting from Brian Hawley's message (10-Jul-00 23:18:02). b> I mentioned three methods. b> Resorting the list after every insert: b> Incremental insertion sort (linear search): b> Making sure the input is sorted in the first place: b> Does that help? Yes and no: while what you wrote deals well with the task, I was looking for the speed of a native function (while inadvertently going off topic... :-) Alessandro Pini ([EMAIL PROTECTED]) "Open the window, HAL." (-: Bowman :-)
- [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] Re: Find speed 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