Комментарии:
Thanks sir
Ответитьplease make video on recursive function in binary search
ОтветитьVery helpful
ОтветитьIt is wrong
ОтветитьIn your code if you put uneven elements in your array and you target let's say number at index 3, your program will loop forever. So it is better to round your mid to the nearest integer : mid = (int) round((low+high) /2); and include math.h lib.
good explanation thank you
edit: you can also put your mid calculation inside while loop so you don't need to type it again inside else statement.
The program doesnot work
ОтветитьYou gave my assignment answer. Now, I don't need to expentidture much time.🙂
ОтветитьCould you share the source code;
ОтветитьSuper
Ответитьhow it is working ? shouldn't we include mid = (low+high)/2 inside while loop statement
ОтветитьSir, how about we write the largest values to smallest value in binary search in array? Can u teach us?
ОтветитьAren't we supposed to refresh the mid variable in the first if statement ? Like the following :
if(array[mid] < a){
low = mid+1;
mid = (low + high)/2;
}
sir the program is not running properly
ОтветитьExcuse me, please explain this program.
ОтветитьNot working bsdk
ОтветитьThank u so much
ОтветитьHello!
Thank you for the video, it really helped me!
Greetings from Mexico!
at starting it is showing private identifyier is not allowed
ОтветитьThank you so much, You got another subscriber
Love from Sri Lanka
Thank you so much, You got another subscriber
Love from Sri Lanka
Silent teacher who teachs us to understand c program
Thank you so much sir!
Great job u doing
Grow more. Teach more
And sry my English is little bad
What I feel that right I wrote😊
It works 100%
Ответить