In Python, how do you find the index of the first value greater than a threshold in a sorted list?

by

Have a look at bisect.

import bisect

l = [1, 4, 9, 16, 25, 36, 49, 64, 81, 100]

bisect.bisect(l, 55) # returns 7

Compare it with linear search:

timeit bisect.bisect(l, 55)
# 375ns


timeit next((i for i,n in enumerate(l) if n > 55), len(l))
# 2.24us


timeit next((l.index(n) for n in l if n > 55), len(l))
# 1.93us

More Related Contents:

  1. How to implement a binary tree?
  2. python algorithm, find duplicates in list [closed]
  3. How can we develop an algorithm to solve a problem of DP [closed]
  4. Python: Justifying NumPy array
  5. Python list of dictionaries search
  6. What is the difference between re.search and re.match?
  7. Is there a short contains function for lists?
  8. Quicksort with Python
  9. Generate all permutations of a list without adjacent equal elements
  10. how to split an iterable in constant-size chunks
  11. How do I generate all permutations of a list?
  12. Modular multiplicative inverse function in Python
  13. How to trace the path in a Breadth-First Search?
  14. Rotate image and crop out black borders
  15. Gauss-Legendre Algorithm in python
  16. How to invert a permutation array in numpy
  17. Subset sum Problem
  18. Adjacency List and Adjacency Matrix in Python
  19. How to extract information between two unique words in a large text file
  20. Fastest way to search a list in python
  21. What algorithm does Python’s built-in sort() method use?
  22. How to split an iterable into two lists with alternating elements
  23. How can I match up permutations of a long list with a shorter list (according to the length of the shorter list)? [duplicate]
  24. Python: maximum recursion depth exceeded while calling a Python object
  25. How do I fix wrongly nested / unclosed HTML tags?
  26. Python pi calculation?
  27. Find starting and ending indices of sublist in list
  28. Sieve of Eratosthenes – Primes between X and N
  29. What is this odd sorting algorithm?
  30. counting combinations and permutations efficiently

Leave a Comment