Re: GLPSOL in webassemby faster than native ?
Michael Hennebry <[email protected]> Fri, 2 Oct 2020 10:59:26 -0500 (CDT)
| Newsgroups | gmane.comp.gnu.glpk |
|---|---|
| Message-ID | <[email protected]> |
On Thu, 1 Oct 2020, Domingo Alvarez Duarte wrote: > But in reality it seems that musl/qsort results in "stable sort" but actually > for hashi.mod and tiling.mod the order of the "tie-breaker" results in a lot > shorter solving time. Note that you have achieved consistency of result, not necessarily consistently better performance. -- Michael [email protected] "Sorry but your password must contain an uppercase letter, a number, a haiku, a gang sign, a heiroglyph, and the blood of a virgin." -- someeecards