A big comparison of the basic sorting algorithms

Algorithms 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...

Premium article

Premium article

ict.social is a large database made up of manuals and tutorials, whose main goal is to provide high-quality IT education to everyone. We started out in the Czech republic, where we display roughly a million articles per month and receive plenty of gratitude from our users. Thanks to our successful establishment, we are now bringing these articles to the rest of the world.

Although we are trying to keep our content free of charge, maintaining the site is a huge effort for everyone involved. Therefore, some content (exercises and more advanced material) costs network points. Don't worry, they're really cheap :)

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.

Buy just this article

To access the article, you need 10 points
Currently, you have 0 points
You gain 10 points for adding an article to the site, or for $0.90

Buying this article gives you unlimited access to it forever. You will learn some more and help us keep giving our site maintenance which helps you and others get better futures. It's a win-win.

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

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.

You can get points immediately using:

Credit card SMS Wire transfer
Credit card SMS Wire transfer

 

Article has been written for you by David Jancik
Avatar
.
Thumbnail
All articles in this section
Algorithms
Activities (3)