In the first lecture of time complexity sir made a program which gives us the time of running of bubble sort and merge sort and in that he put different values of input to check time taken and he said that time complexity of bubble sort is O(N2) because when we increase the input by a factor of 10 the time increases by factor of 100 i.e 10^2. So, I have a doubt that is this analysis is called practical way of determining time compexity.
Regarding time Compexity
Sir has used all these values to give an insight of how complexity varies as we increase the value of n. It is very much evident from the graphs plotted.
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.