Sorting a table with many NaNs is sometimes unsuccessful
Framework for numerical computations, data analysis and visualisation
Brought to you by:
numere
Tables containing many NaNs are in some cases not sorted completely or unsuccessful.
Analysis:
The comparsison with NaNs in the qSort algorithm seem to have issues and cannot be successful with many NaNs. Manually moving the NaNs to the end might solve this issue.
Implementation:
The fix was implemented as proposed by the analysis. Implementation tests were passed successfully.
Documentation:
Not needed - Bug fix.
Tests:
The fix was added to the automatic tests. No deviation detected. Bug fix implemented successfully.
Anonymous
Diff:
Diff:
Diff:
Diff: