What is O(Log N) with Binary Search Algorithm - One of the most important interview questions

[@hajeeramohamad7641]

You teach really well sir. Please post more videos on this playlist.

[@abhiranjanpandey3098]

What way u explain this is very good but please increase you context font size

[@palr8741]

Could you please make video for all sorting algorithms? I was just try to understand Merge sort from others video but seems like they are just blabbing.

[@subratosarkar234]

Hey Naveen, Awesome explanation. Can you pls create detailed analysis video of space complexity as well.

[@amuthansakthivel3393]

Very well explained Naveen 👌 As usual awesome content. 👏👏

[@hajeeramohamad7641]

int mid = (low+high)/2. Isn't it? Or am I missing something?

[@Swarno2004]

You are right

[@satishkumar-gg5vs]

Naveen ,it will be a great help if you post a video on "O(loglogn)"

[@vinodkumarbilakanti6311]

Great video, Thanks Naveen,
One dought!
First 2 is at 7th position.
After arrays.sort(arr)--> 2 will be sorted from 7th to 0th position.
So the o/p is 0.
Am I correct?

[@gunjankapoor9163]

int[] arr= {3,4,5,6,7,8,9,1,2};
Arrays.sort(arr);
int search=2;
The result is: At index: 1
I think this is correct, @Naveen. Can you please confirm

[@amorthyoghosh449]

Hi Naveen, thank you for such awesome videos. Can you please make videos on Graphs and BFS and DFS.
Thanks

[@naveenautomationlabs]

Will try

[@amorthyoghosh449]

@@naveenautomationlabs thank you