This repository contains the most common sorting algorithms.
This is the "easiest" of the provided algorithms. The complexity of this certain algorithm is O(n²). Read more: https://en.wikipedia.org/wiki/Bubble_sort
This algorithm has the complexity O(n log(n)) and is the best sorting algorithm when you are comparing elements in the array. Read more: https://en.wikipedia.org/wiki/Merge_sort
The most efficient of the provided algorithms is Counting Sort. The complexity of Counting Sort is O(n). The downside of this sorting algorithm is that the maximum element in the array needs to be smaller or equal to the maximum Array length. Read more: https://en.wikipedia.org/wiki/Counting_sort