null
US
Sign In
Sign Up for Free
Sign Up
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
Copy and Edit
You need to log in to complete this action!
Register for Free
1775544
Sorting Algorithms
Description
A challenging quiz to drill into your head the proper attributes for each sort as covered in COP 4531.
No tags specified
cop4531 sort
Quiz by
Talor Gannaway
, updated more than 1 year ago
More
Less
Created by
Talor Gannaway
over 9 years ago
53
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
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
Economics definitions: F582
busybee112
BIOLOGY B1 3
x_clairey_x
An Inspector calls Techniques
anya14
The Norman Conquest 1066-1087
adam.melling
Language techniques: Macbeth
arnya_lewis
Biology AS Level UNIT 1
Valentin Andrei
AQA Biology 8.1 structure of DNA
Charlotte Hewson
Edexcel Additional Science Chemistry Topics 1+2
El Smith
Pathos in Battle
mouldybiscuit
Browse Library