Algorithms

Question 1

Linear Search Definition

Answer 1

Works by comparing the search item with the first value and then comparing the search item with the second value. This process is repeated until either the end of the data set is reached or the search item is found

Question 2

Linear Search Advantages

Answer 2

• Can perform fast searches of small data sets
• Not affected by insertions and deletions as the linear search doesn’t require the list to be sorted

Question 3

Linear Search Disadvantages

Answer 3

• Inefficient for large data sets

Question 4

Linear Search Suitability

Answer 4

• Small data set
• Data set isn’t sorted

Question 5

Binary Search Definition

Answer 5

Works by starting at the middle item of the data set and repeatedly dividing the list in half until either the item is found pr the entire data set is searched

Precondition - Data set must be sorted first

Question 6

Binary Search Advantages

Answer 6

• Efficiently searches large data sets

Question 7

Binary Search Suitability

Answer 7

• Large data sets

Question 8

Binary Search Time Complexity

Answer 8

Best - O(1)
Average - O(n)
Worst - O(n)

Question 9

Linear Search Time Complexity

Answer 9

Best - O(1)
Average - O(log n)
Worst - O(log n)