GCSE CS: Searching & Sorting Quiz

Test

Jugadas 21 %Acierto 40 Tiempo medio 01:59

Crear copia

Sobre esta actividad

Test basics of search/sort (bubbles, merge, linear, binary)

Creada por

James Cooper

Reino Unido

Descarga la versión para jugar en papel

Top 10 resultados

Todavía no hay resultados para este juego. ¡Sé el primero en aparecer en el ranking! Inicia sesión para identificarte.

Crea tu propio juego gratis desde nuestro creador de juegos

Compite contra tus amigos para ver quien consigue la mejor puntuación en esta actividad

Crear reto

		%
	Anónimo	%
		%
		%

Imprime tu juego

GCSE CS: Searching & Sorting Quiz


GCSE CS: Searching & Sorting QuizVersión en línea Test basics of search/sort (bubbles, merge, linear, binary) por James Cooper 1 Which algorithm is used to sort by repeatedly swapping adjacent items until the list is sorted? a Bubble sort b Merge sort c Linear search d Binary search 2 Which algorithm splits the list into halves to sort or search? a Linear search b Bubble sort c Binary search d Merge sort 3 Which search method is fastest on a sorted list with random access? a Bubble sort b Binary search c Linear search d Merge sort 4 Which algorithm repeatedly checks the middle element to locate a target in a sorted array? a Binary search b Linear search c Bubble sort d Merge sort 5 Which data operation sorts by combining two sorted halves into a single sorted list? a Binary search b Bubble sort c Linear search d Merge sort 6 Which search is most efficient for an unsorted list of unknown order? a Binary search b Bubble sort c Merge sort d Linear search 7 Which sorting algorithm has the best performance on a nearly sorted array? a Linear search b Binary search c Bubble sort d Merge sort 8 Which algorithm would you choose to search a sorted array with frequent searches? a Binary search b Merge sort c Bubble sort d Linear search Feedback 1 Bubble sort swaps adjacent items to bubble up the largest to the end. 2 Merge sort divides and conquers by merging sorted halves. 3 Binary search halves the search interval each step on a sorted list. 4 Binary search compares with the middle and halves the range. 5 Merge sort recursively sorts halves and merges them. 6 Linear search checks each item until found; no order assumed. 7 In practice, bubble sort can perform well on nearly sorted data. 8 Binary search benefits from the sorted order for fast lookups.

Puedes integrar el juego en un LMS compatible con LTI 1.1 o LTI 1.3 como Canvas, Moodle, o Blackboard. De esta manera podrás guardar las puntuaciones automáticamente en el libro de calificaciones de esa plataforma.

GCSE CS: Searching & Sorting Quiz

Test

Sobre esta actividad

Creada por

Descarga la versión para jugar en papel

Top juegos

Test

Cultura general española

Test

Verbos irregulares en Inglés

Test

Tipos de sintagmas (II)

Test

cuanto sabes de Futbol

Test

Brawl stars preguntas

GCSE CS: Searching & Sorting QuizVersión en línea

por James Cooper

Which algorithm is used to sort by repeatedly swapping adjacent items until the list is sorted?

Which algorithm splits the list into halves to sort or search?

Which search method is fastest on a sorted list with random access?

Which algorithm repeatedly checks the middle element to locate a target in a sorted array?

Which data operation sorts by combining two sorted halves into a single sorted list?

Which search is most efficient for an unsorted list of unknown order?

Which sorting algorithm has the best performance on a nearly sorted array?

Which algorithm would you choose to search a sorted array with frequent searches?

Feedback