Menu

Question Discussion & Solution

MCQ

Q.

For the quick sort algorithm, what is the time complexity of the best/worst case?

A

best case: O(n) worst case: O(n*n)

B

best case: O(n) worst case: O(n*log(n))

C

best case: O(n*log(n)) worst case: O(n*log(n))

D

best case: O(n*log(n)) worst case: O(n*n)

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Login to Discuss

Similar Questions

MCQ

1.

Let there be an array of length

A

N log N times

B

log N times

C

N2 times

D

N-1 times

E

N times.

Discussion

MCQ

2.

Quick sort invented by _____________

A

CARHOARE

B

HAMILTON

C

JOHN VON NEUMANN

D

STRASSEN

Discussion

MCQ

3.

This algorithm scans the list by swapping the entries whenever pair of adjacent keys are out of desired order.

A

Insertion sort.

B

Bubble sort.

C

Shell sort.

D

Quick sort.

Discussion

MCQ

4.

Average case time complexity of Quick sort is ______________

A

? (nlogn)

B

O(logn)

C

O(nlogn)

D

?(logn)

Discussion

MCQ

5.

Best case time complexity of Quick sort is ______________

A

O(n^2logn)

B

O(nlogn)

C

O(logn)

D

O(logn2)

Discussion

More Design and Analysis of Algorithms Topics

Design and Analysis of Algorithms Basics

76 MCQs

Asymptotic Notation

38 MCQs

Divide and Conquer Strategy

18 MCQs

Sorting

14 MCQs

Linear Time Sorting

8 MCQs

Dynamic Programming

18 MCQs

Greedy Algorithms

10 MCQs

Backtracking Algorithms

13 MCQs

Graphs

18 MCQs

Complexity Theory

11 MCQs