From ... From: Erik Naggum Subject: Re: binary search? Date: 1999/03/10 Message-ID: <3130021426931539@naggum.no>#1/1 X-Deja-AN: 453223308 References: <36E31DBC.BC03C9E7@iname.com> <87vhgc6a44.fsf@pc-hrvoje.srce.hr> <3130013677827179@naggum.no> mail-copies-to: never Organization: Naggum Software; +47 8800 8879; http://www.naggum.no Newsgroups: comp.lang.lisp * Johan Kullstam | e.g., if you need to add or remove stuff in the middle, it's easy and | fast using a list structure but somewhat more involved with a vector. well, I'd argue the exact opposite, just as I'd argue that pushing values on vectors will fill-pointers are more efficient than pushing values on lists in many cases. besides, if you worry about timing in the binary-search-on-lists case, you also probably worry enough about it to write functions that are efficient destructive operations on vectors-with-fill-pointers. in brief, I think Sam's 10% speedup is a case of becoming satisfied with an optimization. often, much more dramatic wins can be obtained by doing something _very_ different than just tuning a particular choice. #:Erik