How can the following algorithm be described $($data is an array of primitive type$)?$

int result $=-1$;

while $($x $<$ data.length$)\{$

if $($target $==$ data$[$x$])\{$

result $=$ x;

break;

$\}$

x $+=1$;

$\}$

return result;

Select one:

a$.$

indexOf$($target$)$

b$.$

lastIndexOf$($target$)$

c$.$

sort$($data$)$

d$.$

contains$($target$)$