what is meaning of big O notation in any time and space complexity and what it shows actually…
Please explain briefly
@AMIT_KUMAR
A computer can do ~10^8 operations in 1 second.
Big O notation tells us the behaviour the algorithm for large values of N (+inf).
What it shows :-
Now you gave me a O(N^2) algorithm and I run it for N = 10^7. that algorithm would take 11 days to run (10^14 operations).
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.