What is big o notataion
This article maybe help you: https://rob-bell.net/2009/06/a-beginners-guide-to-big-o-notation/
thank you also is it a equasion if so what do the variables mean
So big O notation is one of several notations used to mesure of an algorithms effiency. So imagine you represent how the time complexity of a given algorithm grows as the input size grows. Lets say this algorithms functiom was f(n)=2n^2+5. What big O and the other notations allow us to do is provide generalizations for these functions. Big O specifically represents the upper bound. Immagine your graph your function for the algorithm and the function n^2. As both of the lines for the functions approach infinity there is a number you can multiply n^2 by so f(n) has it as an upper bound. So we can say f(n) =O(g(n)) where g(n) = n^2. Essentially what this means is there exists a positive constant c and x such that 0<=f(n)<=cg(n) for n>=x.
big o notation is a measure of a given algorithms time efficiency relative to the size of its input it measures the worst case performance of an algorithm and ignores constant factors