Skip to main content

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

4
  • I saw many examples about numpy and numarray. I can choose to use quick or merge to sort using the default numpy lib, these part I understand, but I try to implement a bubblesort using the numarray without success Commented Jun 15, 2009 at 18:16
  • I don't understand what you are trying to do: just as an exercise ? Why using numpy instead of lists ? Commented Jun 16, 2009 at 7:11
  • It was an exercise for my class of programming languages. I thought the cause of the python's low performance is because everything is objects and I think developing a solution using numpy (numarray) will increase performance Commented Jun 17, 2009 at 1:03
  • 3
    numpy will be even worse for this - the speed of numpy comes from so-called vectorization, mostly, where loops are implemented in C on native types (C int, float, etc...). But in your case, since you need to access each item, it will be very slow, as every item you will swap will be at the python level. Not only will you get the python object overhead, but also the conversion overhead ! If that's an exercise on bubble sort, I don't see any point in being fast, BTW. That's like asking a fast Fourier transform without using FFT. Commented Jun 17, 2009 at 4:18