I need to reverse a list in python3 using the function below:
def flip(arr):
arr = arr[::-1]
return arr
I would like to know what the runtime for this function is.
Asked
Active
Viewed 1,212 times
0
-
2`O(n)` (stack overflow wont let me post a comment less than 15 chars) – Keatinge Jul 12 '19 at 01:38
-
1Have you measured it? – Stephen Rauch Jul 12 '19 at 01:38
-
@StephenRauch No but I know it makes a copy, so it cannot be faster than O(n), anything slower would be ridiculous – Keatinge Jul 12 '19 at 01:39
1 Answers
0
using timeit module
timeit.timeit(stmt='pass', setup='pass', timer=, number=1000000)
>>? def flip(arr):
arr = arr[::-1]
return arr
>>? import timeit
>>? timeit.timeit('__main__.flip(range(10000))', 'import __main__', number=1)
0.0005059589886400317
Skycc
- 3,496
- 1
- 12
- 18
-
1What does the returned time indicate? How can you prove the time complexity with a single value? – wawaloo_17 Jul 13 '19 at 02:04
-
The return time is the runtime for the function in seconds. The time complexity is o(n). You can examine the runtime with variable size input list – Skycc Jul 13 '19 at 22:59