FIRST FOLLOW

FIRST(A) is defined as a set of terminals that begin the strings defined by A. If A derives ‘Є’ then ‘Є’ is in FIRST(A).FOLLOW(A) for a non-terminal A is defined as a set of terminals that can appear on the right side of A in the sentential form. FOLLOW is only applied for non-terminals. The FOLLOW of start symbol always contain the end marks ‘$’.

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 »

Ternary Search

Ternary search is a searching algorithm that searches an element in a sorted array. Algorithm Ternary search works similar to Binary search. The only difference is instead of dividing the array into 2 parts, the array is divided into three parts and 2 parts are rejected on each iteration. That is, the array is reduced …

Ternary Search Read More »