let problem A of size is n.
Big O says time taken by best algorithm that solve every case(best, avarage, worst) of problem A completely.
in general Big O is "The Best algorithm of worst case input".
it also determines the max size of problem that can be solved in given amount of time.