Algorithms
Introduction to the theory of algorithms
We'll introduce algorithms and define what they are, understand the asymptotic time complexity, and explain other terms such as Stability or In Place.
Bubble sort
This article is a description of the Bubble sort algorithm (bubbling / bubble sorting), which is used to sort numbers according to their values.
Selection sort
The selection sort algorithm sorts numbers according to their values. We'll go over it in detail and do some examples in the Java and C# languages.
Merge Sort
The merge sort algorithm sorts items in an array based on their values. You'll get a detailed description of the algorithm with diagrams.
Insertion sort
This article is all about the insertion sort algorithm, and includes a detailed description, drawing, and source codes for Java, C#, and Delphi.
Heapsort
This article is about the Heapsort algorithm. Featuring detailed descriptions, drawings, and source codes for Java, C#, and Delphi.
Quicksort
This article is a description of the Quicksort algorithm, which is used to sort numbers according to their values.
Counting sort
This article is about Counting sort, which is able to sort numbers according to their value in linear time. Source codes for languages Java,C#,Delphi,Ruby.
Cards to practice sorting algorithms
Feel free to print these cards out. They'll help you practice sorting algorithms and understand how they're put to use.
A lower approximation of the sorting problem complexity
Proof of the lower approximation of sorting problem complexity based on the mutual comparison of items. The decision tree will be incorporated.
A big comparison of the basic sorting algorithms
A big comparison of the basic sorting algorithms, i.e. selection sort, bubble sort, merge sort, heap sort, and quick sort.