Posted On: Feb 22, 2018
In binary search, the table is divided into two halves and the key values in the table will be arranged in ascending or descending order. When the table is split into two, it becomes easier to search for equal to, greater than or less than conditions until the element is found in the table. The binary search is preferred for more tables and SEARCH ALL is used for binary searching.
In sequential search, the elements are in random positions because they are searched from top to bottom and not in a specific direction. As such they don’t follow a specific sequence. A sequential search is conducted for a lesser number of tables and SEARCH command is used here.
Never Miss an Articles from us.
COBOL is a dominant programing language that has aided business users since few decades. Following are the features of..