Joined: 02 Dec 2003 Posts: 151 Location: Tokyo, Japan
Search uses linear search method for searching an element in an array of elements. SEARCH ALL uses binary tree method for searching.
For an array of less than 20 elements SEARCH is efficient but in other case SEARCH ALL is more efficient.
Others please add.
Please give some significant Subject other than Question.
Joined: 06 Jan 2004 Posts: 247 Location: Hyderabad
adding to sandip here is some more info.it may help you.
When performing table look-up operations, SEARCH ALL, a binary search operation, is usually faster than SEARCH, a sequential search operation. However, SEARCH ALL requires the table to be in ascending or descending order by search key, while SEARCH imposes no restrictions on table organization. Also, with SEARCH ALL there should be unique key values in the table. Before using SEARCH ALL, you must pre-sort the table. If the table is not sorted, SEARCH ALL often gives incorrect results.
A binary search (SEARCH ALL) determines a table's size, finds the median table entry, and searches the table in sections, by using compare processes. A sequential search (SEARCH) manipulates the contents of an index to search the table sequentially.
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.