I got a question that's asking "A very large array of elements is to be sorted. The program will be run on a personal computer with limited memory. Which sort would be a better choice: A heap sort or a merge sort? Why?"
I'm thinking a merge sort because it breaks the data down over and over til it can't anymore and merges them back together. A divide-and-conquer approach basically. I'm wondering if you'd give an input on it. I'd sure appreciate it.