So, .Net and Java has spoiled me not being “required” to learn any sorting algorithms, but now I am in a need to sort an array in a different languages the doesn’t have this luxury. I was able to pick up on bubble sorting with little issue. However, some sources detest the use of bubble sorting becuase of the horrible performance with average and worst case scenario of n^2 comparrisons. Bubble sorting seems to get the job done, but about tackle a array that has +100,000 elements and has me worried that performance could be an issue at this degree. On the other, some of the other algorithms look pretty intimidating in terms of complexity. My question is, what would be a good follow up to bubble sorting in terms of better performance, but not going off into complexity wasteland in implementation?
As a side note, I am an analyst that the programs as needed, not a CS major. Needless to say, theres some holes that I have yet filled in my programming expertise. Thanks 🙂
There are many options, each with their own trade-offs. As you’ve discovered, Bubble Sort’s trade-offs are that it’s (a) simple, but (b) slow with even remotely large arrays.
Having a good understanding of the data to be sorted helps one decide which algorithm is best. For example:
There is no one sorting algorithm that’s better than all others. Choosing what fits your needs is something that you’ll pick up over time and with practice.