Re: [PATCH 07/10] bisect: automatically sort sha1_array if needed when looking it up
- From
Jakub Narebski <jnareb@gmail.com>
- Date
- May 9, 2009, 16:28 UTC
- Message-ID
- <m3ljp6me9v.fsf@localhost.localdomain>
- In-Reply-To
- <20090509155548.5387.70784.chriscool@tuxfamily.org>
Christian Couder <chriscool@tuxfamily.org> writes:
> This makes sha1_array easier to use, so later patches will be simpler.
Hmmm... sort on lookup array. I wonder if it would be worth librarizing, and if there is any smart optimization for that (like e.g. heap for fast access to smallest value and fast insertion, using insertion sort for almost sorted array, etc.).
BTW. does it become unsorted anywhere?
-- Jakub Narebski Poland ShadeHawk on #git