Geek Answers Handbook

Is gypsum used in practice?

Quicksort is superior to Heapsort in practice. Mergesort is the only stable of 3 (in simple variations of vanilla). Thus, it is either quicksort or mergesort, which will be used depending on the situation (in place in memory or external sorting, etc.)

So is there ever a case where the heap data structure is really used for sorting? No matter how much I'm 'Google' or trying to come up with applications, you almost always choose merge / quick sort by heapsort. I never came across a case where a bunch of sorting is really used in my professional life. What would actually be a good use case for heapsort in practice (if at all), out of curiosity?

+8
performance sorting heapsort
source share
1 answer

Some benefits from my head (will amend this list after I do some more research:

  • Almost sorted sets benefit from sorting with heapsort.
  • Space-conscious environments often prefer the complexity of O (1) space in heapsort. Think about embedded systems.
  • Huge datasets benefit from guaranteed O (nlog n) runtimes, unlike the likely best quicksort runtimes. Think about medicine, space, life support, etc.
+5
source share

More articles:


All Articles