O GoConqr está de visual novo! Conte para nós o que você achou.

Registre-se grátis

Quiz

Sorting Algorithms

Talor Gannaway 10 perguntas

Fazer o quiz

Perguntas do 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

Informações

Descrição
A challenging quiz to drill into your head the proper attributes for each sort as covered in COP 4531.
Idioma
English
Visualizações
82
Etiquetas
cop4531 sort
Avaliação
Ainda sem avaliações
Avalie este quiz
Avalie este quiz

Fale Conosco

Sobre o que é sua mensagem?

O que você acha do novo visual?

Você gostou?