McqMate
Sign In
Hamberger menu
McqMate
Sign in
Sign up
Home
Forum
Search
Ask a Question
Sign In
McqMate Copyright © 2026
→
Computer Science Engineering (CSE)
→
DataBase Management System (DBMS)
→
The complexity of Bubble sort algorithm ...
Q.
The complexity of Bubble sort algorithm is
A.
o(n)
B.
o(log n)
C.
o(n2)
D.
o(n log n)
Answer» C. o(n2)
1.8k
0
Do you find this helpful?
14
View all MCQs in
DataBase Management System (DBMS)
Discussion
No comments yet
Login to comment
Related MCQs
The complexity of the average case of an algorithm is
The complexity of a linear search algorithm is
Which of the following case does not exist in complexity theory
What is the default “SORT” order for a SQL?
Which SQL keyword is used to sort the result-set?
The algorithm that takes a set of dependencies and adds one schema at a time, instead of decomposing the initial schema repeatedly is
Which algorithm uses equality comparison on a key attribute with a primary index to retrieve a single record that satisfies the corresponding equality condition.
The algorithm that uses a secondary ordered index to guide retrieval for comparison conditions involving <,≤,≥, or > is
The algorithm scans each index for pointers to tuples that satisfy an individual condition.
The space factor when determining the efficiency of an algorithm is measured by