René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"DiscussionForumPosting","headline":"Incorrect minRunLength() computing minRun to be too small","articleBody":"The [following line](https://github.com/timsort/cpp-TimSort/blob/298928ce37e2954956320e764a862b9b1dbc51a7/include/gfx/timsort.hpp#L174) seems incorrect.\r\n\r\nSince MIN_MERGE is 32, the loop would end with n containing the 5 most significant bits instead of 6 most significant bits.\r\nTherefore, the function would return [0, 32], which is less than what Python is doing [here](https://github.com/python/cpython/blob/a42759351bff7b07fa8bf2cece0088f8539721d1/Objects/listobject.c#L1983)\r\n\r\nThe Python detailed description of Timsort in the readme [here](http://svn.python.org/projects/python/trunk/Objects/listsort.txt) also corresponds to returning a size of [32, 64] when possible.\r\n","author":{"url":"https://github.com/CovetingEpiphany2152","@type":"Person","name":"CovetingEpiphany2152"},"datePublished":"2020-10-10T12:11:03.000Z","interactionStatistic":{"@type":"InteractionCounter","interactionType":"https://schema.org/CommentAction","userInteractionCount":4},"url":"https://github.com/33/cpp-TimSort/issues/33"}