Copy and Edit

Sorting Algorithms

Description

A challenging quiz to drill into your head the proper attributes for each sort as covered in COP 4531.
Talor Gannaway
Quiz by Talor Gannaway, updated more than 1 year ago
Talor Gannaway
Created by Talor Gannaway over 9 years ago
48
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
How to Create A Mindmap
PatrickNoonan
Cell Structure
daniel.praecox
Spanish: Grammar 3.2
Selam H
Databases
Dean Whittle
GCSE Maths Notes: Averages
Andrea Leyden
Characters in Lord of the Flies
lowri_luxton
The Cold War Quiz
Niat Habtemariam
Music symbols
Sarah Egan
Specific Topic 7.3 Timber selection
T Andrews
Browse Library