How does Linear Search work?

A$)$ It compares elements by their values and swaps them

B$)$ It divides the array into two halves and searches recursively

C$)$ It checks each element in the array until a match is found

D$)$ It uses a pivot to locate the desired element

F$)$ It only works on sorted arrays