Python

Apply the binary search algorithm for the following test case:

Input:

$\{\text{'}$cards$\text{'}$: $[8,8,6,6,6,6,6,6,3,2,2,2,0,0,0],$ 'query': $6\}$

Expected output: $2$

Hint:

We did locate a $6$ in the array; it's just that it wasn't the first $6.$ As you can guess, this is because

we don't go over indices in a linear order in binary search.

How do we fix it$?$

When we find that cards$[$mid$]$ is equal to query, we need to check whether it is the first

occurrence of query in the list, i$.$e$.,$ the number that comes before it$.$

To simplify it$,$ we'll define a helper function called test$\_$location, which will take the list cards,

the query, and the mid as inputs.