Computer Science, asked by kalechandrakant8610, 11 months ago

The complexity of merge sort algorithm is
A. O(n)
B. O(log n)

Answers

Answered by ShiningSilveR

0

The complexity of merge sort algorithm is

A. O(n)

B. O(log n) ✔️✔️

Answered by blabla5011

0

Option B. O(log n).....

Previous Question

Next Question

Similar questions

Physics, 6 months ago

6. Fuse wire is made up of (a) alluminium (c) iron (b) led (d) tin This is my 6th question Please solve it..................

English, 6 months ago

my parents .....(go )to the market .(past indeifinate negative )...

Math, 6 months ago

find the value of x in the following proportions: x,6,5,3...

Science, 11 months ago

explain in detail the modified universal soil loss equation?

Art, 11 months ago

क्रिकेट के गेंद की परिधि क्या होती है ? (A) 22.4 से 22.9 सेमी (B) 24.5 से 24.8 सेमी (C) 23.5 से 23.9 सेमी (D) इनमें से कोई नहीं...

Chemistry, 1 year ago

explain briefly the property of carnation of carbon atoms...

Science, 1 year ago

what is dark energy? it is composed of ?

English, 1 year ago

an essay on topic why south korea is my favourite country in 300 words...