aliensbrain
  • Home
  • Study
  • Quizzes
  • 🎤AI Practicefree
  • Notebooks
  • Community
  • Sign in
  • Computer Science (GATE Exam) 2007 - Previous Question Paper Solution
  • Which of the following sorting algorithms has the lowest ...
Multiple choice

Which of the following sorting algorithms has the lowest worst-case complexity?

  1. Merge sort

  2. Bubble sort

  3. Quick sort

  4. Selection sort

Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

Keep practicing — related questions

  • Which of the following sorting algorithms has average-case and worst-case running time of O?
  • Which of the following algorithms does not have the same complexity for the worst case and the average case?
  • Which of the following statements is/are true? 1. Quick sort algorithm and bubble sort algorithm takes O(n2...
  • After insertion of n keys, worst case running time of the algorithm would be _______________ An iterative a...
  • Complex I is the first enzyme in the mitochondrial respiratory chain. Which of the following acts as an inh...
  • Which of the following OS scheduling algorithms provides a fix time for each process to execute?
  • Which of the following scheduling algorithms uses context switching to save the state of the pre-empted pro...
  • Which of the following situations are noticed in case of Eutrophication? 1. Great increase of phytoplankton...
Play the full quiz 🎤 Practise this topic out loud

Practice this topic

  • Data Structures and Algorithms (1518 questions)
Advertisement
© Aliensbrain | all rights reserved
  • About
  • Contact
  • Terms and Condition
  • Privacy Policy