Selection sort vs bubble sort vs quicksort

This method is called after the random samples are generated. The method DrawSamples draws all the samples on the panel. On the form are placed two panels called pnlSort1 and pnlSort2 where the sorting visualizations are rendered.Д®very algorithm has its own method named by the name of the sorting algorithm and accepts an IList parameter and returns an IList object. In includes a form called frmMain where you can choose sorting algorithms, set the number of samples you want to sort, sorting speed, and select whether you want to create an animated GIF file. The second project called SortComparison is the main part of the solution. More information about this project can be found there. This project is based on the NGIF project. First project called Components provides classes for creation of animated GIF images.

This project also allows users to save outputs into the animated GIF picture and set speed of sorting. I have decided to create GUI visualization for sorting algorithms. All algorithms presented here have been written in C# and a lot of ideas are based on algorithms you can find on Wikipedia.

In this article, I will describe some sorting algorithms. Efficient sorting is important for optimizing the use of other algorithms (such as search and merge algorithms) that require sorted lists to work correctly it is also often useful for canonicalizing data and for producing human-readable output.

The most-used orders are numerical order and lexicographical order. According to Wikipedia, the sorting algorithm is an algorithm that puts elements of a list in a certain order. The first thing I consider to be the most important to understand is what sorting algorithms are.

Selection sort vs bubble sort vs quicksort