0
The best case for a binary search is finding the target item on the first look into the data structure, so O(1).
The worst case for a binary search is searching for an item which is not in the data. In this case, each time the algorithm did not find the target, it would eliminate half the list to search through, so O(log n).
Still curious? Ask our experts.
Chat with our AI personalities
Ezra
Blake
RafaAdd your answer:
Earn +20 pts
What is the ASCII code in binary and decimal for lower case x?
Lower case 'x' is 120 (decimal) or 1111000 (binary) in the ASCII character table.
What is 97 in binary code?
You can easily convert decimal to binary in the scientific calculator - for example, the scientific calculator found in Windows. In this case, type the number in decimal, then click on "binary" to convert to binary.
What is the binary number for 84?
It is the binary number 1010100. A binary number represents exponential values of 2, in this case 7 digits for 64, 32, 16, 8, 4, 2, and 1 84 = 64 + (0x32) + 16 + (0x8) +4 + (0x2) + (0x1) = 1010100
What happens to a binary number n if you compute n mod 4?
The remainder of the division, by 4, is a number between 0 and 3. In the case of binary, this would maintain the last two bits of the original number.
How will you convert octal to hexadecimal?
Each octal digit is equivalent to three binary digits; each hexadecimal digit is equal to four binary digits. I think the best way to do this conversion is to convert each octal digit into the binary equivalent (3 digits in each case - don't omit the zeros on the left), then convert the binary to hexadecimal by grouping four binary digits at a time (starting from the right). Note that nowadays, most scientific calculators - including the calculator that comes included in Windows - have the ability to do this sort of conversion. If you want to practice doing it yourself, you can still use the Windows calculator to check your calculations.
