From: "Jeffrey R. Carter" <spam.jrcarter.not@spam.not.acm.org>
Subject: Re: Linear Search
Date: Wed, 28 Sep 2016 11:24:15 -0700
Date: 2016-09-28T11:24:15-07:00 [thread overview]
Message-ID: <nsh1s9$3ts$1@dont-email.me> (raw)
In-Reply-To: <e52ck2Fos4U1@mid.individual.net>
On 09/28/2016 10:23 AM, Niklas Holsti wrote:
>
> Sure there is: when you have to do the search, say, 1000 times per second...
> because you are servicing 1000 net queries per second...
But how many values are you keeping in memory? If you keep 100k values in
memory, which still seems like a lot to me, then a linear search takes about 0.3
ms, and you could easily do 1000 of those per second.
--
Jeff Carter
"Brave Sir Robin ran away."
Monty Python and the Holy Grail
59
next prev parent reply other threads:[~2016-09-28 18:24 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 [this message]
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
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