I have seen the Linear search algorithm you completely figured out for me. Your teaching way is a piece of cake. Watching from Ethiopia. Thanks a bunch.

WOW. Thank you! Programmers tend to be really snobby when it comes to helping. WE NEED MORE PROGRAMMERS LIKE YOU!

Thanks so much - I have listened to your videos on arrays and passing arrays to functions - now I finally think I get the concepts - the explanations were clear and systematic - keep posting more videos - kudos sir for sharing your knowledge in a way that communicates to the student.

Very well explained. I thought binary search was something awful when I saw it on my last exam. Thank you very much!

@bilalahmad-xp9ck

7 жыл бұрын

Tarik Đulić yes

Pls dont stop making this videos. They really help!

Thank you so much! I have a comprehensive c++ final today (it will cover material from both this and the previous semesters). Cheers!

I've my Computer Science boards practical exam on 1st Feb. U helped me a lot.... Thanks man

this is year 2024 and this stuff is still relevant, man c++ IS evergreen

you are good at teaching...... i didn't find any video that made it as clear as you did!.... thanks a lot;... coz tomorrow is my 12th grade final exam.

Thank you so much i've tried to understand this algorithm for 2 days even though this isnt that hard

I love you man Even my doctor couldn't make it this simple

I just can say, you are THE BEST. Many thanks for your great contribution, May God bless you :)

Well done sir! Very helpful.

Great video been looking for something like this all day lol

Thanks very much for so simplified and excellent lecture!

Wonderful, perfect explanation.

watch 4 videos looking for a simple detail concerning the algorithm. You had it.

Awesome video. Clear and to the point.

Thank you for posting!

Thank God you have an American accent

@jahitrst2863

4 жыл бұрын

Xdd haha

@temirlanmukatay1765

4 жыл бұрын

👍

@4XD45

3 жыл бұрын

it's interesting that it's always the indians making these types of tutorials.

@rednecksegexe4438

3 жыл бұрын

Stfu

@darkwolf988ify

2 жыл бұрын

@@4XD45 ikr?

You explained this very well. Thank you

excellent and simplified presentation. thanx

Thank you for this video, it's so helpful!!

@ReelLearning you made it so simple and logical to understand.Thanks for the video it helped me a lot. :) By the way what is the program you're using to write the code and compile it?

I really love your way of explaning. I should tell you I am not a native English Speake however, I've been able to understand most. Congratulation !!!! pd: GREETINGS FORM HONDURAS!

Great video! Amazing! Thank you for uploading sir! Sir which one do you think is the best compiler ( user friendly and easy to understand)?

@arumaibright5302

7 жыл бұрын

code blocks is fantastic

Thank you for great lesson!

Excellent Explaination sir !

Thanks a bunch, got really stuck on this, your video helped a lot!

These are very helpful videos

well done explained. Should the number sequence ? coz i try random number and false answer. what is your application ? i'm using borland 5.02 ,about your code 'using namespace std' ,borland say that 'namescpace name expected' i'm bit consfused, please answer :)

my great video lecture ever...

Thank you for sharing good quality teaching. :-) Regards! Jarek Jaworski

Thank You so much Derek, I wouldn't be able to answer this question in exam ,if I had not found your channel!

I have a Two-Dimensional Arrays. Do you have a video showing how to use linear and binary search on a Two-Dimensional Arrays?

Great work man.

with C++, there is no need for binary search. Just store data into set STL data structure and use its set::find() member function. But thanks for explaining binary search algo.

very nice presentation. Thankyou

admiration come it self if you competent like you .thanks

When dealing with huge arrays you risk to overflow when calculating mid. A safer way is: mid = low + (high - low) / 2 .

@Asterite

2 жыл бұрын

what does overflowing mean?

Thanks so much for this!!

This is so helpful! Thanks!

you are wonderful person and i really like your videos.

Amazing video, helped a lot for a project.

@abdurraheem2444

4 жыл бұрын

your project was based upon binary search only🤣🤣

You are awesome. Honestly!!

 Using a C++ array of STRUCTUREs, write a program that takes input of student information - for 10 students - like: 1) Student ID. 2) Student name. 3) Course marks (5 courses for each student).  The program provides below functionality: 1) Show all records. 2) Search and display a student record on ID. 3) Modify the record of a particular student. 4) Show the passing percentage for each course. 5) Show the names of students who failed in a particular course. 6) Show the total marks, the percentage, and the overall letter grade for individual students. 7) Show the names and the letter grades of all students in each course. 9) Show the student names for each letter grade in each course [ A >= 90% - B >= 80% - C >= 70% - D >= 60% - F  It is required to write a modular program.

Good explanation

great explanation

Thank you for posting :D

Thanxz very Good Instructions Given ..... Thank you Very Much.....

your mid point calculation can cause overflow

So basically, we can't do binary search if the array isn't sorted from low to high? Unlike linear search that can do even though if the array isn't sorted (random number)

Thank you so much this is unbelievable helpful

This was great and simply explained, than you :)

