Computer Science, asked by medhathakur9273, 1 year ago

The worst case run time of binary search algorithm is proportional to log2n where n is the size of input sequence.

Answers

Answered by sgpaul
0
the value of n is 4

hope it helps you
Previous Question
Next Question
Similar questions
India Languages, 7 months ago
 खालील वाक्यातील सर्वनाम ओळखा. १. त्याने मला वही दिली. २. आपण सारे खेळूया. ३. तू आता घरी जा. ४. ही माझी टोपी आहे. ५. मी आताच घरी आलो. ६. जो मेहनत करतो तो यशस्वी होतोच. ७. आपण कोठून आलात? ८. तुम्ही घरी कधी येणार? ९. तुमच्यापैकी कोण धडा वाचणार? १०. मी स्वतः त्याला पाहीले. ११. कोणी कोणास हसू नये. १२. जो तळे राखील तो पाणी चाखील. १३. त्या पेटीत काय आहे ते सांग. १४. हा माझा भाऊ...
Math, 7 months ago
sorry to ask again this question ​...
History, 7 months ago
which of the following is true?(a)lord Wellesley set up the IMA at Dehradun (b) Wellesley set up the Fort William college at Calcutta in 1801(c) Lord Wellesley set up the Jawaharlal Nehru University (d) Lord Wellesley set up the raghunath girl college​...
Biology, 1 year ago
What is plecenta? write any two major functions of placenta . merithnation?
Biology, 1 year ago
What happens when an aerobic organism is placed in an anaerobic environment?
Hindi, 1 year ago
Five lines about tesu flower ( in Hindi language)...
English, 1 year ago
Read the following passage and answer the questions that follow: A new study has found that the giant panda’s distinct black-and-white markings have two functions: camouflage and communication. The scientists who earlier uncovered why zebras have black-and-white strips, took the colouration question to giant pandas in the latest study. “Understanding why the giant panda has such striking...
Biology, 1 year ago
Speech about hand loom workers and cotton growers...