Question:Which of the following sorting algorithms yield approximately the same worst-case and average-case running time behavior in O(n*log(n))? 

A Bubble sort and selection sort 
B Heap sort and merge sort 
C Quick sort and radix sort 
D Tree sort and Median-of-3 quicksort 

+ Answer
B 

+ Report

Md. Habib Ullah

Editor, VCampus

Your Name

Your Email

Type of Report
Spelling MistakeIncorrect AnswerGrammar MistakeContent MissingImproper Text FormatInsufficient AnswerDuplicate QuestionImproper Sentence StructureImproper Equation/FormulaOther

Description