Algorithms | BubbleSort | Question 1

Last Updated :
Discuss
Comments

Assume that we use Bubble Sort to sort n distinct elements in ascending order. When does the best case of Bubble Sort occur?

When elements are sorted in ascending order

When elements are sorted in descending order

When elements are not sorted by any order

There is no best case for Bubble Sort. It always takes O(n*n) time

This question is part of this quiz :

Top MCQs on Sorting Algorithms with Answers,Top MCQs on BubbleSort Algorithm with Answers,Top 50 Algorithms MCQs with Answers
Tags:
DSA Quiz
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy