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.
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.
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.
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)
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!
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.
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 < 60% ]. It is required to write a modular program.
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. :)
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.
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.
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 :)
@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?
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
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])
This is an incomplete explanation, because you rely on your C++ compiler's functionality in converting variable mid into the index. You need to be explicit about what index is actually being used, because it may be different in other compilers and certainly in other languages, which in turn changes the algorithm outcome completely. Is it FLOOR, CEIL or ROUND? - one must know in order to adopt the algorithm in other systems. For example, in Java Script you have to make this change: mid = Math.round((low + high) / 2); otherwise the algorithm won't work.
rehan asghar These tutorials are all about algorithms, not C++ language. They are meant to be applicable to any platform. The fact that C++ helps them hide some of the very important logic of the algorithm doesn't really help others understand how it works.
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 ?
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.
![Blox Fruits Dragon Rework Update [Full Stream]](http://i.ytimg.com/vi/EqDAp8udhm0/mqdefault.jpg)
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.
this is year 2024 and this stuff is still relevant, man c++ IS evergreen
WOW. Thank you! Programmers tend to be really snobby when it comes to helping. WE NEED MORE PROGRAMMERS LIKE YOU!
Very well explained. I thought binary search was something awful when I saw it on my last exam. Thank you very much!
Tarik Đulić yes
Out of all programmers I've listened to, you're the best.
Pls dont stop making this videos. They really help!
Thank God you have an American accent
Xdd haha
👍
it's interesting that it's always the indians making these types of tutorials.
Stfu
@@4XD45 ikr?
I've my Computer Science boards practical exam on 1st Feb. U helped me a lot.... Thanks man
I love you man
Even my doctor couldn't make it this simple
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.
If all your videos explain stuff this well then i am lucky to have found your channel def going to sub
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 have a comprehensive c++ final today (it will cover material from both this and the previous semesters). Cheers!
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 i've tried to understand this algorithm for 2 days even though this isnt that hard
When dealing with huge arrays you risk to overflow when calculating mid. A safer way is: mid = low + (high - low) / 2 .
what does overflowing mean?
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
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.
watch 4 videos looking for a simple detail concerning the algorithm. You had it.
Thank You so much Derek, I wouldn't be able to answer this question in exam ,if I had not found your channel!
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!
I have a Two-Dimensional Arrays. Do you have a video showing how to use linear and binary search on a Two-Dimensional Arrays?
I just can say, you are THE BEST.
Many thanks for your great contribution, May God bless you :)
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.
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 < 60% ].
It is required to write a modular program.
Great video been looking for something like this all day lol
your mid point calculation can cause overflow
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. :)
there are functions for sorting collections called sorting algorithms. there are a lot of good videos on youtube about them
How could I store all the words in my project? if I will go for a dcitonary?
10:32, what if an overflow happens?
Low + (high - low) / 2
Well done sir! Very helpful.
my great video lecture ever...
Oops, I think that was just a typo on my part and it still doesn't work, right?
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.
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.
you can use bubble sort algorithm to sort it before search
Awesome video. Clear and to the point.
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 :)
Thanks very much for so simplified and excellent lecture!
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?
for example if you are looking for 2 numbers you can give search value as input 2 times and run code 2 times ..
Thanks a bunch, got really stuck on this, your video helped a lot!
@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?
excellent and simplified presentation. thanx
What about last element
what the result of log2(64000) represents ? i mean the 15.966. thanks a lot !
It takes 16 loops to search a number within an array of 64000 numbers.
admiration come it self if you competent like you .thanks
sir 1 question can u tell me the name of your compiler. which u use in that video...
Since he didn't ever get back to you, it's Eclipse.
Gabe Payne that's not a compiler
Talha Ghaffar gcc
you are wonderful person and i really like your videos.
Sir, that's nice video but it not working for descending array values. Any solution for that?
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
Wonderful, perfect explanation.
Thank you for this video, it's so helpful!!
Great video! Amazing! Thank you for uploading sir!
Sir which one do you think is the best compiler ( user friendly and easy to understand)?
code blocks is fantastic
Thank you for posting!
You explained this very well. Thank you
These are very helpful videos
Thank you for sharing good quality teaching. :-)
Regards!
Jarek Jaworski
Amazing video, helped a lot for a project.
your project was based upon binary search only🤣🤣
what software do you use to run cpp file?
code-blocks
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])
Why you update low and high to mid+1 or mid-1; and not just update low or high to mid; see for 55 would much faster
You are awesome. Honestly!!
Great work man.
what software are you using sir?
He's using Eclipse
Can anybody explain me, why "return -1"?
+Hilaritas if the element is not found
i tried, 55 is at index 4 and 98 is at index 7...
Thank you for great lesson!
This was great and simply explained, than you :)
This is so helpful! Thanks!
what happened to you why did you disappear we missed you
very nice presentation. Thankyou
great explanation
Thanks so much for this!!
Thank you very much, it helped me with homework)
This is an incomplete explanation, because you rely on your C++ compiler's functionality in converting variable mid into the index. You need to be explicit about what index is actually being used, because it may be different in other compilers and certainly in other languages, which in turn changes the algorithm outcome completely. Is it FLOOR, CEIL or ROUND? - one must know in order to adopt the algorithm in other systems.
For example, in Java Script you have to make this change: mid = Math.round((low + high) / 2); otherwise the algorithm won't work.
Vitaly Tomilov Do you read the title of this video ???
It is about the binary search uses in C++ language , not in java ....
rehan asghar These tutorials are all about algorithms, not C++ language. They are meant to be applicable to any platform. The fact that C++ helps them hide some of the very important logic of the algorithm doesn't really help others understand how it works.
@@notarealhandle123 Maybe you shouldn't have come here if you didn't want c++ to be the language .
dude you are amazing!
Thank you for posting :D
Thank you so much this is unbelievable helpful
Good explanation
now my eyes are widely open
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 ?
Great work, this really helped me out thank you! Instant like!
how about this way no function than main is used .
int n, i, arr[50], search, first, last, middle;
coutn;
cout
yo dis my go to video for binary search
Thanxz very Good Instructions Given ..... Thank you Very Much.....
Thank you so much brother.
very well explained~!!!
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.
DaveyJones I commented that too! I didn't think about how to do it otherwise, thanks
Ok, interesting - I thought it was mid= low+(high-low)/2 -- is this the same thing as high/2 + low/2 ??
excellent!!
Thank you, man!
Great video
great work ,
Very helpful
Thank you very much sir.
you're awesome!
thanks u save my life :')
Good tutorial.
Amazing!!
Thanks a lot man.
Thank you!!
you are amazing :)
What's up Derek from speech class
Thank you Brother
Dont't work !!!!!!!!!!!!!!!!!!