Complexity of Different sorting by R4R Team

Time complexity:

Bubble sort:
worst case : O(n^2)
Average case : O(n^2)
Best case : O(n)

Selection sort:
worst case : O(n^2)
Average case : O(n^2)
Best case : O(n^2)

Insertion sort:
worst case : O(n^2)
Average case : O(n^2)
Best case : O(n)

Merge Sort:
worst case : O(nlog(n))
Average case : O(nlog(n))
Best case : O(nlog(n))

Quick Sort:
worst case : O(n^2)
Average case : O(nlog(n))
Best case : O(nlog(n))

Radix Sort:
worst case : O(nk)
Average case : O(nk)
Best case : O(nk)

Heap Sort:
worst case : O(nlog(n))
Average case : O(nlog(n))
Best case : O(nlog(n))