Messages in this thread | | | Date | Thu, 23 Apr 2015 23:22:39 +0200 | Subject | Re: [GIT PULL] kdbus for 4.1-rc1 | From | David Herrmann <> |
| |
Hi
On Thu, Apr 23, 2015 at 10:56 PM, Borislav Petkov <bp@alien8.de> wrote: > On Thu, Apr 23, 2015 at 09:14:33PM +0200, Greg Kroah-Hartman wrote: >> I don't know what O(256) means here, O notation usually is used to >> show the complexity of a function, so this really is almost always the >> same amount of time, based on using the hash function. > > This is iterating over 256 hash buckets. So O(n) complexity. Better?
No it's not. O(256) equals O(1).
Thanks David
| |