This little research carried out to know how efficeint the Golang concurrency feature is! This script consists of the hybrid sorting algorithm (concepts of selection sort & mergeSort) Any N sized array is divided into four (because I have 4 cores (2 real cores and another two are virtual core through hyper-threading in intel i3) sub-arrays and they are called concurrently for sorting. Once these four sub-arrays are sorted, function merge merges those sub-arrays and returns a final sorted array. below are the statistics for input size 1 million (10^6) integers,

1. simple selection sort in Go takes around 4 min
2. hybrid selection sort with concurrency in Go takes around 1 min
3. simple selection sort in C takes around 3-4 min
4. simple selection sort in Python never gonna process this sized input (it will take many days)

note: these results are machine specific and time complexity of selection sort will always remain O(N^2) for any programming language. but execution speed may vary from language to language.

fun fact: if python's execution time is x then, Go with concurrency (160x) faster > Go (40x) faster > C (10x) faster > python (x)