What is the order of growth of time complexity of this method?

Question

I'm learning java and I came across this term and simply still dont understand the concept. So what is time complexity and how do a calculate it?

https://code.sololearn.com/c345RgHQpYit/?ref=app

Answer 1

So you know what time complexity is and want to know the time complexity of your code? I'd say O(n^2) because the whole list of numbers has to be iterated over with one nested loop, so there are length * length steps.

https://en.m.wikipedia.org/wiki/Time_complexity

Answer 2

I'm not sure but I think time complexity means the time for performing an action (for instance sorting an array).

Answer 3

Théophile yeah I know that part. Just dont know how to calculate it

Answer 4

Just store in a variable a the actual time at the beginning of your program. Then, at the end, take again the actual time and subtract it the number store in variable a

Answer 5

Function to get actual time, in millisecond, is System.currentTimeMillis()