excellent!!

Thank you very much sir.

Very helpful

very well explained~!!!

Great video

what software do you use to run cpp file?

It was really cool ! But here is the question though : What if the list/array is unsorted ; I mean if there is a large search space , say 50000 elements ; would we be able to sort it manually ? - NO. So, why don't we have a function for sorting too? Thinking practically , there are not gonna be arrays with just 8 or 10 or 50 elements, so i think we need it. Comment down your thoughts on this. :)

@LandonGernand

3 жыл бұрын

there are functions for sorting collections called sorting algorithms. there are a lot of good videos on youtube about them

great work ,

Thank you very much, it helped me with homework)

yo dis my go to video for binary search

dude you are amazing!

Thank you so much brother.

Thank you, man!

How could I store all the words in my project? if I will go for a dcitonary?

Hey thanks for this great video. It clears my confusions Can you please tell me how do you edit this video? What software you were using to teach us by writing on screen ?

Thank you!!

Amazing!!

Thank you Brother

Good tutorial.

My question is, would binary search still works if there's double or more of the specific data you're looking for? If so, how/what's the algorithm?

@pendyalaabhishek6273

3 жыл бұрын

for example if you are looking for 2 numbers you can give search value as input 2 times and run code 2 times ..

Belissimo!

Oops, I think that was just a typo on my part and it still doesn't work, right?

Thanks Sir~

Great work, this really helped me out thank you! Instant like!

you're awesome!

Note that the way you are updating hi and lo means there could be integer overflow. In practice you should use high/2 + low/2. Using (high + low)/2 could potentially cause an overflow if high + low is larger than the maximum representable value: 32 bits = 2^32 -1.

@ledues3336

7 жыл бұрын

DaveyJones I commented that too! I didn't think about how to do it otherwise, thanks

@AlyssaMarie-vr8cc

Жыл бұрын

Ok, interesting - I thought it was mid= low+(high-low)/2 -- is this the same thing as high/2 + low/2 ??

Thanks a lot man.

Big Up!

Thanks

you are amazing :)

what software are you using sir?

@davidgaster

7 жыл бұрын

He's using Eclipse

what the result of log2(64000) represents ? i mean the 15.966. thanks a lot !

@phatchunk99

7 жыл бұрын

It takes 16 loops to search a number within an array of 64000 numbers.

thanks

But now what would the purpose of the binary search algorithm if the array is not sorted?? The binary search algorithm forces you to have the array sorted, and if you have to sort the array then it would be faster to use linear search than sorting then searching the array.

@aNz0r2

6 жыл бұрын

Let's assume that you have your target value at the end of your brute (unsorted) array. Linear search will be in worst case, which will give maximum complexity. Meanwhile, a quicksort function before using binary search will be much more efficient, as the complexity will be at least modest. Sorting an array doesn't always mean using 2 for() loops.

@nexgen2816

6 жыл бұрын

you can use bubble sort algorithm to sort it before search

Sir can you explain why there is high = size-1 because I am little bit confuse. What is the use of high = size-1? 10:01

@aarjavbaxi2299

3 жыл бұрын

Here, size stands for the number of elements in the array ; So according to that , your high index value would be 1 less than the number of elements.

execellent

sir 1 question can u tell me the name of your compiler. which u use in that video...

@gluedtogames

10 жыл бұрын

Since he didn't ever get back to you, it's Eclipse.

@ledues3336

7 жыл бұрын

Gabe Payne that's not a compiler

@ledues3336

7 жыл бұрын

Talha Ghaffar gcc

What about last element

Sir, that's nice video but it not working for descending array values. Any solution for that?

@kkn5523

5 жыл бұрын

Reverse that array by storing it in another array like this: Say your original array is:array1[size]; int array2[size],k=0; for(int i=size-1;i>=0;i--) { array2[k]=array1[i]; k++; } Apply the sort on array2. That' s what i do. Hope it helps! You can also manipulate the binary sort algorithm but this method seems simpler

nice ...video

thanks u save my life :')

what happened to you why did you disappear we missed you

now my eyes are widely open

Whoa, has nobody noticed that what he's showing doesn't even work? Using his example array, try searching for 55, or 98; it can't find it. The check for (low >= high) needs to be just after you check (value == arr[mid])

i tried, 55 is at index 4 and 98 is at index 7...

10:32, what if an overflow happens?

@sakirarahman3091

4 жыл бұрын

Low + (high - low) / 2