Video není dostupné.
Omlouváme se.
BS-1. Binary Search Introduction | Real Life Example | Iterative | Recursive | Overflow Cases
Vložit
- čas přidán 27. 07. 2024
- Problem Link: bit.ly/41Tk8ql
Notes/C++/Java/Python codes: takeuforward.org/data-structu...
Full Course: bit.ly/tufA2ZYt
You can follow me across social media, all my handles are below:
Linkedin/Instagram/Telegram: linktr.ee/takeUforward
0:00 Introduction
1:27 Real Life Example
5:18 Coding Problem Example
13:22 Iterative Binary Search Code
17:15 Recursive Binary Search Code
26:18 Time Complexity Analysis
29:12 Overflow Case
32:46 Outro
Please comment understood and give us a like if you got everything :)
Sir if possible can you please make a series on sliding windows ,2 pointers after this
Salute to your dedication sir
@@sabyasachibiswal7790 as he is following the a2z sheet so i think next will be on string. Sliding window is on step 10 so it will take time i think.
now 2023 c++ , pls dont skip java , again saying refactor entire sries java , tell me bench how many projects u get C++
all people now doing dsa java foregt C++ in next 2 years recession
This guy does amazing work. If I can grasp it, anyone can follow this playlist. thanks man.
bhoat sahi bro masta kaam kar raha hai tu .jo loag course afford nahi kar shakte unko free maine sikha raha .India need people like you
"Raj" may be not in dictionary, but one thing is sure that "Raj" is in our heart :)
☺☺
Loved the way how you always keep your promise and deliver premium quality content ! Hats off to the dedication man❤❤❤❤
Understood it very well
And the OVERFLOW part was awesome
Keep up the good work Striver
Although you have promised us 30+ videos but no worries as we know how busy you are
Once again thanks for this amazing series
Bro dropped whole" binary search" album overnight 😂😂😂
😂😂😂😂 sahi bola..bhaiya is on fire😂
Sorry pura nai ho paaya as website ka kaam chal raha tha, pura aa jaega 5/6 din me
@@takeUforward bhya aap itna v kr rhe houtna hi bhoot h ❤
Bcz he promised and he never forget his promises that why we love him ❤
@@takeUforward arey bhai mai tho mazak kar Raha tha ....u r doing next level hardwork for students.... always thankful to you🙏
Understood! Amazing explanation as always, thank you very very much for your effort!!
26:03 Just a small correction at line 6. It should be mid - 1 instead of high - 1. I checked in striver's website and it is correct there. Also, Excellent explanation as always.
Amazing explaination sir ...first time i watch your video ...clear the binary search..
Hats OFF to you bhaiyaa for providing us with much of premium quality content( Don't have words to say for your efforts)
Thank you so much
Hats OFF to you Man.Thanks for gifting us an Amazing Playlist Like DP.❤❤❤❤❤❤
Striver the way you teach is exceptional 👏 .
Thank you so much for this wonderful video session and this is the first time i have clearly understood about the concept and it is very clear. Thank you
Wow the best explaination!! Thanks Striver.
Hats OFF to you Man for making such Content
striver you are very loyal person because you told this video will be post jun 1st .Thank you for the Video for us. Keep doing .
Your dedication is commendable Striver!!! Great job dude!!
Understood .... thank u so much bhaiya ...its the best i have ever seen ...salaam rocky bhai
great BS Content i had watched all conceptual Dout's are clear!!
Striver bhaiya ka dedication!!!!! Thanks a lot
understood i was new to lb, ub floor ,ceil ,i learnt them here .Thanks
maja aagaya bhaiya wait kar rahe the bahut din se
Thank you striver for the amazing videos.
Understood. Crystal clear.
Understood it very well
THANK YOU SO MUCH SIR
LOVED ITACHI NOTEBOOK :)
Understood, thanks striver for this amazing video. Really enjoing your lecture videos.
You are just amazing. Please keep this good work going
Thankyou thank you was waiting for this eagerly.
0:00 Introduction
1:27 Real Life Example
5:18 Coding Problem Example
13:22 Iterative Binary Search Code
17:15 Recursive Binary Search Code
26:18 Time Complexity Analysis
29:12 Overflow Case
32:46 Outro
Thank you so much
@@takeUforward Welcome ❤
@@takeUforward completed same day
@@takeUforward bhaiya ek question hai ......at the end of video aapne kaha ...INT MAX + INT MAX ...which is 2*INT MAX.......bhaiya kya yeh kisi variable me store hoga...then divide by 2 hoga........
agr aisa hoga tabhi na bhaiya overflow condition aayega....isem thora sa confusion hai bhaiya...please clear kar dijiye na bhaiya
@@sujitrishikumar8621INT MAX + INT MAX .... Which is 2*INT MAX , dono variable int type ke hai to int hi output aayega esa compiler samjhta hai, and int type ka memory block provide krta hai output store ke liye, but jb two int max ko add krege to vo int memory block mai store nhi ho payega jisse overflow condition aayegi ,
And variable mai store nhi ho raha hai , jb program ram mai aata hai run krne ke liye tabhi program ko memory milti hai , kitni memory lgne wali hai program ko or kaha lgne wali hai ye compile time pr decide ho jata hai
Waiting for the solution of Minimizing the maximum distance to gas station. Amazing series and thanks for the signIn / signUp functionality on the site really solved my problem
awesome videos, best dsa videos ever
Salute to your dedication
Thanks bhaiya for all the hard work that you have put, now I am going to watch it😁
crystal clear explaination✨✨✨✨
Salute for ur dedication...
Thanks you Striver bhaiya You made it 🙌🙌 🎉
Good understanding with TC
Awesome thank You Vikram
Finally worth waiting
Thanks bhaiya bhot time se intezar tha ❤❤❤
that's a great job bro. i like your every video after watching and submit question on leetcode😊😊 .
understood everything thanks striver
Well explained!
great playlist
Awesome bhaiya.................
Understood Bhaiya!
There was a mistake in your recursive code while submitting on Coding Ninjas, in the else statement you have written bs(nums,low,high-1,target) instead of bs(nums,low,mid-1,target), so it won't be O(logn) time complexity.
Understood, thank you.
striver bhaiya Always on fire🔥🔥🔥🔥🔥🔥
Great video❤
Wow 😍 great explanation Striver 👏
Understood ❤
amazing bhaiya...
example was excellent.
This is the best Binary Search explanation I have ever come across, Love from a lost cs soul
Why sound is not there?
you are amazing..........
Please @takeuforward
Make such more playlist on every topic please
Thank you Striver😇
Understood Sir🙇♂🙏✨💖
Understood✅🔥🔥
Thank you so much!!
Good explanation
First i like button , then i watch ❤
very good lecture
Thank you so much :)
Understood !! 😎😎
Thank you❤❤
@takeUforward Hi Raj, shouldn't we also add a condition to check if arr[low] or arr[high] is equal to target. just to save some iterations or stack calls, i know the time complexity would still be log n, but is it advisable to add such optimizations or not ?
bruhh you're goated🐐
UNDERSTOOD
Thank you !!!
I completed the Binary search questions on my own, but I'm having a lot of trouble with the String problems.
Underdstood
thank you so much bhaiya
Awesome
understood!!
understood everything
outstanding
God level🛐
Thank You
completed first vide.
Understood!!!
understood🤩
Understood!
Please give us Sliding Window Playlist . It is very very important and it is not available anywhere.
u can also see for the aditya verma for sliding window ...its also good
thank u so much
understood!
understood ;)
Understood.
Striver sir jo bolte h vo kr k dikhate h , thanks ❤❤
Bhaiya binary search ko too chamka diye hoo💥
00:07 Binary search is a searching algorithm in a limited search space.
02:13 Binary search is a search algorithm applicable in a sorted area.
06:36 Binary search helps to reduce time complexity in searching.
08:37 Binary search trims down the search space by splitting it into halves.
12:59 Binary search works by dividing the search space between low and high and narrowing it down until the element is found or the search space is exhausted.
15:03 Binary Search is a simple and efficient searching algorithm.
19:01 Binary search is a recursive algorithm that repeatedly halves a sorted array to find an element.
20:50 Performing binary search using recursion and base case handling
24:39 The video explains how recursion works in binary search.
26:27 Binary search reduces the search space by half in each step.
30:27 Binary search can cause overflow when the search space becomes small and the low value reaches the maximum integer value.
32:35 Binary search Overflow case explained
understand😍💪
Understood :)
Thanks bhaiya
great
GOAT 🐐 of DSA