@amanjaiswal4847

one thing i want to add:
mere jese slow learner ko jab koi kuch concept samjhaye or fir programme likhne k baad usi chiz ko dubara samjhaye pura
no words for this
thank you so much

@shreyaschavhan5522

Notes - 
Linear Search - {Time Complexity - O(n)} - 0:49  
Binary Search - Concept - 3:30
Binary Search - Code - 8:00
Binary Search - Time Complexity - O(logn base 2) - 11:32

@kiranp5828

These guys are just amazing.And they were doing such a great work.
They were giving a very quality education for free.
Please guys support them all.🙏🙏🙏

@severemage3374

0:49 linear search 
3:30 binary  concept
8:00 binary code

@couldbenimish

Addition : : Binary Search applicable only when the given array is sorted. If not, we first need to sort the array and then find the element using the binary search function.

@CSSqlJq

Mam you are really god for us, likes poor and middle class background students
Your technique of teaching is just amazing
your video makes easy to understand any topics...tqqqq my fav mam

@astatosiseverywhere

whenever mam say 'thik hai' i feel very good

@kpsaini404

Explaining Binary search complexity is awesome. I like it

@CricketLover-kc6ln

Man with the mission 🔥🔥🔥❤️

@rutvikrana512

This approach of problem solving is called 
"divide and conquer". As we are dividing our array into halves. 

Another examples of D&C : 
- finding GCM ( greatest common divisor )
- merge sort and quick sort algorithms

binary search will only work if array is sorted. This should be in mind.

The same example of the video can be easily written by Recursion.

binarySearch(int arr[],int item,int l, int r)
{
  int n = sizeof(arr)/sizeof(arr[0]);
  int m = (l+r)/2;
  if (m < 0 || m> n-1){ return -1; }
  if (arr[m] == item){ return item; }
  else if(arr[m] > item) {
       return binarySearch(arr,item,l,m-1);
    }
   else{
       return binarySearch(arr,item,m+1,r);
    }

  return -1;
}

@priyamondal6177

Best video ever.
Thank you mentor and Aman dhattarwal for this awesome contribution to the society. More power to all the members of Apna College.

@devilhunter8120

8:52 the value of e = n-1, because the indexing starts from 0.

@LifewRoshu

Thank you so much AMAN BHAIYA and the whole team of APNA COLLEGE ❤️❤️✨✨

@sanketkumar09

Well done bhaiya
We love you and always support you

@sagarrajkumargupta5168

your teaching style is quite good and i want notes of this lecture. i saw previous request for notes But you didn't upload on this video.
kindly upload the notes as soon as possible its my humble request to you. Keep Growing.

@SakshiPatil_

Thankyou so much for your efforts ❤️❤️ and urvi di apa bahoot jyada accha sikhate ho please apa hi sikhana ye pura course muze apaka sikhaya jyada accha samajha ata hai . Love you ❤️❤️❤️

@aryansharma-wf8sn

Urvi di aap hi baki lectures bhi lena you explain these concepts very easily 🤩😍

@SUJOYPAULJOBS

linear and binary search bohot easy ....and MAM EASY TO  TEACH  C++...NICE

@prathitprasad

I use Java but still this explanation was too helpful
Btw no Nehas were harmed while making this video

@atomicity.probably

It's sooo much simpler than I had thought, thanks!