On Thu, Apr 23, 2015 at 11:22 PM, David Herrmann <dh.herrm...@gmail.com> wrote: > Hi > > On Thu, Apr 23, 2015 at 10:56 PM, Borislav Petkov <b...@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).
Yeah, that's absolutely correct. I think Boris wanted to say that iterating over all hash buckets can be costly. -- Thanks, //richard -- To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majord...@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/
