I was looking into the time taken for each of the sorting functions to be run and I’m quite confused as to why Divide and Conquer or any sorting algorithm is used when the in-built one is miles faster.
This is run on 10000 samples. Since I’m new I can only post a single Image. However, if I can attach images to the comments, I will.
If this has been answered or a related topic is answered, please re-direct me.