Binary Search Algorithm C++ Code in Data Structures | Part -2 | DSA

[@SimpleSnippets]

Hey Guys, if you want more such tech educational videos on this channel then please support me by subscribing to this channel & also share it with your friends as it helps me create more content just for you ✌

[@Shivani-ss6ks]

Please, do complete the whole series.. it's a feast for hungry people who actually want to learn ..

[@SimpleSnippets]

Hehe will try. However these videos are very difficult to make at a faster pace. Hope you understand ✌️

[@DemX_HaX]

I love how you explain things very thoroughly and simply. It's wonderful for people like me who want to properly understand subjects like these. If you can, it would be wonderful to see a tutorial series that use the programming principles you teach us for a small scale project. Maybe a simple game or app so we can see how this all comes together. :)

[@SimpleSnippets]

Thank you so much for the wonderful compliments. And yes loved your suggestion as well. Will see if I can make something out of it!

[@nishanty7392]

Kudos to the huge Efforts you have put through in making all these videos. You're such a Gem Person brother and I seriously Thank you for such free valueable content. Wish I could found you earlier. Thank you once again.❤️

[@SimpleSnippets]

Thanks a ton! Thats really great to know buddy🙏 Please support me by sharing the videos and our channel with your friends too. Thats the biggest help and support you can provide 😇

[@zainabbohra2915]

Amazing bhai😎😎,and yess your accent is also very crystal and clear like your way of explaining 😅

[@divyansh34]

This channel is underated

[@ankushraj9583]

underrated channel. you deserve a lot more audience.

[@SimpleSnippets]

Thanks Ankush 🙌 bas aap share karogey toh help hogi 🤘

[@nafisahmed3607]

Maaaaaaaan why only 156k???? Why????? How on earth isn't this channel 1M yet????? Bhai when u get time after all your works make a video on Binary Search using recursive function

[@ubaidullah1991]

extremely helpful

[@HASHBIT70532]

Awesome bro

[@sriramadithya4799]

Thanks 😊

[@osamamustafa6884]

Respected Mr Tanmay Kindly Please do it with recursive function kindly

[@SimpleSnippets]

Thank you Osama, will keep this noted. ✌

[@dishanamdev2620]

Plz tell how to use recursive func in binary search( where is the video )

[@SimpleSnippets]

In this approach we are not using recursive approach. We are using iterative approach 😇

[@dishanamdev2620]

Why we can't use mid as mid = right+left/2 instead of left +(right -left)/2

[@SimpleSnippets]

You should try to use this. I think it will work. Try to dry run in step by step. ✌

[@dishanamdev2620]

@@SimpleSnippets ok thanks

[@bodlahruthik5730]

@@SimpleSnippets actually if we take the lcm of that expression we will get to a simplied form of (left + right)/2.then why it is required to deal with such complicated one .

[@mebton]

right+left/2 = left+(right-left)/2 cuz mid = left+(right-left)/2 if we multiply by 2 2mid=2left+(right-left) 2mid=left+right mid=(left+right)/2

[@newtechnology452]

sir, please make a video on binary tree

[@nitismita1035]

❤❤❤

[@expert77]

❤

[@adilshaikh9123]

in case of dynamic array creation...when the value in array is [1] and the target element to search is also 1 ....then the program should return output as "0" which is mid value but instead it's returning "-1". Can you please help me with this test case? The code to refer : class Solution { public: int search(vector& nums, int target) { //int temp = target; int left = nums[0]; int right = nums.size()-1; while(left

[@venkateshprasads8361]

sir plz put Fibonacci search video tutorial

[@25fpslagger81]

I have a doubt, wont we need to define what's int left and int right(like int left = 0 and int right = 9 in this case)? how did the computer understand that we are referring to extreme positions? Ok wait I got it thanks anyways

[@abhimanyu6534]

Plz make it using recursion 🙏🙏🙏🙏🙏🙏🙏🙏🙏

[@ganeshvategaonkar351]

Make it for recursive function please..

[@jhovaniprovida5121]

We combine stack and queue how can i use binary search to search inside stack and queue?

[@SimpleSnippets]

binary search can be implemented provided the Data Structure already has sorted elements in it :-)

[@jhovaniprovida5121]

Yes my code also had three types of sorting bubble, insertion, and selection sort so im asking how can i add binary search in my code.

[@rajatverma3205]

How to use binary search in Linked list ?

[@shwetpandey1250]

what I do when multiple same element search into the array

[@vipinkiruba102]

Plz puta video on recursive function too

[@SimpleSnippets]

I already have covered it in my C++ programming for beginners playlist. Here is that video - kzbin.info/www/bejne/mWi5m4Ztj7-Jja8

[@vipinkiruba102]

@@SimpleSnippets plz put a video on binary search using recursive function

[@pritammajumdar4975]

@@vipinkiruba102 Recursive Way int binarySearch(int arr[ ], int l, int r, int no){ while(l arr[mid]) return binarySearch(arr, l + 1, r, no); else return binarySearch(arr, l, r - 1, no); } return -1; }

[@poonamsangale4037]

How to improve coding logic?

[@kavyatripathi2151]

what if array descending order mai ho?

[@SahilBhosale08]

Hi Tanay Sir, I have a doubt as you have taken the length of array here 10 so as while passing values in function you gave left value as 0 and right as 9 but what if we are taking array from user we wouldn't know the right value at this scenario what value should be passed can u clear my doubt

[@yogeshkanare6312]

if size of array is n then take right =n-1

[@lokibaba4836]

How to write programme using recursive functions???

[@SimpleSnippets]

Check this video - kzbin.info/www/bejne/mWi5m4Ztj7-Jja8

[@mohithvarigonda9516]

what is the logic to print the numbers if repeated more than one time

[@vijaysinghchauhan7079]

Please 🙏 upload Binary Search using recursive function.

[@SimpleSnippets]

Yes the next few videos will be with recursive functions for traversal and search

[@7cipher399]

int binarySearch(int arr[ ], int l, int r, int no){ while(l arr[mid]) return binarySearch(arr, l + 1, r, no); else return binarySearch(arr, l, r - 1, no); } return -1; }

[@LyricVista]

sir i have write this code and its very helpful, i have one question that when we take array from user dynamically then is their any change in the code? like my code is exactly same like yours but i just take arrays elements from user dynammically, so problem is that the output is not same like your. in main function the output par shows some type of error and donot print the position can you please solve this. int main() { int size; int *array; cout

[@srushtivariya1231]

Actually u have taken only 3 argumentd in binarysearch function u haven't taken left i.e lower boundary

[@dhonddevameya2362]

Sir if we are given a random array , then how to convert it to a sorted one?

[@omkarshinde7355]

first you have to sort random array by bubble sort or any sorting method then you can apply this algorithm

[@swcomparisons8386]

array.Sort( );

[@tushar9548]

Bro I took the int size instead of taking 10..but when I started inputing my values in Array,it only took first 8 values as input.. Then I changed size to 15,20 etc. But it always took only 8 elements as input..what is the reason and how can I fix this? (I am using DEV C++)

[@siciliancpp382]

use vs code,clion .. dev cpp is outdated n doesnt supp for cpp17,20

[@mohithvarigonda9516]

check your logic no problem with dev c++

[@thestarinthesky_]

These videos on Binary Search lacks the important part : explanations on the time and space complexity.

[@gamsterilyass2952]

❤❤❤❤