COBOL Search All
Search is binary, so the table must be in sorted condition. As many as twelve keys you can give in SEARCH ALL. The total size of all the keys should not exceed 256 bytes.
According to computerhope.com – A binary search, also known as a half-interval search, is an algorithm used in computer science to locate a specified value ( key) within an array. For the search to be binary, the array must be sorted in either ascending or descending order.
You must be logged in to post a comment.