How do I work out the Big O of my own code?
Count how the number of basic operations grows with the input size. A single loop over n items is O(n); a nested loop is usually O(n squared); halving the problem each step gives a log factor. Then drop constants and lower-order terms. Deriving it is what is assessed, not quoting a table.
This comes up on Data Structures and Algorithms, where it is answered in the context of the work itself.
Not what you asked?
Ask us the actual question
Send the draft, the rubric or the score report with it. You get a real answer and a price before you commit to anything.