title: Efficient sort algorithm in terms of memory usage?
body: <p>So for a project I am working one of the parts needs sorting. This is all done in MIPS assembly language. Currently I am debating between using either Insertion or Bubble Sort. I know these two are slow compared to Merge and Quick sort but I am trying to get this is the least number of static/dynamic instructions. Which one would be more efficient in this case? I feel like there is always a trade-off between speed and memory usage. Is that true? </p>