GoConqr has a new look! Let us know what you think.

Sign up free

Quiz

Sorting Algorithms

Talor Gannaway 10 questions

Take the quiz

Questions in this quiz (10)

  1. 1Describe Selection Sort
    1. AWCRT Θ(n^2)
    2. BWCRT Θ(n log n)
    3. CWCRT Θ(n)
    4. DACRT Θ(n log n)
    5. EBest possible WCRT
    6. FIn Place
    7. GRun space +Θ(n)
    8. HStable
    9. INot Stable
    10. JComparison Sort
  2. 2Describe Insertion Sort
    1. AWCRT Θ(n^2)
    2. BWCRT Θ(n log n)
    3. CWCRT Θ(n)
    4. DACRT Θ(n log n)
    5. EBest possible WCRT
    6. FIn Place
    7. GRun space +Θ(n)
    8. HStable
    9. INot Stable
    10. JComparison Sort
  3. 3Describe Heap Sort
    1. AWCRT Θ(n^2)
    2. BWCRT Θ(n log n)
    3. CWCRT Θ(n)
    4. DACRT Θ(n log n)
    5. EBest possible WCRT
    6. FIn Place
    7. GRun space +Θ(n)
    8. HStable
    9. INot Stable
    10. JComparison Sort
  4. 4Describe Quick Sort
    1. AWCRT Θ(n^2)
    2. BWCRT Θ(n log n)
    3. CWCRT Θ(n)
    4. DACRT Θ(n log n)
    5. EBest possible WCRT
    6. FIn Place
    7. GRun space +Θ(n)
    8. HStable
    9. INot Stable
    10. JComparison Sort
  5. 5Describe Merge Sort for arrays
    1. AWCRT Θ(n^2)
    2. BWCRT Θ(n log n)
    3. CWCRT Θ(n)
    4. DACRT Θ(n log n)
    5. EBest possible WCRT
    6. FIn Place
    7. GRun space +Θ(n)
    8. HStable
    9. INot Stable
    10. JComparison Sort
  6. 6Describe Merge Sort for lists
    1. AWCRT Θ(n^2)
    2. BWCRT Θ(n log n)
    3. CWCRT Θ(n)
    4. DACRT Θ(n log n)
    5. EBest possible WCRT
    6. FIn Place
    7. GRun space +Θ(n)
    8. HStable
    9. INot Stable
    10. JComparison Sort
  7. 7Describe Counting Sort
    1. AWCRT Θ(n^2)
    2. BWCRT Θ(n log n)
    3. CWCRT Θ(n)
    4. DACRT Θ(n log n)
    5. EBest possible WCRT
    6. FIn Place
    7. GRun space +Θ(n)
    8. HStable
    9. INot Stable
    10. JComparison Sort
  8. 8Describe Radix Sort
    1. AWCRT Θ(n^2)
    2. BWCRT Θ(n log n)
    3. CWCRT Θ(n)
    4. DACRT Θ(n log n)
    5. EBest possible WCRT
    6. FIn Place
    7. GRun space +Θ(n)
    8. HStable
    9. INot Stable
    10. JComparison Sort
  9. 9Describe Bit Sort
    1. AWCRT Θ(n^2)
    2. BWCRT Θ(n log n)
    3. CWCRT Θ(n)
    4. DACRT Θ(n log n)
    5. EBest possible WCRT
    6. FIn Place
    7. GRun space +Θ(n)
    8. HStable
    9. INot Stable
    10. JComparison Sort
  10. 10Describe Byte Sort
    1. AWCRT Θ(n^2)
    2. BWCRT Θ(n log n)
    3. CWCRT Θ(n)
    4. DACRT Θ(n log n)
    5. EBest possible WCRT
    6. FIn Place
    7. GRun space +Θ(n)
    8. HStable
    9. INot Stable
    10. JComparison Sort

Information

Description
A challenging quiz to drill into your head the proper attributes for each sort as covered in COP 4531.
Language
English
Views
82
Rating
No ratings yet
Rate this quiz
Rate this quiz

Feedback

What is it about?

What do you think of the new look?

How do you like it?