Binary Search - A Different Perspective | Python Algorithms

Video quality	The size	Download

Информация о Binary Search - A Different Perspective | Python Algorithms

Название	:	Binary Search - A Different Perspective \| Python Algorithms
Продолжительность	:	8.56
Дата публикации	:
Просмотров	:	82 rb

Very, very useful Thank you
Comment from : Abhishek

Fantastic
Comment from : Asif Saif Uddin

bisect
Comment from : norude

설명이 진짜 좋아 고맙다^^
Comment from : Jullien

2 words for you, my friendbrThank you!
Comment from : Will

Thankyou for this brilliant way of explaination and you also helped to look a problem with altogether new angle
Comment from : Kashif Ahmed

This is so helpful! I like your reasoning Everything is well justified
Comment from : Eric Young

Wow
Comment from : Gaming High Priest

this is brilliant
Comment from : A14

thank you
Comment from : mAssbagflyer

It's still difficult to wrap my head around genearting Binary Search, but this is the closest I have come to deeply understanding the concept Thanks
Comment from : Feerass E

I think i am bit Late to your Channel but its better late than never Someone pointed me in Medium to your channel and he wrote that this vidio changed his way of think in Binary Search I think he was right Its really intuitive way of teaching
Comment from : jhon sen

Thank you very much!
Comment from : Happy Hacker

thankyou so much for this great explanation
Comment from : Josh T

I recently used binomial search for finding the cutoff value that minimizes the distance between specificity and sensitivity of a model The brute force method, that calculated the values at 100k different points, took about a minute to run, binsearch needs 3 seconds
Comment from : Tony Young

And what if the array doesn’t have to be an integer?
Comment from : Angel33Demon666

Great video!
Comment from : ExpansiveGymnast10

I'm sure this is good info but without walking through the algo with a few examples, I find it very hard to follow along
Comment from : deemon710

This helped me make an algorithm to solve a similar problem!brThanks, James
Comment from : Periareion

Wait im confused when he said False value and True value shouldnt it be the reverse
Comment from : Hamood Habibi

I'm preparing for a coding interview and think that this is a great explanation It's a lot simpler than many of the implementations out there online and a lot more intuitive as well
Comment from : Suhao Huang

Left bisect concept is used to find Minimum time,Minimum Height questions using binary search
Comment from : Shivang Yadav

Huh When i tried writing a binary search i only kept track of the "middle" and tried moving that in the appropriate direction It got too wonky to keep track of how big the next step should be and what to do with odd-number intervals, so i never got it to work This makes a lot more sense
Comment from : Volbla

Extra points for type hinting
Comment from : Anacleta Ludovica

Wait what?? Python can handle arbitrary large integers?? How does that work exactly? I've never heard that before I looked on Google but could not find an explanation of how that works I just found things like "it is possible to handle larger values as memory is available" but that's not much of an explanation
Comment from : Joffrey Bluthé

ru nick white's brother
Comment from : Mr Prime

Great explanation!
Comment from : Pieter van Oostrum

Great I cant believe the number of times I have seen people make this error occur all because they wanted to play doctor for shame
Comment from : botbottod

What I love about this channel is that every video gives me at least one insight about the topic
Comment from : Doodle1283

In Python, binary search is easy Don't get me started on the numerous single-linked lists in C programs They cannot be easily indexed and code containing them is riddled with linear search algorithms
Comment from : Erwin Mulder

how about an video on "stupid ways to do something in python"
Comment from : #NCB

Thanks a lot, James! Your explanations are awesome One of the best Python related channels on YouTube Subscribed with pleasure
Comment from : Alexander Knyazev

At 7:01 you add an assert statement Worth noting that this is only executed when running in non optimized mode A production ready implementation should rather raise a ValueError
Comment from : Redacto Boggy

"slap like button odd number of times" very precise
Comment from : Ruslan Kovtun

5:48 Can you please explain why fits false value couldn't be later than mid ?
Comment from : Afzal Hussain

