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.🙏🙏🙏
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
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.
@@ashisharyan3028 koi baat nahi bhai. Agar sharda university me admission nahi hua tho tum koi aur university jaise ki Oxford, Harvard ya Princeton me admission lelena.
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
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; }
@@kushagra0347 l represents the left-most index of the half that is to be searched and r represents the right-most index of the half that is to be searched. Initially while calling the function, l is 0 and r is n-1.
@@fundekaustubh can we assign first array index as '1' or it is necessary to assign it '0'. Here she use n but that mean that she is assigning first value as 1.
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.
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 ❤️❤️❤️
dd, ek baar dekhna... doubt tha... time complexity of binary search mein... after 3 interation length of array is n/2^3-1... so after k interation it should be n/2^k-1... so after calculation time complexity should be log2n with base 2...plz clear the doubt.... btw thanks for the course to every member... lots of love❤❤❤❤
base is ignored while calculating complexity as log base 2 is same log base e / log base 2 and we ignore the coefficients of terms. Here log base 2 is ignored.
Binary Search works in sorted array only. We have to sort the array first in ascending or descending order if the array entered in unsorted . Linear Search is better for unsorted array
actually it could be either of the values, cuz vese b hamein exact mid point ki zarurat nhi hai. baad m to check krna hi hai ki key midpoint se bada hai ya chota hai.
No...I think over here because as s=0 and e=n so when you will do (S+n)/2=(0+n)/2 will give exactly half of your array but if you do(0+n-1)/2 you will not get exactly the mid of the array.please think again.
@@hemasingh5668 yeah that is true but there is really no need to find out the exact mid point ryt? Lets assume array 6 size ki hai. (0+n)/2 krte ho to mid point 3 index p ata hai. (0+n-1)/2 se mid point 2 index ata h. And in either of the cases u ll be checking whether your target element is before that index or after that index. N time complexity is also the same in both cases. So the answer ll be d same either way.
There is one mistake in last time complexity that after K iterations ,the length of the array becomes = n/2^(k-1)........(12:17)... I hope , I am right since you are a wonderful teacher and because of you I can find the mistake and can correct it.....
there's no mistake at all. The array size starts from n and after the iterations start, it becomes n/2, n/3, n/4... n/2^k. Note here that k is a random number and not according to the pattern you are thinking which makes it (k-1). Let's say (k-1)=k'. In the video k' is the k. You can co relate this with principal of mathematical induction where we assume the expression to be true for any random k and not some k as per some pattern. And for those who are saying after first iteration array size should be n/2, that's true but the point is that we have to consider from the point before the iteration starts for calculation of time complexity in which case the size wil be n itself. So apparently there's absolutely no mistake in the video.
@@pep8221 aur aisi arrogant stupid idiot ki tarah behave mat karo..isse tumhara khud ka hi respect girega dusro ke saamne..tumhare mata pita kya is tarike se tumhe logo ke saath behave karna sikhaya hai?
After k iteration ,length of array=n/2^k-1 As In 1st iteration length =n/2^0 In 2nd iteration length =n/2^1 So In k iteration length =n/2^k-1 It is simple gm series
Very Important condition for Binary search is that Array should be sorted But in your code there aren't any lines which shows that.if before searching we code for it then it will be better for unsorted input array also.
It doesn't matter. Its like subtracting infinity by 1 So infinity - 1 = infinity So N/2^k-1 = N/2^k Because N is dominant and can be value equal to infinity
i would like to point one specific error, lets say we putted one sorted array and key is same as the last value of array, then it will return -1 because we have initialsed last element e from n, it would be better if we initialise [e= n-1]. In the function defined 'binarysearch', we need to initialize the end from n-1 where n is the size of the arr. I hope this helps.
@@weasleygaming3 Yes, It's necessar to have the inputs in ascending order, thats why it is called binary search. There are other algorithms for searching without a ascending order.
@@TonyStark-ct8xd by after sorting the array index of the elements will change then how would we get correct index It will index of the sorted array but we want index of the real array that's my doubt
The time complexity of Binary search is not really O(logn ) because the array was not sorted . SO if i have to sort the array as well using Merge Sort then the time complexity becomes O(logn + nlogn) = O(logn) ... So if it's unsorted then time complexity is O(nlogn) .
Re ghanta amazing vai sala wise parata hai jaise ki aj hi khatam karna hai pura syllabus ☹️ thoda smjha samjha ka padya na College mai vi eisa padata hai or yeh vu dise padata hai 😑kahase samjhe patahi nahi chalta hai
There is mistake in finding time complexity of binary search. After 1s iteration our array size has reduced to half but in video they took full size of array . This is the correct form of solution Time complexity: After 1st iteration ,lenght of array = n/2 After 2nd iteration ,lenght of array = n/4 After 3rd iteration ,lenght of array = n/8 After 4th iteration ,lenght of array = n/16 After kth iteration ,lenght of array = n/(2)^k
Let length of array becomes 1 after kth iteration n/(2)^k = 1 n= 2^k log2(n) = k log2(2) k = log2(n) Time complexity = log2(n)
There is a small mistake in the video; In the function, variable e should be initialized with (n-1) rather than n If you run the program and enter a value greater than the values you have given to the array then you will not get -1 rather you will get the same number as an output!!! which is weird...
Size of array should be a constant number and should be given at compile time. int size=5; int arr[size]; //it generates error int arr[5]; //works fine I don't know why her compiler didn't generate any error when she wrote arr[size]. If i am wrong then please correct me
s - starting index of an array e - ending index of an array Array index range is from 0 to n-1. So ideally, e should point to n-1. In this case, e=n, and if I try to access arr[e] will get garbage data.
Why use binary search?? Simple answer: If n will become very large then simple search will take hours to find element, but same with binarysearch becomes log(n) ( aka in seconds ... ) 👌
Why do we even need to calculate Time Complexity? Is it asked in some interviews? Or is it just for our own understanding and for understanding the call stack?
Agar samjh nai aya to ek watsapp group banatey hey? Or if yo don't want to share number than telegram group, accha discussion, doubt solving ho payega..... What do you think?
now we have 3 different ways of denoting an array: while in function-array[], while declaring array[n] and while calling in linearSearch- just array. What is logic behind this? Why dont we need to specify size of array while declaring
unlike C, in C++ by default for every user input the line control shifts to the next line, unless it is an array and inline and equally spaced inputs can be taken.
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.🙏🙏🙏
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
0:49 linear search
3:30 binary concept
8:00 binary code
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.
Man with the mission 🔥🔥🔥❤️
Like Elon musk 👻😉🤣🤣🤣
@@jaiveer9306 😀😂
@@CricketLover-kc6ln Tera aukat bhi nahi h Sharda jaise prestigious university me admission lene ka
@@CricketLover-kc6ln Tera aukat bhi nahi h Sharda jaise prestigious university me admission lene ka
Man on mission
Well done bhaiya
We love you and always support you
Tera aukat bhi nahi h Sharda jaise prestigious university me admission lene ka
@@pep8221 good joke bro .... sharda prestigious h
@@ashisharyan3028 yesss very much. Even more prestigious than Harvard.
@@pep8221 lol bhai meri toh fir aukaat hi nhi h.....merese toh 12th pass hi nhi kiya hoga
@@ashisharyan3028 koi baat nahi bhai. Agar sharda university me admission nahi hua tho tum koi aur university jaise ki Oxford, Harvard ya Princeton me admission lelena.
whenever mam say 'thik hai' i feel very good
Explaining Binary search complexity is awesome. I like it
Thank you so much AMAN BHAIYA and the whole team of APNA COLLEGE ❤️❤️✨✨
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
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;
}
What is l and r representing?
@@kushagra0347 l represents the left-most index of the half that is to be searched and r represents the right-most index of the half that is to be searched. Initially while calling the function, l is 0 and r is n-1.
@@fundekaustubh Thanks Mate💯🙌🏻
Good ❤️
@@fundekaustubh can we assign first array index as '1' or it is necessary to assign it '0'.
Here she use n but that mean that she is assigning first value as 1.
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.
Yeah...
5:10 pe bola toh hai, addition kis baat ka
@@manasmj imp thing ti remember
Thanks
@@manasmjexactly 😅
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 ❤️❤️❤️
dd, ek baar dekhna... doubt tha...
time complexity of binary search mein...
after 3 interation length of array is n/2^3-1... so after k interation it should be n/2^k-1...
so after calculation time complexity should be log2n with base 2...plz clear the doubt.... btw thanks for the course to every member... lots of love❤❤❤❤
base is ignored while calculating complexity as log base 2 is same log base e / log base 2 and we ignore the coefficients of terms. Here log base 2 is ignored.
constant to be ignored so K = log n + 1 would be same as K =log n
Watching From Pakistan
Love this Channel
Binary Search works in sorted array only.
We have to sort the array first in ascending or descending order if the array entered in unsorted .
Linear Search is better for unsorted array
why is that the end point is n and not n-1 when we keep the start point as 0?
Your pace and voice is so good, it helps to get understand the concept very easily. Thanks
8:52 the value of e = n-1, because the indexing starts from 0.
Yes even I noticed the same thing.. Kindly update if we are wrong.
actually it could be either of the values, cuz vese b hamein exact mid point ki zarurat nhi hai. baad m to check krna hi hai ki key midpoint se bada hai ya chota hai.
No...I think over here because as s=0 and e=n so when you will do (S+n)/2=(0+n)/2 will give exactly half of your array but if you do(0+n-1)/2 you will not get exactly the mid of the array.please think again.
@@hemasingh5668 yeah that is true but there is really no need to find out the exact mid point ryt? Lets assume array 6 size ki hai. (0+n)/2 krte ho to mid point 3 index p ata hai. (0+n-1)/2 se mid point 2 index ata h. And in either of the cases u ll be checking whether your target element is before that index or after that index. N time complexity is also the same in both cases. So the answer ll be d same either way.
gives same result either
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.
Urvi di rocks man!!!🔥🔥🔥❤️
Bhai madam ka pura name or insta account ho to do na , please 🙏🙏
@@vishalprajapati1208 urvi goel!
linear and binary search bohot easy ....and MAM EASY TO TEACH C++...NICE
Urvi di aap hi baki lectures bhi lena you explain these concepts very easily 🤩😍
There is one mistake in last time complexity that after K iterations ,the length of the array becomes = n/2^(k-1)........(12:17)...
I hope , I am right since you are a wonderful teacher and because of you I can find the mistake and can correct it.....
You are right brother
No the mistake is at first line, after first iteration length of the array becomes n/2 and not n
there's no mistake at all. The array size starts from n and after the iterations start, it becomes n/2, n/3, n/4... n/2^k. Note here that k is a random number and not according to the pattern you are thinking which makes it (k-1). Let's say (k-1)=k'. In the video k' is the k. You can co relate this with principal of mathematical induction where we assume the expression to be true for any random k and not some k as per some pattern.
And for those who are saying after first iteration array size should be n/2, that's true but the point is that we have to consider from the point before the iteration starts for calculation of time complexity in which case the size wil be n itself.
So apparently there's absolutely no mistake in the video.
@@bdbrightdiamond That's Correct...👍👍👍👍👍👍👍
@@snehilsinha4689 you r right...
But it should be n/2,n/4,n/8....
Everyone is first until you refresh 😂🔥
Han..ekdom😂
Tera aukat bhi nahi h Sharda jaise prestigious university me admission lene ka
@@arunmaity461 Tera aukat bhi nahi h Sharda jaise prestigious university me admission lene ka
@@pep8221 tum kon hote ho..mera aukad judge karne wala? Aur maine aisa kya comment kiya jisse tum mera aukad estimate karoge?
@@pep8221 aur aisi arrogant stupid idiot ki tarah behave mat karo..isse tumhara khud ka hi respect girega dusro ke saamne..tumhare mata pita kya is tarike se tumhe logo ke saath behave karna sikhaya hai?
Your teaching style and voice is quite good.
Truly amazing content, I just love this series.
This video is well animated and explained nicely! please follow this order
After k iteration ,length of array=n/2^k-1
As
In 1st iteration length =n/2^0
In 2nd iteration length =n/2^1
So
In k iteration length =n/2^k-1
It is simple gm series
Exactly
1st iteration ke baad n/2 hoga kyuki phli baar jab function run hoga to (s + e)/2 se run hoga, so kth iteration n/2^k hoga
Yess! Toh pehle n hi hain array size. First iteration ke baad n/(2^1) and so on!
Thank You So Much Apna College for this amazing lecture 😊
Thank you very much for this DSA course very easy and simple way to learn
This is a best course of C++ and DSA
you way of explaining things is awesome but just try to explain even more deeper because we are beginners
🙂han na aksar cheezay uper sy he guzer jati hai
Great... Kisi ne itna easily nai samjhaya
Thank @apnacollege
I use Java but still this explanation was too helpful
Btw no Nehas were harmed while making this video
Aman bhaiya = indian elon musk in education..❤️🔥🔥🔥
Are ye didi konsi h, she explains really well. Thanks for the efforts
Very Important condition for Binary search is that Array should be sorted But in your code there aren't any lines which shows that.if before searching we code for it then it will be better for unsorted input array also.
hnn we can write a seperate function for that
Because she already has taken sorted array from user.
I always forget about hitting the like button nevertheless I love this series
After K iteration, the length of the array should be n/2^k-1
Yes
Yes
ruclips.net/video/5FsIa4Mp3ho/видео.html
Same doubt
It doesn't matter. Its like subtracting infinity by 1
So
infinity - 1 = infinity
So
N/2^k-1 = N/2^k
Because N is dominant and can be value equal to infinity
I think we need to write while loop like
while(s
didi saying "thik hai" is op !!!
Kya mast Kam krte ho maksood bhai
@Apna college The length of array after k iterations would be n/2 power(k-1) (in the concept of finding time complexity of binary search)
i think iteration starts from 0
i would like to point one specific error, lets say we putted one sorted array and key is same as the last value of array, then it will return -1 because we have initialsed last element e from n, it would be better if we initialise [e= n-1]. In the function defined 'binarysearch', we need to initialize the end from n-1 where n is the size of the arr. I hope this helps.
Sir Please upload the notes it is going to be 1 week of this video being uploaded
Can you please tell at 5:57, it isn't necessary that the user inputs the elements of array in ascending, so how can we solve it then?
@@weasleygaming3 use c/c++ built in sort( ) function.
@@weasleygaming3 Yes, It's necessar to have the inputs in ascending order, thats why it is called binary search. There are other algorithms for searching without a ascending order.
u can sort it beforehand....sort function is available for that
@@TonyStark-ct8xd by after sorting the array index of the elements will change then how would we get correct index
It will index of the sorted array but we want index of the real array that's my doubt
Sir notes??
The time complexity of Binary search is not really O(logn ) because the array was not sorted . SO if i have to sort the array as well using Merge Sort then the time complexity becomes O(logn + nlogn) = O(logn) ... So if it's unsorted then time complexity is O(nlogn) .
just loved the explanation
Sir please provide the notes of this lecture sir. Thankyou. And your course is amazing.
Re ghanta amazing vai sala wise parata hai jaise ki aj hi khatam karna hai pura syllabus ☹️ thoda smjha samjha ka padya na
College mai vi eisa padata hai or yeh vu dise padata hai 😑kahase samjhe patahi nahi chalta hai
@@rakeshpatra7800 Check the time of my comment. Its more than 1 year now. Ab isse kahi guna behtr courses youtube pe hai.
Ma'am ki awaz se pyaar ho gya
Bandhubud aur budbak me apna school tha
AUR yaha pe apna college😍❤❤
Tera aukat bhi nahi h Sharda jaise prestigious university me admission lene ka
@@pep8221 kahi bhi kuch bhi likh rha hai kya tu
@@me-oniichan ye spam krra h pgl
@@puneetchhabra2578 haan
It helped me a lot for my boards exam of computer
After 1st iteration, length of array should be n/2 ..
That's why we can conclude,
After k iteration, lengh of array would be n/(2**k)
she has done wrong! ,right?
That "Theek Hai" hits on another level also kya awesome bandi ha yrr as in your voice is very sweat. Buddy Loved the way you teach xD xD !!
Didi afer kth iteration shouldn't it be n/(2^k-1)
yeah..i too had the same doubt..
@@nimisharaj8501 same here
after the first iteration, it will be n/2.
it will be n before that.
so the formula is n/(2^iterations)
Sab samaj aa gaya now I am confident about c++
end should be set as n-1 since we have 0 based indexing in c++
yes
Yes
Yes bro I have same doubt .
Have you solved it?
@@sohanjangid1207 theres no doubt, it will be n-1.
thats why they have not run the code
Awesome lecture, thanks ma'am❤😊
0:47 agar nahi milega to minus 1 kyu karna hai return..?
There is mistake in finding time complexity of binary search. After 1s iteration our array size has reduced to half but in video they took full size of array .
This is the correct form of solution
Time complexity:
After 1st iteration ,lenght of array = n/2
After 2nd iteration ,lenght of array = n/4
After 3rd iteration ,lenght of array = n/8
After 4th iteration ,lenght of array = n/16
After kth iteration ,lenght of array = n/(2)^k
Let length of array becomes 1 after kth iteration
n/(2)^k = 1
n= 2^k
log2(n) = k log2(2)
k = log2(n)
Time complexity = log2(n)
F bro even on GFG they have also given the wrong soln
Very easy teaching method thanks maam
Sir, it has been 8 months now, please upload the notes of this video. 😃
it has been 1 year 8 months please upload notes😂
@@yashmodi2432 it has been 2 year please upload notes
🤣
3 years
Well done bhaiyah you are the best and your whole team is also best
Shraddha Di.. you rock🔥
Level of explanation aag aag aag 🙏
Konse angle se
@@SonalDhani animation ke angle se🤣🤣🤣🤣
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
@@ThunderBladeZen Hum har jagah par hai 😁! Ashirwad bhava
where is neha search ?
@@singh_04
Neha Search - Concept: Sabka Katega
Neha Search - Time Complexity: 6 to 12 months
Neha Search - Conclusion: ____________! (Fill in the blank)
Bhai ye code glat h chal hi ni mera binary search wala
@@manitsaharan5995 Correct hai Bhai! Ek baar phirse dekho kuch mistake ho rahi hogi apse
Time complexity of binary search is O(log(base2)N)
and for linear search is O(N)
12:11 --After k iteration,i think length of array becomes n/2^(k-1)🙄🙄🙄
true
I was specifically searching for this correction
Yeah..you're right.
There was some mistakes
1-n/2
2-(n/2)/2=n/2^2
3-(n/2^2)/2=n/2^3
.
K-(n/2^k)
Actually 1 was taken wrong
Bhaiya ads daal dete vids mein. Kam se kam kuch support toh milta hamaari taraf se. Thank you so much for this course 🙏🙏👍👍
Pls upload notes of this video it’s been 3 months now🙏🏼
soory bro ..... short while( n
now its 7 months :(
@@shubhsharma19 everyone is not quick in grasping so u should respect it!
@@mauryaashish1865 8 months ;(
10 months
Hi apna college.
Amazing video you have made here, full of learning.
Please can you upload notes for this video??
Regards
There is a small mistake in the video;
In the function,
variable e should be initialized with (n-1) rather than n
If you run the program and enter a value greater than the values you have given to the array then you will not get -1 rather you will get the same number as an output!!! which is weird...
thanks thought same
Notes of this video will be uploaded in a short while :)
PLEASE UPDATE ???
You forgot to mention one thing though while linear search can be used on unsorted data,binary search can only be used on sorted data
Gazab animation bhai 😁
please upload the notes...
thank you for the lecture series
Aman Bhaiya and team you are great
Sir please upload notes of this video.
Thank u aman bhaiya and mam very useful video thank u ❤🖤
When would the notes be uploaded?
Size of array should be a constant number and should be given at compile time.
int size=5;
int arr[size]; //it generates error
int arr[5]; //works fine
I don't know why her compiler didn't generate any error when she wrote arr[size].
If i am wrong then please correct me
she is using mac that's why
In windows we have to give an integer value of size at time of declaration
@@AbdulWahab-fk9yf Maybe, it's because of IDE too
Please, bhaiya upload the notes ASAP. We are counting on you
In time complexity of binary search after k iterations length of array should be n/(2^k-1)
No, as during the first iteration length of array will be n/2 (instead of n) ,the length of array for kth iteration will be n/(2^k)
Bhaiya Everyday I am waiting for you to upload the video...Bhaiya the link in the notes of last video is not opening
s - starting index of an array
e - ending index of an array
Array index range is from 0 to n-1. So ideally, e should point to n-1. In this case, e=n, and if I try to access arr[e] will get garbage data.
ya bro i didn't understand how they able to run false code,,hahahah
Why use binary search??
Simple answer:
If n will become very large then simple search will take hours to find element, but same with binarysearch becomes log(n) ( aka in seconds ... ) 👌
Not hours
there are advance sort also
because of time complexity.
ALLEN A ... I am talking about n as big as billions. If we theoretically calculate it will take hours or days. 🤘
Rahul Sain .... what is that I don’t know ?
Sort or Search ??
These videos are really "awesome"
Why do we even need to calculate Time Complexity?
Is it asked in some interviews? Or is it just for our own understanding and for understanding the call stack?
We find time complexity to make our program fast
Bhai ek baar competitive websites use karke dekh sara jawab mill jaeyga, time complexity kyu zarure hey,
Bohot jarure hey bhai!!!!!!!
@@ganeshmurmu2338 link bhej tu aur bta teko aisa kyu lagta ?
@@sayantaniguha8519 dekho, simplest bhasa mey boley to, competitive coding websites mey difficult questions mey O(n) time complexity wala solution banana parta hey isley time complexity is important
Agar samjh nai aya to ek watsapp group banatey hey? Or if yo don't want to share number than telegram group, accha discussion, doubt solving ho payega.....
What do you think?
Bhaisaab
Kya samjha diya
Neha rocks
now we have 3 different ways of denoting an array: while in function-array[], while declaring array[n] and while calling in linearSearch- just array. What is logic behind this? Why dont we need to specify size of array while declaring
ya same doubt
Bhaiya please upload the notes ... Thank you so much for a great help bhaiya.
In C I was taught that the size can't be declared during runtime . Is it allowed in C++ ?
Yes
unlike C, in C++ by default for every user input the line control shifts to the next line, unless it is an array and inline and equally spaced inputs can be taken.
Please also make a video on logarithm. And also this course is just fantastic
Bro if u dont know anything about log just learn basic or mid and then come back same for derivation and integration
your voice is so good
Efforts appreciated ❤❤
But can you tell me why is this technique named "Binary"?
Because there is a comparison after half of the array ..of mid term and key...it may be true (1) and false(0)..
i.e binary..
@@suraj_chaudhary143 lol no thats not the reason. Its called binary search because in every step the array is being divided into two(bi) parts.
Can you please tell at 5:57, it isn't necessary that the user inputs the elements of array in ascending, so how can we solve it then?
ruclips.net/video/5FsIa4Mp3ho/видео.html
Shraddha mam speaking so sweetly..😂 ... I am watching this video on 31/03/2024 ...❤
yess shocking kinda 😂
12:11 it should be n/(2^(k-1))
Yp i was thinking sane
It is very easy for me😊
Yes , neha is back !
I AM SO OBSESSED WITH NEHA😌