What Is The Difference Between A Binary Search And A Sequential Search What Are The Pertinent COBOL
In a binary search, the table element key values must be in ascending or descending sequence. The table is ?halved? to search for equal to, greater than or less than conditions until the element is found. In a sequential search, the table is searched from top to bottom, so (ironically) the elements do not have to be in a specific sequence. The binary search is much faster for larger tables, while sequential works well with smaller ones. SEARCH ALL is used for binary searches; SEARCH for sequential.
2009-2016 downloadmela.com. All rights reserved.