Comment Comment by bediger4000 Trying to figure out a bizarre performance drop in a merge sort I wrote for one of those daily coding problems.https://bruceediger.com/posts/mergesort-investigation-1/It seems that adding one node to a linked list causes a repeatable performance drop. That is, linked lists of say 2^21 nodes sort faster than lists of 2^21 + 1 nodes. parent bediger4000 2 years ago
https://bruceediger.com/posts/mergesort-investigation-1/
It seems that adding one node to a linked list causes a repeatable performance drop. That is, linked lists of say 2^21 nodes sort faster than lists of 2^21 + 1 nodes.