data that is to be processed next and the heap is a memory location where the C program stores the
data that is to be processed next but the data that is to be processed next is not always stored in the
same location as the data that is to be processed next because the C program can keep data in different
memory locations depending on the situation and this is why it is important for you to understand the
stack and heap because you will be able to understand the C program better and be able to ask more
questions on the C program. Alright ... I 'm talking about C program that 's why I say that you get a good
picture of memory with the help of C programming therefore , data structures and algorithms is best
learned from C and C++ Now here I am dividing it into segments so there is thing called code segment let
's say this is my code let 's say there is a code with the name `` harry.c '' now this code will be first loaded
into my main memory I told you what is the first thing that happens ?then it will come to this line it will
come to fun1 ( ) , it will execute fun1 ( ) . fun2 ( ) is calling inside fun1 ( ) now the variables that I had
created inside it will be created here let 's say I have created `` k '' & `` l '' let me write here : initialize k
and l and after that I 'm calling fun2 ( ) so as soon as fun2 ( ) will be called it will say to fun1 ( ) that you
wait for a while , I call fun2 ( ) and be back by fetching the value whatever it will return fun1 ( ) replied
that you go and get it call fun2 ( ) and get its value .
required in that ok. Now, considering I turn on my computer In that , I will need time L1 After that what
happened ? Consider all preparation I required L1 which will be a constant 5 secs,2 secs , 10 secs. If
there is an SSD in your computer then it will open in 4 secs If you are using a supercomputer then it can
even open in 1 sec. L1+ consider your speed is L2. Ok, so it takes a constant speed of your This is not
equal to. Writing equal to is wrong here. So here I will say that The most difference that will be visible It
will be because of this term. Because n to power 1 , if I increase input and make it 10 lakh. So this was of
2 lines but this will become 10 lakhs. So the higher degree term in the polynomial In any equation The
most impactful term It is taken ok. So I picked this because in comparison with n to the power 0 it is big.
And I want to see things in a simple way.
Big O of n square. Big O is a log that scales according to the time required to run your algorithm. Linearly
if your time scales with the input size. If it runs in linear time Big O. If your time runs in constant time,
Big O is 1 ok. O in the industry means the order of And its mathematical definition that I will tell you.
Industry definition is a minimum of this. But when you are answering in industry Then industry definition
is used. When I use its mathematical definition then I say Big O But when I give industry definition Or I
am answering any interview. Then I will say an order of because big O has a different definition. But they
are used interchangeably. The graph of Big O of 1 is plotted like this. It does not mean it is 1 's graph. Do
n't confuse it with the x=1 graph. This is the graph of x=k. Constant , whatever constant was there in
constant time it was running. And this y=mx+c It can be somewhat distorted.
data that is to be processed next but the data that is to be processed next is not always stored in the
same location as the data that is to be processed next because the C program can keep data in different
memory locations depending on the situation and this is why it is important for you to understand the
stack and heap because you will be able to understand the C program better and be able to ask more
questions on the C program. Alright ... I 'm talking about C program that 's why I say that you get a good
picture of memory with the help of C programming therefore , data structures and algorithms is best
learned from C and C++ Now here I am dividing it into segments so there is thing called code segment let
's say this is my code let 's say there is a code with the name `` harry.c '' now this code will be first loaded
into my main memory I told you what is the first thing that happens ?then it will come to this line it will
come to fun1 ( ) , it will execute fun1 ( ) . fun2 ( ) is calling inside fun1 ( ) now the variables that I had
created inside it will be created here let 's say I have created `` k '' & `` l '' let me write here : initialize k
and l and after that I 'm calling fun2 ( ) so as soon as fun2 ( ) will be called it will say to fun1 ( ) that you
wait for a while , I call fun2 ( ) and be back by fetching the value whatever it will return fun1 ( ) replied
that you go and get it call fun2 ( ) and get its value .
required in that ok. Now, considering I turn on my computer In that , I will need time L1 After that what
happened ? Consider all preparation I required L1 which will be a constant 5 secs,2 secs , 10 secs. If
there is an SSD in your computer then it will open in 4 secs If you are using a supercomputer then it can
even open in 1 sec. L1+ consider your speed is L2. Ok, so it takes a constant speed of your This is not
equal to. Writing equal to is wrong here. So here I will say that The most difference that will be visible It
will be because of this term. Because n to power 1 , if I increase input and make it 10 lakh. So this was of
2 lines but this will become 10 lakhs. So the higher degree term in the polynomial In any equation The
most impactful term It is taken ok. So I picked this because in comparison with n to the power 0 it is big.
And I want to see things in a simple way.
Big O of n square. Big O is a log that scales according to the time required to run your algorithm. Linearly
if your time scales with the input size. If it runs in linear time Big O. If your time runs in constant time,
Big O is 1 ok. O in the industry means the order of And its mathematical definition that I will tell you.
Industry definition is a minimum of this. But when you are answering in industry Then industry definition
is used. When I use its mathematical definition then I say Big O But when I give industry definition Or I
am answering any interview. Then I will say an order of because big O has a different definition. But they
are used interchangeably. The graph of Big O of 1 is plotted like this. It does not mean it is 1 's graph. Do
n't confuse it with the x=1 graph. This is the graph of x=k. Constant , whatever constant was there in
constant time it was running. And this y=mx+c It can be somewhat distorted.
