Python LanguageSearching

Download Python Language for free

Remarks

All searching algorithms on iterables containing n elements have O(n) complexity. Only specialized algorithms like bisect.bisect_left() can be faster with O(log(n)) complexity.

Related Examples

Searching for an element