Binary Search in Python: Python's Bisect Method

Published: 11 July 2018
on channel: 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

On this page of the site you can watch the video online Binary Search in Python: Python's Bisect Method with a duration of hours minute second in good quality, which was uploaded by the user LucidProgramming 11 July 2018, share the link with friends and acquaintances, this video has already been watched 14,802 times on youtube and it was liked by 263 viewers. Enjoy your viewing!