1 Mar
2009
1 Mar
'09
7:44 p.m.
Steven Watanabe skrev:
AMDG
Thorsten Ottosen wrote:
Steven Watanabe skrev:
Since when can you compute the bitwise and of an arbitrary size bitset in constant time?
Well, if the bitset size is less than or equal the word size.
That has nothing to do with big-O. big-O describes an algorithm's asymptotic behavior as the input becomes large.
Right. Anyway, it doesn't change the fact that it is a lot faster, often exchanging linear complexity with constant complexity (without alking about big-O complexity). -Thorsten