1) what is the bubble sort method? a) a simple algorithm that sorts a list by transferring one element at a time b) a simple algorithm that sorts the list two elements at a time c) a simple algorithm that swaps adjacent pairs in the list d) a complex algorithm that compares the first and last in the list  2) what is the worst case of a linear search? a) you find the item on the first try  b) you do not find the item you are looking for  c) you find the item on your last try  d) you find the item on the 1243th try  3) what is the best case of a linear search? a) you find the item on the first try b) you do not find the item you are looking for c) you find the item on your last try d) you find the item on the 1243th try

Algorithms assesment revision

Afdrukken
Embedden

Scorebord

Visuele stijl

Opties

Template wisselen

Automatisch opgeslagen activiteit "" herstellen?