The $q,$ search algorithm searches a list for a given item, starting with the first element and continues to compare the item with the other elements in the list until either the item is found or the list has no more elements.

a$.$ relative

b$.$ dynamic

c$.$ sequential

d$.$ selection