Discussion on: Common Sorting Algorithms in JavaScript

[edh_developer]

Heapsort would be a good one to cover.

A few reasons:

• heapsort is a good example of a pretty fast in-place algorithm
• heaps are just generally good things to be aware of
• heaps are relevant to improving the performance of mergesort, when you're doing a k-way merge with a large set of data

[Christina]

Good points! I'm considering writing another post as sort of a second part to this one and would likely include heap sort, counting sort, and radix sort... Thanks for the input, definitely makes me even more excited to continue learning about sorting algorithms!