TRL_BinarySearch

Requirments

TRL_DataTypes

Definition

Binary search is a searching algorithm that searches for an element in an array of size N with a time complexity of O(log N). It is one of the most optimal algorithms for searching.

features of TRL_BinarySearch

Search Efficiency: Performs searches in O(log N) time,

Supports Multiple Data Types: Works seamlessly with any 1D array containing any data type

function parameters