7 posts tagged with "sorting"

Hi, I took the liberty of looking around to see what other interesting sorting methods are out there. One in particular caught my eye. The sorting algorithm CountingSort. This method sorts with an effort $O(n)$. That's also the reason why I'm going to talk about this method.

HeapSort is a sorting method that works with the heap data structure. The method works in-place, since no further storage space (e.g. array, vector etc...) must be created here. HeapSort has an overhead of $O(nLog(n))$ in the best case, average case and worst case.

ShellSort is the last sorting algorithm in my sorting series. Shellsort is a sorting method, which works in-place. ShellSort is the extension of or based on InsertionSort.

BubbleSort is a small sorting method which is quite fast for small amounts of data. BubbleSort works in-place, there is no need to create an extra array. BubbleSort is very naive in that it really compares every element.

SelectionSort is a sorting method, which works in-place, here no new array is created for the sorting. SelectionSort works in bestcase, averagecase and worstcase, with an overhead of $O(n^2)$.

SelectionSort is a sorting method, which works in-place, here no new array is created for the sorting. SelectionSort works in bestcase, averagecase and worstcase, with an overhead of $O(n^2)$.

InsertionSort is a sorting method which is easy to implement. InsertionSort works on the principle that you go through the array to be sorted and compare each element with its predecessor. You start at the 2nd element in the array.