Runtime for reversing an array in python with [::-1] [duplicate]

Question

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.

O(n) (stack overflow wont let me post a comment less than 15 chars) — Keatinge
– Keatinge, Commented Jul 12, 2019 at 1:38
@StephenRauch No but I know it makes a copy, so it cannot be faster than O(n), anything slower would be ridiculous — Keatinge
– Keatinge, Commented Jul 12, 2019 at 1:39

Skycc · Accepted Answer · 2019-07-12 03:38:01Z

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

answered Jul 12, 2019 at 3:38

Skycc

3,5551 gold badge15 silver badges19 bronze badges

Sign up to request clarification or add additional context in comments.

2 Comments

wawaloo_17 Over a year ago

What does the returned time indicate? How can you prove the time complexity with a single value?

Skycc Over a year ago

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

Collectives™ on Stack Overflow

Runtime for reversing an array in python with [::-1] [duplicate]

1 Answer 1

2 Comments

Linked

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

2 Comments

Linked

Related