Question Discussion & Solution

MCQ

Average case time complexity of Quick sort is ______________

? (nlogn)

O(logn)

O(nlogn)

?(logn)

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

Sorting is not possible by using which of the following methods?

Insertion

Selection

Deletion

Exchange

Discussion

MCQ

Application of quicksort _________

Graphic card

Data Processing

Tape sorting

Card Sorting

Discussion

MCQ

For the bubble sort algorithm, what is the time complexity of the best/worst case? (assume that the computation stops as soon as no more swaps in one pass)

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

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

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

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

Discussion

MCQ

The time complexity of the normal quick sort, randomized quick sort algorithms in the worst case is

O(n^2), O(n log n)

O(n^2), O(n^2)

O(n log n), O(n^2)

O(n log n), O(n log n)

O(n log n), O(n^2 log n).

Discussion

MCQ

Which of following algorithm scans the list by swapping the entries whenever pair of adjacent keys are out of desired order?

Insertion sort

Quick sort

Shell sort

Bubble sort

Discussion

Banking

Engineering

General

Medical

Question Discussion & Solution

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Design and Analysis of Algorithms Topics

Design and Analysis of Algorithms Basics

Asymptotic Notation

Divide and Conquer Strategy

Sorting

Linear Time Sorting

Dynamic Programming

Greedy Algorithms

Backtracking Algorithms

Graphs

Complexity Theory

Banking

Engineering

General

Medical

Question Discussion & Solution

report Report Error

forum Community Discussion

auto_awesome Similar Questions

report Report Error

report Report Error

report Report Error

report Report Error

report Report Error

category More Design and Analysis of Algorithms Topics

Design and Analysis of Algorithms Basics

Asymptotic Notation

Divide and Conquer Strategy

Sorting

Linear Time Sorting

Dynamic Programming

Greedy Algorithms

Backtracking Algorithms

Graphs

Complexity Theory

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Design and Analysis of Algorithms Topics