Data Structures :: Searching & Sorting - Discussion
Home > Data Structures > Searching & Sorting > MCQs Questions Discussion
31 / 69
Choose the correct option.
Which of the following sorting algorithms does not have a worst case running time of O(n^2) ?
AInsertion sort
BMerge sort
CQuick sort
DBubble sort
Answer: Option (Login/Signup)
Show Explanation
Asked In ::
No Discussion on this question yet!