- Computer Science Engineering (CSE)
- Data Structure (DS)
- The total number of comparisons in a bub...

Q. |
## The total number of comparisons in a bubble sort is …. |

A. | O(n logn) |

B. | O(2n) |

C. | O(n2) |

D. | O(n) |

Answer» A. O(n logn) |

View all MCQs in:
Data Structure (DS)

- The number of comparisons done by sequential search is ………………
- In general, the binary search method needs no more than ……………. comparisons.
- Which of the following is not the internal sort?
- The time complexity of quick sort is …………..
- Which of following data structure is more appropriate for implementing quick sort iteratively?
- Quick sort is also known as ……..
- The total number of elements in a stack at a given point of time can be calculated from the value of______.
- How do you count the number of elements in the circular linked list?
- Minimum number of fields in each node of a doubly linked list is____
- The number of edges in a complete graph of n vertices is

Login to Continue

It will take less than 2 minutes

Report MCQ