[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: bsearch in octave
From: |
Jeff Abrahamson |
Subject: |
Re: bsearch in octave |
Date: |
Sat, 25 Jun 2005 15:24:11 -0400 |
User-agent: |
Mutt/1.5.9i |
On Sat, Jun 25, 2005 at 09:20:26PM +0800, LUK ShunTim wrote:
> And I learn what is a bsearch now; but I don't understand how does
> "binary" comes in?
It's called a binary search because it is motivated by searching a
binary tree (two leaves per node max). At each step you make a
decision to go left or right.
Thanks to everyone for the helpful info on find and idx.
--
Jeff
Jeff Abrahamson <http://www.purple.com/jeff/> +1 215/837-2287
GPG fingerprint: 1A1A BA95 D082 A558 A276 63C6 16BF 8C4C 0D1D AE4B
-------------------------------------------------------------
Octave is freely available under the terms of the GNU GPL.
Octave's home on the web: http://www.octave.org
How to fund new projects: http://www.octave.org/funding.html
Subscription information: http://www.octave.org/archive.html
-------------------------------------------------------------