What are linear search and binary search — DSA Technical Interview Questions & Answers
What are linear search and binary search
What are linear search and binary search
- What are linear search and binary search is a DSA topic. In plain words you use it for folder on disk in a file explorer. Don’t start with a slogan — start with that picture.
- Smallest example: left < root < right. Type it, run it, and say what you see. If you can do that from memory, you know What are linear search and binary search.
- From the example next to this theory: What are linear search and binary search — binary search halves a sorted array each step — O(log n).
- Trap: unbalanced BST becoming a list. Fix that before you talk about advanced DSA.
- Viva: what is What are linear search and binary search? Then show left < root < right. Then name the trap.
Technical Interview Tip: What is What are linear search and binary search? Show this: left < root < right. Trap: unbalanced BST becoming a list.
Code Examples for What are linear search and binary search
What are linear search and binary search — working example
def binary_search(arr, target):
lo, hi = 0, len(arr) - 1
while lo <= hi:
mid = (lo + hi) // 2
if arr[mid] == target:
return mid
if arr[mid] < target:
lo = mid + 1
else:
hi = mid - 1
return -1
print(binary_search([1, 3, 5, 7, 9], 7))What are linear search and binary search — binary search halves a sorted array each step — O(log n).
How to Explain What are linear search and binary search to an Interviewer
What is What are linear search and binary search?
Used for folder on disk a file explorer Not just the heading
Give one small example of What are linear search and binary search.
left < root < right What are linear search and binary search — binary search halves a sorted array each step — O(log n)
What mistake do beginners make with What are linear search and binary search?
unbalanced BST becoming a list Show the fix
Where do you use What are linear search and binary search?
a file explorer folder on disk