Sorting algorithms

The most common category of algorithm has to deal with sorting data, that is, placing it in a given order. The two most famous sorting algorithms are the following:

• Quicksort: This is considered one of the fastest sorting algorithms. The average time that quicksort takes to sort its data is O (n log n), but this can grow up to O(n²) in the worst-case scenario, which mainly has to do with the way the data is presented for processing.
• Bubble sort: This algorithm is pretty easy to implement with an O(n²) average complexity. If you want to start learning about sorting, start with bubble sort before looking into the more difficult to develop algorithms.

Although every algorithm has its disadvantages, if you do not have lots of data, the algorithm is not really important as long as it does the job.

What you should remember is, the way Go implements sorting internally...