Example CpxVector binarySearch 008
|
Notes and Hints Complex numbers are sorted using their real part first and then using the
imaginary part to break ties. If several searches are routinely made on a large array, consider sorting
the array to reduce the time of the searches. If the array is not sorted in ascending order, the search may fail even if
the vector contains a matching element. If the vector holds two or more matching
elements, the index returned may be the index of any one of the matching elements.
Returns:
Returns:
Returns:
Returns:
Here are examples of the binarySearch function at work.
Here is the link to the current function used in this example.
Here are a number of links to other related functions.
insert(#void) | binaryInsert(#void) | uniqueInsert(#void) | sort(#void) |
Here are the links to the data types of the arguments used in this example. Here are a number of links to examples having similar argument types.
CpxVector
Integer
Analytic Information Server (AIS)AIS Component Systems
|