Talor Gannaway
Quiz by , created more than 1 year ago

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

58
0
0
Talor Gannaway
Created by Talor Gannaway almost 10 years ago
Close

Sorting Algorithms

Sorting Algorithms

Question 1 of 10

1

Describe Selection Sort

Select one or more of the following:

  • 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

Explanation

Question 2 of 10

1

Describe Insertion Sort

Select one or more of the following:

  • 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

Explanation

Question 3 of 10

1

Describe Heap Sort

Select one or more of the following:

  • 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

Explanation

Question 4 of 10

1

Describe Quick Sort

Select one or more of the following:

  • 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

Explanation

Question 5 of 10

1

Describe Merge Sort for arrays

Select one or more of the following:

  • 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

Explanation

Question 6 of 10

1

Describe Merge Sort for lists

Select one or more of the following:

  • 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

Explanation

Question 7 of 10

1

Describe Counting Sort

Select one or more of the following:

  • 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

Explanation

Question 8 of 10

1

Describe Radix Sort

Select one or more of the following:

  • 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

Explanation

Question 9 of 10

1

Describe Bit Sort

Select one or more of the following:

  • 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

Explanation

Question 10 of 10

1

Describe Byte Sort

Select one or more of the following:

  • 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

Explanation

Previous
Next