Ask your own question, for FREE!
Computer Science 7 Online
OpenStudy (bigdave469):

Give a big-O estimate for the number of comparisons used by the algorithm that determines the number of 1s in a bit string of length n by examining each bit of the string to determine whether it is a 1 bit.

OpenStudy (bigdave469):

Duh! I answered it myself it is "n", LOL!

OpenStudy (anonymous):

agree!

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!