Flashcards
search algorithms
Cards in this deck (10)
- 1what does a binary search dolook for items in an ordered list
- 2what does the list need to be in at the startorder from lowest to biggest
- 3what is the first step in the binary searchto find the middle item in the list. if the item you are looking for is there then stop
- 4what is the second stepif the item you are looking for is smaller than the middle then remove the right side, if the item you are looking for is bigger than the middle then remove the left half
- 5what is the third stepto repeat the steps till the item is found
- 6what does a linear search docheck each items on a list, individually.
- 7what is the first stepchecks the first item in the list, if the item is what it is looking for the search stops
- 8what is the second stepthe step repeats and keeps checking till the item is found.
- 9state 2 advantages of linear searchsimpler and more efficient. linear search can be used on any type of list.
- 10state 2 advantage of binary searchit is very quick and can complete long lists quicker than linear search
Information
- Description
- Year 10 Computing (section 1 - algorithms) Flashcards on search algorithms, created by Nibodh Rijal on 03/12/2020.
- Created by
- Nibodh Rijal
- Views
- 0
- Rating