Binary Search in Python: Python's Bisect Method
In this video, we will be writing a function that takes an array of sorted integers and a key and returns the index of the first occurrence of that key from the array.
For example, for the array:
[-14, -10, 2, 108, 108, 243, 285, 285, 285, 401]
with target = 108, the algorithm would return 3, as the first occurrence of 108 in the above array is located at index 3.
This video is one part of the Binary Search playlist on my channel. For more videos on binary search and how to apply it to various problems, check out the other videos:
• Binary Search
The software written in this video is available at:
https://github.com/vprusso/youtube_tu...
Do you like the development environment I'm using in this video? It's a customized version of vim that's enhanced for Python development. If you want to see how I set up my vim, I have a series on this here:
http://bit.ly/lp_vim
If you've found this video helpful and want to stay up-to-date with the latest videos posted on this channel, please subscribe:
http://bit.ly/lp_subscribe
In questa pagina del sito puoi guardare il video online Binary Search in Python: Python's Bisect Method della durata di ore minuti seconda in buona qualità , che l'utente ha caricato LucidProgramming 11 luglio 2018, condividi il link con amici e conoscenti, su youtube questo video è già stato visto 14,802 volte e gli è piaciuto 263 spettatori. Buona visione!
