Question: What is the best case time complexity of comb sort and bubble sort respectively?

Options

A : O(n2) and O(n log n)

B : O(n log n) and O(n)

C : O(n) and O(n2)

D : O(n2/2a) (a=number of increment) and O(n2)

Click to view Correct Answer

Previous || Next

Comb Sort Multiple Choice Mcqs more questions

What is the average case time complexity of bogosort?

What is the worst case time complexity of bogosort?

The time complexity of calculating the sum of all leaf....

The computation of e-closure of n-states takes ______ time.

Consider the brute force implementation of the rod cutting problem....

The time complexity to test whether a graph is bipartite....

Let f: N->N be a step counting function. Then for....

What is the average case time complexity of binary search....

What is the time complexity of binary search with iteration?

What is the time complexity of uniform binary search?

Chemical Engineering Basics - Part 1 more Online Exam Quiz

Chans Algorithm Multiple Choice Mcqs

Chromatic Number Multiple Choice Mcqs

Closest Pair Problem Multiple Choice Mcqs

Cocktail Sort Multiple Choice Mcqs

Columnar Transposition Multiple Choice Mcqs

Complete Bipartite Graph Multiple Choice Mcqs

Control Systems State Regulator Problem

Co Ordinate Compressiont Multiple Choice Mcqs

Counting Sort Multiple Choice Mcqs

Count Inversion Multiple Choice Mcqs