Kang-Che Sung (宋岡哲)

> > > Wait, let’s get on the same page @Explorer09. > > > My idea was to split my PR into parts. The first part, which is presented here,...

[OpenBSD curses_attributes(3) man page](https://man.netbsd.org/curses_attributes.3) So it's safe to assume NetBSD curses supports `attr_on`, `attr_off` and `attr_set`. But I can't say the same for `init_extended_pair`. Also it's good to implement the...

Sonuds like a bug to me. If the `WBYTES` field were stored in floating point, the `compareRealNumbers` function will correctly order "N/A" to before any non-NaN value. But it's an...

@yinghao-w You can observe that "N/A" in IO_READ_RATE is ordered as lower than 0. That's by design.

@BenBE > FWIW: Having N/A values at the top is rarely what you want. Because the sort order can be ascending or descending, it would be inevitable for one of...

> Yes and no. There's the option of always putting N/A at the bottom, regardless of sorting order. I treat this suggestion as a separate feature request. Currently there's no...

I think `Vector_insertionSort` algorithm has its merits and I oppose removing it for now. (1) Insertion sort is stable; (2) insertion sort works better for arrays that are 80% sorted.

@BenBE I was considering leaving two interfaces for sorting, like C++ `std::sort` and `std::stable_sort`, and omit the implementation details in the function names. As for what algorithm will be for...

> I'm currently looking into PowerSort, which is both stable AND a variant of merge sort. Also, it should be reasonable to implement its merging step in-place, leaving us with...

Just a reminder: I have an implementation ready for testing. #1798 It's a natural, in-place merge sort that works best with partially sorted data.