Fundamentals of algorithms- module 2) Searching Flashcards
1
Q
What is searching?
A
Common task for an algorithm.
2
Q
What is an example of searching?
A
1: Phone searches for a signal.
2: Computer searches for an internet link.
3
Q
What are the 2 main types of search algorithm?
A
Binary search.
Linear search.
4
Q
What is a binary search?
A
Chooses the middle value in a sorted array, then works out whether the value sort is er than the middle value. Then it splits the array again and repeats the check.
5
Q
What is a linear search (also known as brute-force search)?
A
In linear search computer searches from 1st item in list to last item in list, 1 by 1, until sought item found.
6
Q
When should you use a linear search?
A
When data searched too small, or when data so frequently ammended that sorting the list is a waste of time.
