It's a divide-and-conquer search algorithm that divides the array into three parts and performs the search in one of the two sub-parts depending on the value of the desired item.
Join The Clean Code Studio Newsletter
It's a divide-and-conquer search algorithm that divides the array into three parts and performs the search in one of the two sub-parts depending on the value of the desired item.