Write an algorithm that searches a sorted list of n items by dividing it into three sublists of almost n/3 items. This algorithm finds the sublist that might contain the given item and divides it into three smaller sublists of almost equal size. The algorithm repeats this process until it finds the item or concludes that the item is not in the list. Find and solve recurrence.

Answer rating: 100% (QA)

Algorithm indexValue SearchindexLow indexHigh value dec... View the full answer