## Why Binary Search is Preferred over Ternary Search?

Binary search and Ternary search algorithms are used to search an element in a sorted array. Binary search reduces the array by 1/2 on each iteration whereas Ternary search reduced array size by 1/3 on each iteration. The Time complexity of Binary Search is log2(N).The Time complexity of Ternary Search is log3(N). Ternary search should …

Why Binary Search is Preferred over Ternary Search? Read More »