Python – reversed() VS [::-1] , Which one is faster?

Python lists can be reversed using many python method such as using slicing method or using reversed() function. This article discusses how both of these work and Which one of them seems to be the faster one and Why.

Code: Reversing a list using Slicing.

Output:

Original list : [110, 220, 330, 440, 550]
Reversed list elements :
550
440
330
220
110

Explanation : The format[a : b : c] in slicing states that from an inclusive to b exclusive, count in increments of c. In above code, a and b is blank and c is -1. So it iterates the entire list counting from the last element to the first element resulting in a reversed list.

Code: Reversing a list Using reversed() built-in function.

Output: 

Original list : [110, 220, 330, 440, 550]
Iterator object : <list_reverseiterator object at 0x7fbd84e0b630>
Reversed list elements :
550
440
330
220
110

Explanation : The built-in reversed() function in Python returns an iterator object rather than an entire list.

Time Complexity : O(n), where n is the size of the given array. 
Auxiliary Space : O(n)

Conclusion : 

For a comparatively large list, under time constraints, it seems that the reversed() function performs faster than the slicing method. This is because reversed() just returns an iterator that iterates the original list in reverse order, without copying anything whereas slicing creates an entirely new list, copying every element from the original list. For a list with 10⁶ Values, the reversed() performs almost 20,000 better than the slicing method. If there is a need to store the reverse copy of data then slicing can be used but if one only wants to iterate the list in reverse manner, reversed() is definitely the better option.