2.4.6 How standard searching and sorting algorithms work, and the benefits and drawbacks

Question 1

State:

Another name for linear search

Answer 1

Serial search

Question 2

State:

How a linear search functions

Answer 2

Starting at the beginning of the dataset, each value is examined until a match is made

Question 3

Fill The Blank:

Binary Search is a ……. search algorithm and works on the principle of ………… and ………….

Answer 3

Fast, Divide, Conquer

Question 4

State:

What is one requirement of Binary Search

Answer 4

Data is in a sorted format

Question 5

Fill The Blank:

The search ……….. is repeatedly …………. in half. If the middle value is greater than the value of the search then the interval is changed to the ……….. half of the array. If the middle value is lower than the value of the search then the interval is changed to the ………. half of the array.

This is ………….. until the value is found or the interval is …………

Steps of binary search

Answer 5

Interval, Divided, Lower, Upper, Repeated, Empty

Question 6

State:

3 advantages of using linear search

Answer 6

3 of:
* List does not have to be ordered
* Fast performance when searching small to medium lsits
* Because list is not sorted, elements can be added and deleted - if needed to be sorted re-ordering would be needed
* Linear search is simpler and easier to implement
* Can be used on any type of data

Question 7

State:

1 advantage of binary search

Answer 7

Faster performance than linear search because the data being searched is halfed at each stage

Question 8

State:

1 disadvantage of linear search

Answer 8

Very slow when searching lists with large quantitiese of data items

Question 9

State:

1 disadvantage of binary search

Answer 9

Data must be ordered/sorted first