4030032
Descripción
Mapa Mental por Charlie Downham, actualizado hace más de 1 año
|
Creado por Charlie Downham
hace alrededor de 10 años
|
|
Searching Algorithms
- Linear searching
- A linearsearch strts at one end of data collection, Working its way to the other, Examining each
data item in the collection order
- Advantages
- The only option for
searching unsortes data.
- The only option for
searching unsortes data.
- Disadvantages
- Would take a long time to search large
data structure
- Would take a long time to search large
data structure
- A linearsearch strts at one end of data collection, Working its way to the other, Examining each
data item in the collection order
- Binary search
- A linear search becomes more time-consuming as the data structre comes larger.It is a much
quicker algorithm wich only works if Data is sorted.
- Advantages
- Far faster and more efficent than a linear search
- Far faster and more efficent than a linear search
- Disadvantages
- Requires data to be sorted,
If the data is not sorted the
Binary would not work.
- Requires data to be sorted,
If the data is not sorted the
Binary would not work.
- A linear search becomes more time-consuming as the data structre comes larger.It is a much
quicker algorithm wich only works if Data is sorted.
Recursos multimedia adjuntos
¿Quieres crear tus propios Mapas Mentales gratis con GoConqr? Más información.