We have detected that Javascript is not enabled in your browser. The dynamic nature of our site means that Javascript must be enabled to function properly. Please read our terms and conditions for more information.

Next up

Sorting Algorithms

Description

A challenging quiz to drill into your head the proper attributes for each sort as covered in COP 4531.

Quiz by Talor Gannaway, updated more than 1 year ago

	Created by Talor Gannaway over 9 years ago

48

0

Resource summary

Question 1

Question

Describe Selection Sort

Answer

WCRT Θ(n^2)
WCRT Θ(n log n)
WCRT Θ(n)
ACRT Θ(n log n)
Best possible WCRT
In Place
Run space +Θ(n)
Stable
Not Stable
Comparison Sort

Question 2

Question

Describe Insertion Sort

Answer

WCRT Θ(n^2)
WCRT Θ(n log n)
WCRT Θ(n)
ACRT Θ(n log n)
Best possible WCRT
In Place
Run space +Θ(n)
Stable
Not Stable
Comparison Sort

Question 3

Question

Describe Heap Sort

Answer

WCRT Θ(n^2)
WCRT Θ(n log n)
WCRT Θ(n)
ACRT Θ(n log n)
Best possible WCRT
In Place
Run space +Θ(n)
Stable
Not Stable
Comparison Sort

Question 4

Question

Describe Quick Sort

Answer

WCRT Θ(n^2)
WCRT Θ(n log n)
WCRT Θ(n)
ACRT Θ(n log n)
Best possible WCRT
In Place
Run space +Θ(n)
Stable
Not Stable
Comparison Sort

Question 5

Question

Describe Merge Sort for arrays

Answer

WCRT Θ(n^2)
WCRT Θ(n log n)
WCRT Θ(n)
ACRT Θ(n log n)
Best possible WCRT
In Place
Run space +Θ(n)
Stable
Not Stable
Comparison Sort

Question 6

Question

Describe Merge Sort for lists

Answer

WCRT Θ(n^2)
WCRT Θ(n log n)
WCRT Θ(n)
ACRT Θ(n log n)
Best possible WCRT
In Place
Run space +Θ(n)
Stable
Not Stable
Comparison Sort

Question 7

Question

Describe Counting Sort

Answer

WCRT Θ(n^2)
WCRT Θ(n log n)
WCRT Θ(n)
ACRT Θ(n log n)
Best possible WCRT
In Place
Run space +Θ(n)
Stable
Not Stable
Comparison Sort

Question 8

Question

Describe Radix Sort

Answer

WCRT Θ(n^2)
WCRT Θ(n log n)
WCRT Θ(n)
ACRT Θ(n log n)
Best possible WCRT
In Place
Run space +Θ(n)
Stable
Not Stable
Comparison Sort

Question 9

Question

Describe Bit Sort

Answer

WCRT Θ(n^2)
WCRT Θ(n log n)
WCRT Θ(n)
ACRT Θ(n log n)
Best possible WCRT
In Place
Run space +Θ(n)
Stable
Not Stable
Comparison Sort

Question 10

Question

Describe Byte Sort

Answer

WCRT Θ(n^2)
WCRT Θ(n log n)
WCRT Θ(n)
ACRT Θ(n log n)
Best possible WCRT
In Place
Run space +Θ(n)
Stable
Not Stable
Comparison Sort

Show full summary Hide full summary

Want to create your own Quizzes for free with GoConqr? Learn more.

Similar

Data Structures and Algorithm analysis

Bart Allen

Computer Science - Algorithms

Max Cutten

Work, Energy & Power: Quiz

alex.examtime9373

One child policy, China- Population Control Case Study

a a

Korean Grammar Basics

Eunha Seo

B7: Further Biology

Matthew Law

Unit 3 Business Studies

Lauren Thrower

Checking out me History by John Agard

Eleanor Simmonds

The Five Minute Lesson Plan Template

tom.roche_

Using GoConqr to teach science

Sarah Egan

Biology - B1 - AQA - GCSE - Keeping Healthy and Defending Against Infection

Josh Anderson