Less known than others presented here sorting algorithms, but quite interesting one for how it pre-processes the data. Comb Sort is basically an improved bubble sort, which allows it to run in O(n log n) time in average cases. Unfortunately, the worst case is still O(n2). The main idea behind the Comb Sort is to … Continue reading Comb Sort

Another elementary but interesting sorting algorithm. Its time complexity is O(n2), so every time the size of an array to be sorted is doubled, the efforts quadruple. Insertion sort starts from index 1 by remembering its value and comparing to the value under index 1 - 1. If the value under previous index is less … Continue reading Insertion Sort

Bubble sort is a really simple sorting algorithm, that has O(n2) time complexity. Its name comes from the fact that, if you would imagine an array to be sorted standing vertically, then (depending on the direction of sorting) the smallest or the biggest values would always bubble up one by one, until the whole array … Continue reading Bubble Sort