CS 3.4. (ALEVEL) -Searching algorithms

Question 1

Linear search

Answer 1

• conducted on any unordered list
• time complexity of O(N)
• simple to code
  -each item is compared sequentially to target

Question 2

Binary search

Answer 2

-used on any ordered list
-looks at midpoint and determines if target is higher and lower, and halves the list until it finds it
- time complexity of O(logN) because list is halved each search

Question 3

Binary Tree search

Answer 3

• same as binary search but on a binary tree starting at root node and either going left or right of tree
• time complexity of O(logN)