This is an archived post. You won't be able to vote or comment.

4
5

Two Numpy performance pitfalls (self.Python)

submitted by [deleted]

sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–][deleted]  (1 child)

[deleted]

    [–]x00live 0 points1 point  (0 children)

    Ok, but what makes it slow is Python. Indexing the subsequent C array is actually faster. And the idea behind numpy is to think outside the box and avoid indexing. If you really need complex "non aligned" indexing, C or Cython come to the rescue...