Extra Education
← All Data Structure and Algorithms (DSA) questions
1

Consider that n elements are to be sorted. What is the worst case time complexity of Bubble sort?

Correct Answer: o(n^2)

Make the most of this question

This page focuses on one Data Structure and Algorithms (DSA) question from Engineering. After checking the answer, return to the topic list to practice more or run a timed set.

← More Data Structure and Algorithms (DSA) MCQsAll Engineering topicsMock test hub
Data Structure and Algorithms (DSA) MCQ: Consider that n elements are to be sorted. What is the worst case time complexity of Bubble sort? | Extra Education