You are designing an algorithm to search for a specific value within a sorted array. Which of the following search algorithms would be the most efficient for this task?

a$)$ Linear Search $($iterates through each element$)$

b$)$ Bubble Sort $($repeatedly compares adjacent elements$)$

c$)$ Binary Search $($repeatedly divides the search space in half$)$

d$)$ Depth$-$First Search $($explores all possible paths in a tree$)$

pen$\_$spark