arrange the sorting algorithms ascending wise

Question

What is the  ascending wise order of sorting algorithms which takes least time and least space to sort the elements?

Answer 1

i think it should be heapsort because time complexity is O(n log n) and space complexity is O(1)

Comments

i am stil not clear with the reason that why Quick sort is better and faster.

please dont copy and paste from quora that i can also do .

if you can please explain with proper reason please tell by giving example

---

Example is there in my previous comment. and i also read that allocation stack space is cheap. If my comments are not making sense then i'm sorry but i tried :)

---

Merge sort take time complexity as O(nlogn) and space complexity as O(n). I think this is sorting algo take most time in respect of the time complexity as well.