English, asked by hs2727639, 3 months ago

which is the following sorting algorithm does not have a worst case running time of 0(n²)? this is MCQ question

Attachments:

Answers

Answered by omairmd57

Answer:

Which of the following sorting algorithms does not have a worst case running time of O(n2 )? Insertion, Quick and bubble all have worst case time complexity of O(n2). Only merge sort has the worst case running time of O(nlogn).

Previous Question

Next Question

Similar questions

Science, 1 month ago

boiling point of water is……...

English, 1 month ago

what did the king see hanging out of the servant pocket...

English, 1 month ago

what is prototype? explain...

Economy, 3 months ago

6. Which of the following statement is not true? a) Export of jute to Sri lanka is recorded on credit side in BOP b) Export of computer software is a visible item in BOP. c) Foreign exchange reserves are to not be kept under Fixed exchange rate system. d) Speculation does not have any impact on foreign exchange rate...

English, 3 months ago

(v) I want (VD He lives Kolkata 3. A. Fill in the blanks with articles and prepositions B. Fill in the blanks with 'in' 'above', on, under, between : ze is you. Ajanta Circus has set up show their events. The manager DSA ground my head. (i) The sun is shining (ii) The beggar is sitting the tree (in I have a pen my pocket. iv) The duster is the table. (v) The table is the two chairs. C. Fill in...

Math, 9 months ago

find the decimal representation of 13/6, 7/3 and 5/11...

English, 9 months ago

what according to Tommy, is the regular way of learning...

World Languages, 9 months ago

वह ईश्वरका भजन करती है। translate in sanskrit pls answer it fast....

which is the following sorting algorithm does not have a worst case running time of 0(n²)? this is MCQ question​

Answers

which is the following sorting algorithm does not have a worst case running time of 0(n²)? this is MCQ question