You are the head of a division of a big Silicon Valley company and have assigned one of your engineers, Jim, the job of devising an algorithm to sort through an English text of n words and convert it into an Esperanto document. Jim comes up with an algorithm which takes 2n2 2" bit operations to handle an input text with n words.
Suppose the computers in your business can handle one bit operation every nanosecond (1 nanosecond 10onds) How many nanoseconds would it take Jim's algorithm to convert a text with 10 words on these computers?
How many DAYs would it take Jim's algorithm to convert a text with 50 words on these computers?( Do not round your answers for WeBWorK.) (Recall a million is 10%, a billion is 10 and a trillion is 1012)
For an input text of 100 words, the statement that best describes the performance of Jim's algorithm is:
A. His algorithm would take between 40 thousand and 40 million years to run.
B. His algorithm would take between 40 and 400 years to run.
C. His algorithm would take between 4000 and 40, 000 years to run.
D. His algorithm would take between 40 billion and 40 trillion years to run.
E. His algorithm would take more than 40 tillion years to run
F. His algorithm would take between 40 million and 40 bilion years to run.
G. His algorithm would take between 4 and 40 years to run