this video was uploaded 4 years ago so the person who watched it then in 1st year would be graduating and sitting in interviews by now damn thanks Harry
If possible please share this course and notes with your friends! Notes and code have been uploaded on the site: codewithharry.com/videos/data-structures-and-algorithms-in-hindi-12 Instagram: instagram.com/CodeWithHarry
examples for liner search -> as search any card from group of cards and for binary search -> as search any page number from 1000 pages of book both examples are very nice and exactly fit in the situations.
harry bhai me binary search bohot baar sikha but dimag me ghush hee nhi , aapke ek book ke page number wale exmaple se sara fanda clear ho gya thanks for the example ,,,,,....example dete rahiyo.
Bro please add advanced things also like Kadane's algorithm, subarray, trapping rain water problem and many more which are asked by the companies. It will be very much helpful, your videos and notes are of great clarity hence I am asking you for this portions to be covered. Please Harry bhai banao.
You are 10000000 times better than my college teachers. App ka teaching ka tarika anokha hai. Mujh jese insan kelie aap jese teacher milna khus kismatt hoga. thank you so much. Disle sukriya. Aap jesa purr TH-cam me nehi milega koi. 💓💓💓💓💓me aap ke video dekhke bahut ku6 sikha hun
5:18 yarr bhaiya yeh exampl eki wajase ham Concepts ko Real world ke sath relate kar sakte hai aur hame yeh bahut dino tak yaad rahta hai aap aise hi examples diya karo aapke examples bahut khatrnak hote hai dimak me chaap chod jate hai 😃😃
00:00 Binary search is a smarter algorithm 04:54 Binary search is a search algorithm that works efficiently on a sorted array. 09:30 Binary Search is faster than Linear Search 14:00 The video discusses linear and binary search algorithms. 18:55 Linear search is a straightforward way of searching for an element in an array. 22:56 This is a coding explanation video 26:58 Implementing linear and binary search algorithms in simple language. 31:20 The probability of asking a question is very high.
5:19 ek dam best examples hote hai aapke like topic ki definition se 1 percent na clear hua hoga lekin fir aapke example se poora clear ho jaata hai fir vo topic
@CodeWithHarry //BINARY SEARCH #include int main() { int i, low, high, mid, n, key, array[100]; printf("Enter number of elements"); scanf("%d",&n); printf("Enter %d integersn", n); for(i = 0; i < n; i++) scanf("%d",&array[i]); printf("Enter value to findn"); scanf("%d", &key); low = 0; high = n - 1; mid = (low+high)/2; while (low high) printf("Not found! %d isn't present in the list.n", key); return 0; }
Plz make a new playlist on Android Studio....I want to learn android development from you only....because your concept is very clear and you just explain all courses in an easiest and simplest way....plz make this course...it's an humble request
Hi Bro, I am watching your videos since last month and I really love the way you teach.Bro,I am in 4th year Degree in IT field .How would I get a job , what should I learn to get prepared for interviews in coming 6 months.
Cool examples sir.... although I thought about another one for Binary Search.... Suppose we're searching for a word in a dictionary....the words are arranged in a sorted order in it By the way I love your work ❤️❤️
Sir, aapse se coding sekhne me maza aa Jata h. Sir, Intel institute ne Jo algorithm banaya hai which algorithm can create the algorithms, us par video banaiye ga please. This is telling that it can cause high rate of unimploymemt of programmers
What if array is unsorted? We can go for linear search ofcourse, but what if we first try to sort the array and then use the binary search? Will it be a good approach?
@@yashwanth8350 Suppose an XYZ university has conducted a test and a total of 100 students have participated in that test. After the test is conducted, the university decided to show the performance (marks) of the students on its system web portal in an order such that highest marks student will be displayed at the top while followed by the second highest marks student and so on up to the lowest mark student. Now suppose the university has hired you as a C++ programmer and has assigned you the task to write a computer program which does the finding/searching based on marks in the stored data. The university has limited resources and wants to find the speed up process for searching. Which searching algorithm (Linear or Binary) will be the most suitable to use in your program for the above task?
Makes me happy to see educational videos like these from India with so many views! I don't understand a word, but I can tell that the Indians watching this, and learning on TH-cam, will be going places! Great to see this!
I think there is some problem in the code Because it compare arr[mid]==element But the code does not compare arr[low]==element or arr[high]==element. If the element is on arr[high] or arr[low] position the program will give output element not found!
Suppose an XYZ university has conducted a test and a total of 100 students have participated in that test. After the test is conducted, the university decided to show the performance (marks) of the students on its system web portal in an order such that highest marks student will be displayed at the top while followed by the second highest marks student and so on up to the lowest mark student. Now suppose the university has hired you as a C++ programmer and has assigned you the task to write a computer program which does the finding/searching based on marks in the stored data. The university has limited resources and wants to find the speed up process for searching. Which searching algorithm (Linear or Binary) will be the most suitable to use in your program for the above task?
Hats off to your dedication, Harry!! Amazing content, such explanatory videos, notes, superb real life examples. What more can the learners ask for! One general tip for all: Always customize the playback speed as per your intake capacity, like I watched this at 2x & understood everything. This just helps you grasp more content in lesser time if you already have some idea about the topics.
Suppose an XYZ university has conducted a test and a total of 100 students have participated in that test. After the test is conducted, the university decided to show the performance (marks) of the students on its system web portal in an order such that highest marks student will be displayed at the top while followed by the second highest marks student and so on up to the lowest mark student. Now suppose the university has hired you as a C++ programmer and has assigned you the task to write a computer program which does the finding/searching based on marks in the stored data. The university has limited resources and wants to find the speed up process for searching. Which searching algorithm (Linear or Binary) will be the most suitable to use in your program for the above task?
keep up the good work , you are giving us a 10000 rupees monthly costing course in free with your handwritten notes you are a fabulous and hardworking harry bhai 👌👌👌👌🫡🫡🫡🫡
Hope you liked the video. If you are into C, C# or C++, download the best IDE for C, C# and C++ here: bit.ly/WholeTomato-CWH
❤harry bhai... From West Bengal ❤
the whole code by you is amazing
I respect your Hardwork Sir...
this video was uploaded 4 years ago so the person who watched it then in 1st year would be graduating and sitting in interviews by now damn thanks Harry
Your examples are always to the point, and makes it very easy to understand the concept, Thanks!! And notes are fabulous man, Too gud 🤩👌👌
As these comment is 10 monts ago....does these course help you ?
Hi
loveeeee
Abhi kaha par ho🤔
All his students gonna achieve something best in their life
You to ,
@@piyushmishra5533 we all🙌
@@harshitachaurasia1246 wow nice thinking
@@piyushmishra5533 :) yes
He is best teacher ever met on youtube
@@harshitachaurasia1246 correct .In which year are u from?
Harry bhai apka examples ki takkar ma koi nahi ha.... Bilkul crystal clear concepts ho jata ha
5:27 best example till date sunne se pehle hi samaj aagya ☺️☺️
yess
If possible please share this course and notes with your friends!
Notes and code have been uploaded on the site: codewithharry.com/videos/data-structures-and-algorithms-in-hindi-12
Instagram: instagram.com/CodeWithHarry
Bhai C++ continue karo please.
hello sir please make a full course on java swing..plz plz plz full graphics..
Will you teach everything in this course?
Sir Photoshop in one video banao na please
Sir pls upload more pygame projects
I just can't believe all these resources are free ! Salute you Harry Bhai 👍
examples
for liner search -> as search any card from group of cards
and for binary search -> as search any page number from 1000 pages of book
both examples are very nice and exactly fit in the situations.
5:25 harry bhai aapke examples bahut ache hote hai please continue them
Bhai examples ko kya hi bolu mein 🤩 .... jabki aapka padhana hi pro level ka, uska to koi jawab hi nahi 🤩🔥🔥
Harry Bhai apke Drawings bade mast hote hai 🙃🙃
05:23 best examples, keeep giving example
Examples are necessary and your examples are good enough to grasp the concept....
"Apne se box bnae ke samjho ache se aayegi ."........it works harry bhai ....... TYSM
Sahi hai bhai - Perfect example (binary search)
Maza aa gya sir ji, Sab clear cut samaj me aa Gya :)
bhai the speed with which you are growing is all because of your hardwork. this playlist will help students for years. Marks my words
Learning from your videos is best utilisation of our time. Thanks for all the productive courses.
HARRY MAKE MORE THIS type I Like your video
Hi from where you are I think I know you
harry bhai me binary search bohot baar sikha but dimag me ghush hee nhi , aapke ek book ke page number wale exmaple se sara fanda clear ho gya thanks for the example ,,,,,....example dete rahiyo.
Awesome lecture !! I appreciate your hard work to prepare notes & the example which you took to explain.
bhai complete indepth banana taki refere na karna pade kahi kyuki aaap best teacher ho harry bhai....
Book wali example esi thi ki sunne se pehle hi pta lgg gyi binary search algorithm❤
5:26 I really thinking what will be example for Binary and you give great example
Damn, harry bhai the hardwork you put in these courses. Hats off! 🙏❤️❤️
Thankyou for such quality courses! ❤️❤️❤️
your examples are always up to the point and it helps us to easily understand the concept
32 hours of hardwork
Your examples are really helpful to understand in simple words and not at all bookish language , Thank you Harry Sir.
Bro please add advanced things also like Kadane's algorithm, subarray, trapping rain water problem and many more which are asked by the companies. It will be very much helpful, your videos and notes are of great clarity hence I am asking you for this portions to be covered. Please Harry bhai banao.
You are 10000000 times better than my college teachers. App ka teaching ka tarika anokha hai. Mujh jese insan kelie aap jese teacher milna khus kismatt hoga. thank you so much. Disle sukriya. Aap jesa purr TH-cam me nehi milega koi. 💓💓💓💓💓me aap ke video dekhke bahut ku6 sikha hun
one thing that makes your videos unique is you made our thought process strong in our own mother tongue. Hats off sir 😊
user-friendly example outstanding
You r donig great work bro we are always in search for some one who explain the things likes this and you have fullfill that thing with your hard work
5:18
yarr bhaiya yeh exampl eki wajase ham Concepts ko Real world ke sath relate kar sakte hai aur hame yeh bahut dino tak yaad rahta hai aap aise hi examples diya karo
aapke examples bahut khatrnak hote hai dimak me chaap chod jate hai 😃😃
this course is too much better than udemy or any other online courses. Thanks harry bhai for this course.
BHAI aap ka example कतई जहर aur समझने का तरीका उससे भी जहर Thanks bro😊
Your Teaching with Analogy is best!
Examples kai sath bohat achi samjh ati hai plzzz continue in the future 😇
Best DSA playlist ever! Thank you so much Harry Sir for providing it for free!
Itna sahi explanation abhi tak nahi mila tha sir
you are awesome!!!!! I must say that you are doing a great job. teaching us languages in a simple way, no one can do this in this way.
bahut hard harry bhai mza aa rha he cource me
I have Learned many things From your Videos..
00:00 Binary search is a smarter algorithm
04:54 Binary search is a search algorithm that works efficiently on a sorted array.
09:30 Binary Search is faster than Linear Search
14:00 The video discusses linear and binary search algorithms.
18:55 Linear search is a straightforward way of searching for an element in an array.
22:56 This is a coding explanation video
26:58 Implementing linear and binary search algorithms in simple language.
31:20 The probability of asking a question is very high.
I am speechless sir , may we can learn and gain knowledge by your hardwork ✨
binary search samjhana itna aasan he ye me ne kabhi socha bhe nhe tha wah sir you are great
I've never met with this kind of a guru
Bhaiya apke examples sabse best aur sath hi sath utne hi simple hai
Harry , you are doing really a great job , proper explanation in depth line by line. Thanks man
Harry bahiya ap sa achi example koi or thori na da sakta hai you are best brother 🤗🤗
Your example was really fabulous and related to real life experience ❤❤
5:19 ek dam best examples hote hai aapke like topic ki definition se 1 percent na clear hua hoga lekin fir aapke example se poora clear ho jaata hai fir vo topic
9:33 for binary search
25:10 binary search code
best and relatable examples...koi part aisa nhi jo smjh ni aata...love u harry bhai
Brother, seriously yaar you are making so knowledgeable videos. I'm very much thankful to you. ❤❤
@CodeWithHarry
//BINARY SEARCH
#include
int main()
{
int i, low, high, mid, n, key, array[100];
printf("Enter number of elements");
scanf("%d",&n);
printf("Enter %d integersn", n);
for(i = 0; i < n; i++)
scanf("%d",&array[i]);
printf("Enter value to findn");
scanf("%d", &key);
low = 0;
high = n - 1;
mid = (low+high)/2;
while (low high)
printf("Not found! %d isn't present in the list.n", key);
return 0;
}
EXAMPLE ARE OBVIOUSLY NECESSARY ...AND HARRY BHI YOUR EXAMPLES ARE OUT OF THIS WORLD ...COULDN'T EXPECT MORE .
Plz make a new playlist on Android Studio....I want to learn android development from you only....because your concept is very clear and you just explain all courses in an easiest and simplest way....plz make this course...it's an humble request
Already make please check his channel videos
I know but that Playlist was very short....I want a playlist just like a course such as C Language......I've already watched all his videos.
thanks a lot harry this couse is really helping me a lot and also saving my money from any other online platform for learning DSA
Thank you sir ❤️
Bahut badhiya examples hai🔥🔥🔥❤️❤️😀
Hi Bro, I am watching your videos since last month and I really love the way you teach.Bro,I am in 4th year Degree in IT field .How would I get a job , what should I learn to get prepared for interviews in coming 6 months.
DSA+DBMS+OS+CN
@@Unknown-Stranger dbms and cn kya hai
@@varindersingh7708 CS/IT ke subjects
@@Unknown-Stranger full form
@@varindersingh7708 database management system and computer networks
Sir dil se dhanyabad for such a great content in free of cost
Sir pls provide some links of 15 - 20 questions for practice on each and every topic
5:18
bhai apke example bhot acche hai easy hai aur bhot hi zyada topic ke relatated
hai
engeneering colleges bandh karoo , coaching centers bandh karoo
harry bhai classes shuruu karoo youtube meyy
thank u harry bhaiii!!!
bahut a66a example hayy HArry Bhai
Example is superb....
Best video on youtube for linear and binary search.
Thanks for making learning so simple :)
Harry sir the example chosen is absolutely relevant and appropriate. Thank you so much sir for your relentless effort.
Cool examples sir.... although I thought about another one for Binary Search....
Suppose we're searching for a word in a dictionary....the words are arranged in a sorted order in it
By the way I love your work ❤️❤️
Your examples are best examples ever and it helps to understand the concept easy
Examples makes the concepts easy for understanding
You're Great Harry sir💙
5:39
Example is very nice sir, keep giving such more examples.
why do we return -1 , not any other value?
Examples based on real-life are awesome.
Harry bhai muje linear our binary search me time equal lag rha h ❤❤
Haris, if we would have made the low=mid and high=mid instead of the low=mid+1 and hight=mid-1, it would not affect the duration of the program right?
Example bhaut aache lag rahe hai Bhaiya 😊.
Sir, aapse se coding sekhne me maza aa Jata h.
Sir, Intel institute ne Jo algorithm banaya hai which algorithm can create the algorithms, us par video banaiye ga please.
This is telling that it can cause high rate of unimploymemt of programmers
Sir please reply. I am in class 9 and waiting for your reply.
Hamare teachers bhi itna mehnat padhane mai nahi karte yaar ... thanks a lot bhaiya ❤️
Harry bhae it could be possible that element can be found at low and high like if arr[low]==element return low and same for arr[high]
low
Thanks sir........
Your videos and notes is very helpful.
What if array is unsorted?
We can go for linear search ofcourse, but what if we first try to sort the array and then use the binary search?
Will it be a good approach?
Again if we make unsorted to sorted array the time complexity is O(n), better to directly use linear search which is O(n) again , my opinion 🤔....
@@yashwanth8350 Suppose an XYZ university has conducted a test and a total of 100 students have participated in that test. After the test is conducted, the university decided to show the performance (marks) of the students on its system web portal in an order such that highest marks student will be displayed at the top while followed by the second highest marks student and so on up to the lowest mark student.
Now suppose the university has hired you as a C++ programmer and has assigned you the task to write a computer program which does the finding/searching based on marks in the stored data. The university has limited resources and wants to find the speed up process for searching. Which searching algorithm (Linear or Binary) will be the most suitable to use in your program for the above task?
Makes me happy to see educational videos like these from India with so many views! I don't understand a word, but I can tell that the Indians watching this, and learning on TH-cam, will be going places! Great to see this!
I think there is some problem in the code
Because it compare arr[mid]==element
But the code does not compare
arr[low]==element or arr[high]==element.
If the element is on arr[high] or arr[low] position the program will give output element not found!
Suppose an XYZ university has conducted a test and a total of 100 students have participated in that test. After the test is conducted, the university decided to show the performance (marks) of the students on its system web portal in an order such that highest marks student will be displayed at the top while followed by the second highest marks student and so on up to the lowest mark student.
Now suppose the university has hired you as a C++ programmer and has assigned you the task to write a computer program which does the finding/searching based on marks in the stored data. The university has limited resources and wants to find the speed up process for searching. Which searching algorithm (Linear or Binary) will be the most suitable to use in your program for the above task?
05:12 ,ye book wala example to ekdum best hai harrybhai, ekdum real life example👌
Hats off to your dedication, Harry!!
Amazing content, such explanatory videos, notes, superb real life examples.
What more can the learners ask for!
One general tip for all: Always customize the playback speed as per your intake capacity, like I watched this at 2x & understood everything.
This just helps you grasp more content in lesser time if you already have some idea about the topics.
i daily watch one video before sleeping...Thankyou sir
Suppose an XYZ university has conducted a test and a total of 100 students have participated in that test. After the test is conducted, the university decided to show the performance (marks) of the students on its system web portal in an order such that highest marks student will be displayed at the top while followed by the second highest marks student and so on up to the lowest mark student.
Now suppose the university has hired you as a C++ programmer and has assigned you the task to write a computer program which does the finding/searching based on marks in the stored data. The university has limited resources and wants to find the speed up process for searching. Which searching algorithm (Linear or Binary) will be the most suitable to use in your program for the above task?
because the marks will not be sorted so it should be linear
5:24 Your example and analogy are always best
First commentry
5:23 best example for understanding 😍👀
keep up the good work , you are giving us a 10000 rupees monthly costing course in free with your handwritten notes
you are a fabulous and hardworking harry bhai 👌👌👌👌🫡🫡🫡🫡
you didnt explain sorting algorithms in this playlist can you please add that topic
Bhai apke example naa 😘😘😍bahut helpfull hote hai concept understand standing me🤩aise hi example dete rehna👍🙏
who see this video in 2024 🙂
present sir😅😅