COBOL SEARCH ALL: Here’s Why Table Sorting Needed

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.

COBOL SEARCH ALL: Here's Why Table Sorting Needed
Photo by Marta Dzedyshko on Pexels.com

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.

Also read

Author: Srini

Experienced software developer. Skills in Development, Coding, Testing and Debugging. Good Data analytic skills (Data Warehousing and BI). Also skills in Mainframe.