A big comparison of the basic sorting algorithms

Sorting is one of the main, prominent functionalities of most computer applications and games. We encounter it every time a computer sorts contacts alphabetically, or when a game renders a 2d scene (first, it sorts the objects according to the distance from the camera and then it draws them starting from the back). Sorting is also used when we simply need an amount of data according to some criterion for statistics. For example, sorting students according to their grades at school, employees according to their salary, candidates according to the number of votes they received, etc. Sorting (along with searching) is one of the main requirements of large, commercial information systems. It's speed is the most important property and it depends (disregarding the computer's speed) on the time complexity of the chosen sorting algorithm as well as on the structure of the processed data. If we know principles and time complexities of sorting algorithms, we can save huge amounts of time in our applications. Even operations that take hours to complete can be done in a few seconds when using the right algorithm.

The following work will compare the performances (benchmark) of six different sorting algorithms. The goal is to compare the relative speed of these algorithms on the same machine and on the same testing data, which includes lots of varied items. This should confirm the expected behavior and rate the algorithms according to the time they spend on sorting the items. This way, we'll find out which algorithms should be used for certain types of data and which should not.

Describing the testing conditions

During this benchmark, I tested 6 sorting algorithms based on the mutual comparison of items. Shown below, we have a list of the algorithms, their functionality description, implementation, and time complexity:


...End of the preview...
Continue further

You will gain knowledge worth hundreds of thousands for a few crowns

You've come here and that's great! We believe that the first lessons showed you something new and useful
Do you want to continue the course? Go to the premium section.

Limited offer: Learn all knowledge and save money

Buy lessons and exercise submitting one by one 20 points
Buy all currently available lessons with exercise submitting and other features for an exclusive price 17 points ($1.53)
Currently, you have 0 points
By buying this exclusive package, you'll have access to all 12 lessons in this course including exercise submitting while saving $0.27. This offer is limited for the first lessons only with an additional exclusive 15% discount.
You gain 17 points for adding an article to the site, or for $1.80 $1.53

Warning, by buying just this lesson you'll lose the limited 15% discount for the package of all the lessons.

Buy only the lesson 10 points
Currently, you have 0 points
You gain 10 points for adding an article to the site, or for $0.90

This article is licensed: Premium, by buying this article, you agree with the terms of use.

What will you get from us in the next lessons?
  • Unlimited and permanent access to individual lessons.
  • High quality IT knowledge.
  • Skills to help you get your dream and well-paid job.

Article description

Requested article covers this content:

A big comparison of the basic sorting algorithms, i.e. selection sort, bubble sort, merge sort, heap sort, and quick sort.

You gain points by supporting our network. This is done by sending a helpful amount of money to support the site, or by creating content for the network.

Article has been written for you by David Jancik