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

Computer Science, 6 months ago

Advantages of DBMS ?

English, 6 months ago

.Nobody (know, knows) the trouble I've seen, 2.(Is, Are) the news on at five or six? 3. Mathematics (is, are) John's favourite subject. 4. Eight dollars (is, are) the price of a movie these days...

Chemistry, 6 months ago

11. ਬੀਜ ਅਤੇ ਮਿੱਟੀ ਤੋਂ ਪੈਦਾ ਹੋਣ ਵਾਲੀਆਂ ਇਨੋਕਲਮ ਨੂੰ ਕੰਟਰੋਲ ਕਰਨ ਲਈ , ਬੀਜ ਦੇ ਇਲਾਜ ਲਈ ਉੱਲੀ ਮਾਰ ਹੈ ? * 0 ਤ੍ਰਿਕੋਮਾ 0 ਤ੍ਰਿਕੋਡਰਮਾ O ਰਾਈਜੋਪਸ O ਰਾਈਜੋਬੀਅਮ | ----...

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...