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

Data Structures and Algorithm analysis

Bart Allen

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 10 years ago

69

0

(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

0 comments

There are no comments, be the first and leave one below:

To join the discussion, please sign up for a new account or log in with your existing account.

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

Similar

Computer Science - Algorithms

Max Cutten

Crime and Deviance with sociological methods key terms

emzelise1996

OCR Biology AS level (f211) flashcards/revision notes

Dariush Zarrabi

GCSE AQA Chemistry Atomic Structure and Bonding

Joseph Tedds

Edexcel Additional Science Chemistry Topics 1+2

hchen8nrd

PSBD TEST # 3_1

Suleman Shah

French Revolution quiz

Sarah Egan

New English Literature GCSE

Sarah Egan

Creating Mind Maps with GoConqr

Sarah Egan

3MA114 Management_test 1/2

Jakub Beyr