4030032
Beschreibung
Mindmap von Charlie Downham, aktualisiert more than 1 year ago
|
Erstellt von Charlie Downham
vor etwa 9 Jahre
|
|
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.
Medienanhänge
Möchten Sie kostenlos Ihre eigenen Mindmaps mit GoConqr erstellen? Mehr erfahren.