[Updated] Goldman Sachs Aptitude Test Questions and Answers
Practice List of TCS Digital Coding Questions !!!
Take 50+ FREE!! Online Data Interpretation Mock test to crack any Exams.

Data Structures :: Searching & Sorting - Discussion

Home > Data Structures > Searching & Sorting > MCQs Questions Discussion

29 / 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 ::

Post Your Answer Here:     

No Discussion on this question yet!