ChatGPT解决这个技术问题 Extra ChatGPT

Most efficient way to reverse a numpy array

Believe it or not, after profiling my current code, the repetitive operation of numpy array reversion ate a giant chunk of the running time. What I have right now is the common view-based method:

reversed_arr = arr[::-1]

Is there any other way to do it more efficiently, or is it just an illusion from my obsession with unrealistic numpy performance?

Er... arr[::-1] just returns a reversed view. It's as fast as you can get, and doesn't depend on the number of items in the array, as it just changes the strides. Is what you're reversing actually a numpy array?
yes, indeed, arr is a numpy array.
Hmmm... Well, on my laptop it takes about 670 nanoseconds regardless of the length of the array. If that's your bottleneck, you may need to switch languages... I'm pretty sure you won't find a faster way of reversing a numpy array. Good luck, at any rate!
Well, do you necessarily have to run it inside a loop? In some cases, it's better to make a numpy array with millions of items and then operate on the entire array. Even if you're doing a finite difference method or something similar where the result depends on the previous result, you can sometimes do this. (Emphasis on sometimes...) At any rate, if speed is the primary goal, fortran is still king. f2py is your friend! It's often worthwhile to write performance critical parts of an algorithm (especially in scientific computing) in another language and call it from python. Good luck!
@berto. It is slower since it's a wrapper for arr[::-1]: github.com/numpy/numpy/blob/master/numpy/lib/twodim_base.py. Search for def flipud. The function is literally four lines long.

C
Community

When you create reversed_arr you are creating a view into the original array. You can then change the original array, and the view will update to reflect the changes.

Are you re-creating the view more often than you need to? You should be able to do something like this:

arr = np.array(some_sequence)
reversed_arr = arr[::-1]

do_something(arr)
look_at(reversed_arr)
do_something_else(arr)
look_at(reversed_arr)

I'm not a numpy expert, but this seems like it would be the fastest way to do things in numpy. If this is what you are already doing, I don't think you can improve on it.

P.S. Great discussion of numpy views here:

View onto a numpy array?


Does it help to create a slice object and then reuse it on many arrays?
Actually I just tested it and don't see any difference with the slice object created outside of the loop. (Oh wait, it's very slightly faster. Repeatably 43.4 ms vs 44.3 ms for a 1000000 loop)
What is look_at function suppose to do?
@mrgloom It is supposed to represent any task that looks at the data. The point of the example was to show that the view reversed_arr is still usable after the underlying data was changed. Writing new values into the array does not invalidate the view. Actually you could also use the view for writing new values into the array. reversed_arr[0] = 99 would set the last element in the array to 99, the same as arr[-1] = 99 would.
N
Nico Schlömer

As mentioned above,

a[::-1]

really only creates a view, so it's a constant-time operation (and as such doesn't take longer as the array grows). If you need the array to be contiguous (for example because you're performing many vector operations with it), ascontiguousarray is about as fast as flipud/fliplr:

https://i.stack.imgur.com/QTJga.png

Code to generate the plot:

import numpy
import perfplot


perfplot.show(
    setup=lambda n: numpy.random.randint(0, 1000, n),
    kernels=[
        lambda a: a[::-1],
        lambda a: numpy.ascontiguousarray(a[::-1]),
        lambda a: numpy.fliplr([a])[0],
    ],
    labels=["a[::-1]", "ascontiguousarray(a[::-1])", "fliplr"],
    n_range=[2 ** k for k in range(25)],
    xlabel="len(a)",
)

perfplot requires at least Python 3.6 because it uses f-strings (Literal String Interpolation)
H
Hobo

Because this seems to not be marked as answered yet... The Answer of Thomas Arildsen should be the proper one: just use

np.flipud(your_array) 

if it is a 1d array (column array).

With matrizes do

fliplr(matrix)

if you want to reverse rows and flipud(matrix) if you want to flip columns. No need for making your 1d column array a 2dimensional row array (matrix with one None layer) and then flipping it.


u
user

np.fliplr() flips the array left to right.

Note that for 1d arrays, you need to trick it a bit:

arr1d = np.array(some_sequence)
reversed_arr = np.fliplr([arr1d])[0]

reversed_arr = np.flipud(arr1d) seems to work directly.
A 1D array is deemed one column, not one row, therefore np.flipud (up-down) is to be used, not fliplr (left-right).
u
user

I will expand on the earlier answer about np.fliplr(). Here is some code that demonstrates constructing a 1d array, transforming it into a 2d array, flipping it, then converting back into a 1d array. time.clock() will be used to keep time, which is presented in terms of seconds.

import time
import numpy as np

start = time.clock()
x = np.array(range(3))
#transform to 2d
x = np.atleast_2d(x)
#flip array
x = np.fliplr(x)
#take first (and only) element
x = x[0]
#print x
end = time.clock()
print end-start

With print statement uncommented:

[2 1 0]
0.00203907123594

With print statement commented out:

5.59799927506e-05

So, in terms of efficiency, I think that's decent. For those of you that love to do it in one line, here is that form.

np.fliplr(np.atleast_2d(np.array(range(3))))[0]

Timing something with such a small array is pretty useless. If you want to compare things it'd be better to use something that takes a while, like 3000 or maybe even more elements.
V
Victoria

The slice notation based analog to np.flip would be [::-1,::-1]

a = np.array([[1., 2.], [3., 4.], [5, 6]])
print(a)

out: [[1. 2.]
      [3. 4.]
      [5. 6.]]

b=a[::-1,::-1]
print(b)

out: [[1. 2.]
      [3. 4.]
      [5. 6.]]

J
John Mil.

Expanding on what others have said I will give a short example.

If you have a 1D array ...

>>> import numpy as np
>>> x = np.arange(4) # array([0, 1, 2, 3])
>>> x[::-1] # returns a view
Out[1]: 
array([3, 2, 1, 0])

But if you are working with a 2D array ...

>>> x = np.arange(10).reshape(2, 5)
>>> x
Out[2]:
array([[0, 1, 2, 3, 4],
       [5, 6, 7, 8, 9]])

>>> x[::-1] # returns a view:
Out[3]: array([[5, 6, 7, 8, 9],
               [0, 1, 2, 3, 4]])

This does not actually reverse the Matrix.

Should use np.flip to actually reverse the elements

>>> np.flip(x)
Out[4]: array([[9, 8, 7, 6, 5],
               [4, 3, 2, 1, 0]])

If you want to print the elements of a matrix one-by-one use flat along with flip

>>> for el in np.flip(x).flat:
>>>     print(el, end = ' ')
9 8 7 6 5 4 3 2 1 0

I think you could also use x [...,::-1] to create a reversed view of a multidimensional array without resorting to np.flip, as demonstrated here stackoverflow.com/questions/7416170/…
T
Taher Khorshidi

In order to have it working with negative numbers and a long list you can do the following:

b = numpy.flipud(numpy.array(a.split(),float))

Where flipud is for 1d arra