Can anyone explain the Big O(n) in finding the complexity of an algorithm?
Thanks in advance
@Stephen Davies: Both of your links don't work because they include the trailing parentheses as part of the address.
Last edited on
Ok thanks for your replies :)