Binary Search Examples | Unsuccessful search | Design & Algorithms | Lec-14 | Bhanu Priya

preview_player
Показать описание
Examples of Binary search on sorted array ( Unsuccessful search)
Рекомендации по теме
Комментарии
Автор

Hi am I teacher and I’m just giving a review and I think that this teaching was nice and a good explanation but there was a allot of stuttering and was a lot of uh uh but over all the teaching was nice I was watching this vid because I wanted to teach my students about this ch and they understood it very well u showed the vid and they also liked it… but over all great teaching👍🏻👍🏻

MsBlxebxrry
Автор

is there something wrong? Because, in last array if 8<mid 2=9 then why in the 1st array 8<4=32. cause the value of 8 is greater ther the value of 4?

ahonarupanthi
Автор

Very clear to understand the explanation. Thankyou very much for creating this video :))

ramithapeiris
Автор

MAM ONE QUESTION HOW ARE YOU TAKING KEY ARE YOU ASSUMING ON YOUR OWN OR THERE HAS TO BE FOLLOWED SOME PROCEDURE FOR TAKING KEY, WAITING FOR YOUR RESPONSE SOON TO HELP ME CLEAR MY DOUBT.

samriddhsharma
Автор

Very good explanation, thank you very much

srikanthb
Автор

Ur teaching was vry good and clear cut ans.... Thank u for gd teaching

asuvathiAruna
Автор

Thank you so much for explaining the unsuccessful search.

mohammadshafayethaydar
Автор

Mam if key value is 8 means 56 and mid value is 4 means 32 so 56> 32

So mid +1 hoga I think plz reply
@Education 4u

siddharthadubey
Автор

Start < end this is unsuccessful search I found is this right ✅

syednaveeth
Автор

Thanku madam for your great information..

abhijithlenin
Автор

What happens if we search element is 12 it between in last step 11 and 12, and our last middle search 11 is middle number then how we calculate

unknownboy-rhxx
Автор

keep it up girl it is good explanation

papibrawn
Автор

plz do a time complexity calculation video you have only explained space complexity

TxK
Автор

Mam Binary search algorithm ki meru chapina successful and unsuccessful eampls exms lo rayacha...mam

sasimadhu
Автор

Mam linear search video i want mam please mam

shaikhibza
Автор

Key value ela decide chesthunav madam mana istama adhii

nandeeshwarreddy
Автор

a=[5, 7, 9, 13, 32, 33, 42, 54, 56, 88]
z=34

low=0

high=len(a)-1

while low<=high:
m = (low+high)//2

if a[m]==z:
print("Found", a[m], "at position", m)
break
elif a[m]<z:
low=m + 1

elif a[m]>z:
high=m - 1


print("Not Found")

print("Crafted by: Subham Roy")

subhamroy
Автор

is there have any linear search videos link

ahamedthilsan
Автор

Mam ne to 2rings pahiny hvi hn both hands😀😀

umarchandio
Автор

How did she understand this topic, she explains as if it is very simple

yisahkelvin