GCSE CS: Searching & Sorting Quiz

Test

Parties jouées 21 %Précision 40 Temps moyen 01:59

Créer une copie

À propos de cette activité

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

Créé par

James Cooper

United Kingdom

Téléchargez la version pour jouer sur papier

Top 10 résultats

Il n'y a toujours pas de résultats pour ce jeu. Soyez le premier à apparaître dans le classement! Connectez-vous pour vous identifier.

Créez votre propre jeu gratuite à partir de notre créateur de jeu

Affrontez vos amis pour voir qui obtient le meilleur score dans ce jeu

Créer un défi

		%
	Anonyme	%
		%
		%

Imprimez votre jeu

GCSE CS: Searching & Sorting Quiz


GCSE CS: Searching & Sorting QuizVersion en ligne Test basics of search/sort (bubbles, merge, linear, binary) par 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.

Vous pouvez intégrer le jeu dans un LMS compatible avec LTI 1.1 ou LTI 1.3 comme Canvas, Moodle ou Blackboard. Les scores seront ainsi automatiquement enregistrés dans le carnet de notes de la plateforme.

GCSE CS: Searching & Sorting Quiz

Test

À propos de cette activité

Créé par

Téléchargez la version pour jouer sur papier

Top Jeux

Test

Tissues - Practice Quiz

Test

Spanish Alphabet Listening

Test

Photosynthesis vs Cellular Respiration - Practice Quiz

Test

UPS 5 Seeing Habits Quiz

Test

Practice Quiz - Punnett Square, Variation, and Mutations

GCSE CS: Searching & Sorting QuizVersion en ligne

par 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