this dude FUCKS
Comment from : Diego Augusto

Please, I need to know what font that is
Comment from : Moonkis

github repo for the code? :)
Comment from : heads-up

Excellent Video!
Comment from : Hamed

This is a crystal clear explanation! thanks a lot I can't help subscribe this channel haha
Comment from : HYUN-IL Park

I lead algorithmic masterclasses for high school youth and although I personally use a different implementation I must say - this video is very high quality! I am very impressedbrI was ALMOST convinced to start using this implementation, but you aren't getting me this time!
Comment from : Maurycyt

This guy is like the Nick White that isn't a poser
Comment from : Roger

I'd argue that the true/false property is still "sorting", just using a different sort function Perhaps sorting by that function may perform better in some scenarios though? An interesting idea
Comment from : Berylliosis

i found this right after successfully implementing basically that exact strategy at 4:40 to find the location of a cell in a 2d array it is really really satisfying to implement even a simple search like this
Comment from : Ryan

Very useful, thanks!
Comment from : Aditya Sriram

It's funny how instead of clicking 'like' once, I click it like 3 times now for these videos
Comment from : Alister222222

@mCoding around 3:12 you say "I think that far too often, binary search is taught solely as an algorithm that works on sorted arrays But, the array being sorted is not actually the property that we're using here"brbrThat's a pretty misleading statement I think it does more harm than good, as you're confusing "the algorithm" with "the algorithm's behaviour on a specific input" Yes, strictly speaking, the property we're using is: "only the elements that we visit need to be sorted" But exactly which elements you visit depends on the input In order for the algorithm to work for ALL inputs, the WHOLE array MUST be sorted Try finding an 8 in your second, no longer sorted, array You'll land on the 9 instead
Comment from : Uncle Sheo

Hey, how about discussing the square sum problem next? I find this one quite interesting
Comment from : Michaël Malter

Shouldn't you add a check for if the value doesn't exist in the array?brShould just be that the loop ends at log2(len(arr)) iterations
Comment from : Monochrome Art

Would you mind sharing what colour scheme you're using in your editor?
Comment from : HousedHorse

I can see from the level of articulation that you must have some mathematical background You covered well all of the ifs and buts one raises when writing any algorithm, and actually gave a rigid proof for the validity of the presented bisection method! Hopefully this video will be used as "the" tutorial on bisection search in the future
Comment from : Sampo Paukkonen

The abstraction is gold
Comment from : 見象

My brain understand it better when i think of the if condition as br x > arr[mid], idk why but thank you for this vid
Comment from : James

I remember struggling when I realized I wasn't sure how missing entries should be handled
Comment from : HansLemurson

This is awesome, thank you for making this video
Comment from : Wayne Qwele

this was a crystal clear presentation and thanks for step by step writing the code please do more videos like these!
Comment from : Emad Gohari

Great content brPS: This guy doesn't blink
Comment from : rachit rihar

Great vid! Knowing when to use slice indices vs element indices is important for many problems involving arrays
Comment from : Asad-ullah Khan

Fantastic content as always
Comment from : MrSteini124

great way to spend 4:20, thank you my bro
Comment from : Michael Flynn

Absolute wonderful video I'm high as fuck and still understood everything very good
Comment from : Azratosh

new mic is awesome!
Comment from : SAPITO

Not surprised that Jared Kushner is a fan of divide and conquer
Comment from : haach76

Thanks a lot for making this video
Comment from : julian ____

Please make more videos on Algorithms and Data Structures!!!brThanks for this video❤️
Comment from : Malay Parmar

type hinting in python? yes, no? why/why not?
Comment from : Sctiv Feconic

I'm so happy that I found this channel I can watch something that is interesting and actually important for my studies
Comment from : Simon

I appreciate the depth with which you covered this topic It shows how to view the algorithm from a perspective other than just “memorize it” Thank you!
Comment from : Colin Valentini