From: "Jeffrey R. Carter" <spam.jrcarter.not@spam.not.acm.org>
Subject: Re: Linear Search
Date: Wed, 28 Sep 2016 16:08:29 -0700
Date: 2016-09-28T16:08:29-07:00 [thread overview]
Message-ID: <nshih3$lk$1@dont-email.me> (raw)
In-Reply-To: <nsh8nk$4qh$1@franka.jacob-sparre.dk>
On 09/28/2016 01:21 PM, Randy Brukardt wrote:
>
> Or, say compiling Ada and the search is in generated parse tables. (I was
> able to speed up the parsing speed of our compiler by an order of magitude
> by replacing the linear search for the next symbol by a tuned search.)
Sure, I've done that, too. And when I did it, the time difference made the
program significantly more responsive to users. But I was never searching
anything close to 7M items. If I had written the same program today, with the
same linear search, it seems likely that it would have been fast enough, and I'd
never have needed to change it.
--
Jeff Carter
"Perfidious English mouse-dropping hoarders."
Monty Python & the Holy Grail
10
next prev parent reply other threads:[~2016-09-28 23:08 UTC|newest]
Thread overview: 10+ messages / expand[flat|nested] mbox.gz Atom feed top
2016-09-28 16:41 Linear Search Jeffrey R. Carter
2016-09-28 17:23 ` Niklas Holsti
2016-09-28 18:24 ` Jeffrey R. Carter
2016-09-28 21:03 ` Niklas Holsti
2016-09-28 22:20 ` Jeffrey R. Carter
2016-09-28 20:21 ` Randy Brukardt
2016-09-28 23:08 ` Jeffrey R. Carter [this message]
2016-09-29 5:40 ` Randy Brukardt
2016-09-29 4:39 ` Paul Rubin
2016-09-29 4:47 ` Jeffrey R. Carter
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox