Data Structures - 3 | Big-O Notations, Time Complexity | Tamil 

I had a lot of confusion about Big(O) in college. But your explanation makes it crystal clear. Thanks bro🤗. Keep it up bro😊

Code Example: If there is no input, then it’s called a constant time algorithm. For example: for (int i = 0; i < 1000000; i ++) x++; above is O(1) ------------------------------------------------------------------------------ Let’s go through some code samples and analyze their runtime complexity. for (int i = 0; i < N; i ++) x++; All we need to do is count the number of times the statement x++ will execute. Clearly, it’s N, so the time complexity is O(N), also called linear. ------------------------------------------------------------------------------ for (int i = 0; i < N; i++) for (int j = 0; j < i; j++) x++; How many times the statement x++ execute: So the time complexity is O(N^2), also called quadratic. --------------------------------------------------------------------------- Logarithmic Runtime ************************************************** Iterating powers of a number # Let’s analyze the loop below where we iterate over all powers of 2 for (int i = 1; i = 1; i /= 2) x++; --------------------------------------------------------------------------- Harmonic series # Consider the piece of code below: for (int i = 1; i

Tnq u bro 4 this series I had a very big confusion and now cleared

Anna, array la five elements iruthuna ippa voru elementa firstla insert pannuna athula five operation nadakuma O(5)

Thanks Bro,Good Explanation in Tamil, Keep going

Let's say we have a excel with data of students I will find the students name by using dictionary (since key cannot be duplicated ) it will be O(1) - search operation. Correct ? And also here memory will be taken more since we may have lot of students data Is my understanding correct ??

Bro inthe series le full dsa upload pannirukkingelaa?

Very clear explanation

Nice explanation 🎉...impressed

Bro can u please upload some video for big omega and big theta

Eye opener

Vere level bro neenga

Bro Semma broooo........

Thank u so much

O (4) na idhu max operation or minimum or fixed operations ah?

Super explanation thanks anna 👍

Explain the Greedy , dynamic,brude force algorithm bro

Bro what is mean by operations ?

Programa apply panni soli tharunka Anna.

Nice bro, good explanation

Nicely explained

Does data structure fefers to program bro

Anna data structure ah just therichi. Irutha ppothuma illa practice pannanum Anna

Thanks

which one is mostly uses!

Thanks na😍😍😍👍

Super bro

👍

Oru function ku O() epdi find pannuvanga?

Purila😥

Epdi calculate panra endu sollunga bro

DAA class plz

Bro How to contact you bro