Linear search, Checks each item in a list one by one until it finds the target., Starts at the first item of the list, Items do not need to be in order, Tends to be less efficient, Binary search, Items must be sorted, Begins by finding the middle item in the list, If item is not find checks if the target is greater than or less than the currently checked item, Generally more efficient, particularly on larger lists

Linear & binary search

par
Imprimer
Incorporer

Classement

Style visuel

Options

IA Améliorée : Cette activité contient du contenu généré par l’IA. Pour en savoir plus.

Changer de modèle

Restauration auto-sauvegardé :  ?