Why Binary Search is O(log n)

Показать описание

FAANG Coding Interviews / Data Structures and Algorithms / Leetcode

Рекомендации по теме

Комментарии

Master Data Structures & Algorithms For FREE at AlgoMap.io!

GregHogg

It's quite important to mention that this only work with a sorted array.

thibauldnuyten

Thank you Greg for short clips that not only helps to revise but are also handy at times!

SiddhantSancheti-kkzd

Love these shorts to brush up my DSA topics... Keep making!

Aman-xoyx

bcos when you count up 2, 4, 8… it’s 2 to the power of n and when you count down by dividing, of course it’s log2(8), log2(4), its logN.

radiosparrow

Technically log base 2 of n but we ommit that from time notation

Matt-skhi

God I love binary search. I know, I know quicksort under the hood for sort, but come on, this is fantastic.

askholia

Thanks for doing this video! Do you have a video talks about dynamic programming, DFS, BFS, minimum spinning tree, minimum path?

kapokwok

Can you do a big O calculation for Ologn?

__--__--__--__--

I was wondering abt this

Given an unsorted array (assume its quite big), and we want to check if the array contains a specific element if we want to use binary search we would need to sort it first and the most efficient sorting algorithm so far (afaik) is O(n log n, like quicksort) and then we use binary search, but would a linear search with O(n) would be better since its linear runtime and also didnt modify the array?

ryaninkachandra

What if its not sorted whats the best approach

Etk

Hello did you made a video about what is the best sorting algorithm ?

sharokhkeshawarz

As if you will get a sorted array. And If you do receive a sorted array, you can kiss your performance goodbye even before you start.

tazanteflight

You should include the fact your y-axis has 0 on the right instead of the left like a normal graph would

airkami

Doesn't this only work on a sorted array? Otherwise your value might be on the side you remove?

peettims

O(log n) is whenever search get devided by halve

joeblack

hey, nice video as always, can you answer why is merge sort n*logn

badreddineboukheit

Whats the log of 2^10, it's 10log(2)

thebeastsclips

Thank you for the video but you didn’t explain why its logN

vetirs

You missed the most important part which is it has to be sorted 😅

TRXTRZ

Why Binary Search is O(log n)

Why Binary Search is O(log n)

Binary Search Algorithm in 100 Seconds

How the time complexity of binary search is O(logn)? | Kirti Gera | GeeksforGeeks C/CPP

Deeply Understanding Logarithms In Time Complexities & Their Role In Computer Science

WHY time complexity of Binary Search is log(N)?? #shorts

Binary Search (Sorted Array) - O(log n) [ Best EXPLAINATION Algorithm]

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

What is Binary Search Algorithm and Time Complexity O(logN) Explained | Algorithm | Search Algorithm

Binary Search

Binary Search Algorithm - Simply Explained

Binary Search Algorithm - Computerphile

Binary Search Explained!

Simple Explanation of Binary Search, Recursion, Logarithms, O(log n)

Analysis of Binary Search Algorithm | Time complexity of Binary Search Algorithm | O(1) | O(log n)

Logarithmic runtime and Binary Search Explained in 5 minutes

Big O Complexity Ranking for Algorithms!

Binary Search O = Log N

Binary search in 4 minutes

Big O(Log N) - Logarithmic Time Complexity || Binary Search Algorithm

Why does log(N) appear so frequently in Complexity Analysis?

Big O, Math, Logarithms, Heap, Binary Tree, and Computing Explained with Simple Live Example

The Binary Search Algorithm: How It Works & What It Is Used For

Binary Search Animated

Learn Big O notation in 6 minutes 📈