Merge Sort Questionnaire

1. 1What is the first step a merge sort takes when executing a sort?

   

   1. ASplits the array in half.
   2. BMerge all elements in the array.
   3. COrders it all in ascending order.
   4. DSplits all elements in an array.
2. 2A merge sort can only be done if all items are in ascending or descending order.

   1. AVerdadero
   2. BFalso
3. 3After a split, what happens when the algorithm merges them together?

   

   1. AIt merges them all at once in the correct order.
   2. BIt merges them all individually.
   3. CIt merges them all individually, then adds the pairs together and continues merging.
   4. DIt splits them in reverse, adding them back up without sorting.
4. 4Which of these is NOT an advantage of Merge Sort.

   1. AMuch more efficient than a bubble sort.
   2. BUses up more memory.
   3. CConsistent run time regardless of how ordered the items in the list are.
5. 5Which of these are NOT a disadvantage of Merge Sort?

   1. AEven if the list is already sorted, it still goes through the whole splitting and merging process.
   2. BIt is slower than other algorithms with small lists.
   3. CQuicker than bubble sort in general.
6. 6Which programming languages are optimal for a Merge Sort?

   1. AJava
   2. BPython
   3. CC++
   4. DPerl
   5. EScala
   6. FSQL
7. 7True or false, it is easier to merge two ordered lists than two unordered lists.

   1. AVerdadero
   2. BFalso

Descripción

Year 7 Computing Test sobre Merge Sort Questionnaire , creado por Cole Sutton el 21/01/2022.

Autor

Cole Sutton

Idioma

English

Visitas

6

Etiquetas

computingyear 7

Valoración

Aún sin valoraciones

Valora este test

Valora este test

Más sobre Searching and Sorting Algorithms