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 le

Question

icang [17]

3 years ago

9

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 le

ngth n by examining each bit of the string to determine whether it is a 1 bit.

Computers and Technology

2 answers:

larisa [96] · Answer 1 · 2022-08-17T04:13:56+03:00

The answer is "n".
Algorithms are considered to be process or a bunch or rules that is to be followed in computing or calculating. This is used to solve operational problems especially by a computer. Algorithms perform data processing, calculation, or/and automated reasoning activities.

Illusion [34] · Answer 2 · 2022-08-17T02:40:16+03:00

Illusion [34]3 years ago

3 0

The notation would be O (n-1) because there would be no need to compare with the first bit however this notation is most commonly noted as O (n) but the first is also technically correct