{"push_id":962519123,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"0413c68854ba89fa8eac89fb45f3bcbd9efe5e9d","before":"8d73cefa2314f5523e64f42b9cafbb8abe8c7952","commits":[{"sha":"0413c68854ba89fa8eac89fb45f3bcbd9efe5e9d","author":{"email":"45e36e4a1ccc90ded01763eb30ec58a3ce440d16@hotmail.fr","name":"Morwenn"},"message":"Improve measure of presortedness: inv.\n\nTo achieve O(n log n) complexity, inv needs to allocate memory, which\nmeans that it can fail when not enough memory is available. This commit\nchanges inv so that it is O(n log n) when enough memory is available and\nfalls back to a O(n^2) algorithm when there isn't enough memory.","distinct":true,"url":"https://api.github.com/repos/Morwenn/cpp-sort/commits/0413c68854ba89fa8eac89fb45f3bcbd9efe5e9d"}]}