In the class, we discuss binary search. One idea is to divide the given array into three parts and then use divide and conquer to solve it. Can you work out the pseudo code and then analyze the time complexity? Any advantages of this algorithm over the binary search?
Can't change a rubric once you've started using it.