title: What is the time complexity and space complexity of array[::-1]
body: <p>When reverse a list in Python, I usually use the array[::-1] for reversing and I know that a more common way might swap from two sides of the list. But I'm not sure the difference between these two solutions such as time complexity and space complexity.</p>
  
  <p>Code for this two methods below:</p>
  
  <pre><code>def reverse(array):
      array[:] = array[::-1]
  
  
  def reverse(array):
      start, end = 0, len(array)-1
      while start &lt; end:
          array[start], array[end] = array[end], array[start]
          start += 1
          end -= 1
  </code></pre>