Binary Search in Python: Python's Bisect Method

Publié le: 11 juillet 2018
sur la chaîne: LucidProgramming

14,802

263

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

Sur cette page du site, vous pouvez voir la vidéo en ligne Binary Search in Python: Python's Bisect Method durée heure minute seconde en bonne qualité , qui a été Téléchargé par l'utilisateur LucidProgramming 11 juillet 2018, Partagez le lien avec vos amis et connaissances, sur youtube cette vidéo a déjà été regardée 14,802 fois et il a aimé 263 téléspectateurs. Bon visionnage!

181