Computer Science, asked by spp3819, 14 days ago

Assume an algorithm that takes log? n microseconds to solve a problem. Find the largest input size n such that the algorithm solves the problem in time in 24 days. a) 21400000 b) 21440000 c) 21444000 d) 21404040

Answers

Answered by anuj071107

1

Answer:

b 21440000

Explanation:

please mark brainliest

Previous Question

Next Question

Similar questions

Science, 7 days ago

the density of a substance og 8.4 gm/cm3 and aatudent find its density practicaly 8.7gm/cm3 what is persantage error...

Math, 7 days ago

what is the product if (-1) is multiplied by itself is times...

Math, 7 days ago

simlify (4+√5)(4-√5) and identify whether the number is rational or irrational...

English, 14 days ago

What is a predicate can anyone answer...

Math, 14 days ago

Student secures 90%, 60% and 54% marks in test papers with 100, 150 and 200 respectively as maximum marks. The percentage of his aggregate is ...

History, 8 months ago

Mehrgarh civilisation characteristics 3 points...

Math, 8 months ago

Find the product :(-5p sqr q) x (3pq sqr ) * (-2pq sqr ) ...

English, 8 months ago

Write a letter to your father requesting him for permission to go with your friend on an educational tour...