Which of the sequential or binary search algorithms would find the name Kelly in the list the fastest? John, Kelly, Lewis, Maurice, Nathan, Oliver, Pat, Quincy, Roger, Stan, Tom

I'd say sequential also called linear because the list is short.

Explanation:

linear is best for short lists and binary best for long lists.

linear goes through the names one by one

and binary search compresses the searching period by dividing the whole array into two half. but since the list is short linear is the best choice. hope this helps.

maybe when you are listing people names in a job.

i am not 100% sure