Binary Search | Order Agnostic Binary Search | What is O(logn) | Data Structures and Algorithms 

Hi Madam, Thanks for your priceless teaching. A small correction in the descending order loop when re-assigning mid. You have mentioned as if(target > arr[mid]) -> end = end - 1 if(target < arr[mid]) -> start = start +1 (it works but it will take more number of loops than log2n). I guess that the suitable assignments are if(target > arr[mid]) -> end = mid - 1 if(target < arr[mid]) -> start = mid +1

Akka i am nithish kumar finally i got job in accenture with help of ur java tutorial akka 😇😊🥳🤩🤩really i am very happy tamilla ungaloda video full ah pathen akka now got selected akkkaaaaa

Mam, I understood the concepts of O(logn). Thanks.

Akka enakku enna soldrathunu therla unga teaching Mathiri ethuvum na ithu varaikum paakala,romba super ah alaga puriyura Mathiri solli tharinga,na epovum ungalukku support pandran Akka ungala la na neraya kathukuran ungalukaga nanga share kudava panna maatom,innum neraya unga kitta irunthu ethirpaakurom ungala support pandra engalukkagavathu ninga neraya video podanum 😊unga teaching pathi solla varthaigale illa amazing 😍

In the descending array in if case end= mid-1 and in else case start=mid+1 that would be right? Why are you giving like start=start+1 and end =end -1

Akka Hash table ,Two Pointer , Bit Manipulation, Heap (Priority Queue) , Dynamic Programming inthamarri DSA Topics Podugaka Tamil la Cleara Explain Pana aaluilla plz mudinja aalavuku sikiram podugaka

Mam athula descending apo start =mid+1 than varnum neenga start =start +1

Good Explanation ❤

21:22 I found it first and confused little and I waited for this..😅

@20:47 should it not be end = mid-1?

Akka sliding window algorithm pathi podunga akka

Neega maatum yea placement trainer ah irundhigana Naa Google company la select agirupen....

Akka please do post more problems on binary search .

18:33 ithula while loop la neega kodutha condition 🔁repeat agikite irukumla sister. Alternate condition ethachum solluga sister

8:26 akka previous la entha video akka paakanum ninga yen intha idathula static use pandringa apdindratha therinchuka

Akka stack data stucture topic podunga akka

🙏🙏

Mam Na Binary search Vera Method la try pani irken Mam Athu Sari yanu pathu sollunga mam And efficient aa nu solunga Mam ungaluku epti Nan code aa send panrathu mam ungaluku

Akka graph,binary tree structures

Eclipse eppidi proper ah install panra javakku endu oru video podunga romba complicated ah irukku install panrathukku.! 😓

mid=(start+end)/2 it may overflow in the bigger value mid=start+(end-start)/2 many youtubers suggest this it is ture...?

Live?