Which sorting algo is better when array size is large? And why?

Answer 1

It depends more on your data than anything else, but quicksort will most of the time be the right choice as it has great average case performance. Heapsort and sometimes merge sort can be close contenders.
If your data gets really really large you will start to need sorting networks and they come with their own algorithms like bitonic sort.

Answer 2

good question and thanks for the information 💕🙌