Breaking of the third wall.
if you were to be an actor on a stage and directly ask the audience a question, or making a statement that you as a character acknowledge that the character knows it is a play.
Answer:
50% - one half life — 5,730 years
25% — two half lifes — 11,460 years
12.5% — three half lifes — 17,190 years
6.25% — four half lifes — 22,920 years
3.125% — five half lifes — 28,650 years
Explanation:
Answer: print("I can code")
Explanation:
luckily im a coder
Of course there is. On a simple level, consider a parent trying to locate their missing child. Someone might break into their social media accounts to see if there are messages that might help determine their whereabouts.
Consider a website hosting inappropriate pictures of children. Breaking into the server hosting the files and removing them is 100% ethical.
I'm sure you can think of more examples.
Answer:
There is also an attachment below
Explanation:
Since we are talking about binary search, let's assume that the items are sorted according to some criteria.
Time complexity of binary search is O(logN) in worst case, best case and average case as well. That means it can search for an item in Log N time where N is size of the input. Here problem talks about the item not getting found. So, this is a worst case scenario. Even in this case, binary search runs in O(logN) time.
N = 700000000.
So, number of comparisions can be log(N) = 29.3 = 29.
So, in the worst case it does comparisions 29 times
