Fichas
searchig algorithms flash cards
Fichas del conjunto (7)
- 1Which search is quicker? a)Linear b)BinaryBinary
To search a 1 million long list, it would take at most 20 itterations to search it with binary search.
It could take 1 million with linear - 2What must a data set be in order to use a binary searchSorted into order. If it's not in order, it will not work.
- 3What search must you use to search non-sorted dataLinear search
(alternatively, quick sort the data and use binary search) - 4—Linear search
- 5—Binary Search
- 6—Breadth-first
- 7—Depth-first
Información
- Descripción
- GCSE (Problem solving) Computer Science Fichas sobre searchig algorithms flash cards, creado por S F el 06/11/2015.
- Creado por
- S F · nov 2015
- Actualizado
- 9 nov 2016
- Visitas
- 0
- Valoración