{"push_id":1182410028,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"7ec94995e34daef6fd376f1cc8d6a0e352f2e75c","before":"eabda886bb9253ba68bc9cc05178d36832bc00ed","commits":[{"sha":"7ec94995e34daef6fd376f1cc8d6a0e352f2e75c","author":{"name":"readysetlearn","email":"5c7e3e19c3ad4db86837f9e35295ea6633fea090@ymail.com"},"message":"Added optimization where the first, and last 2 elements of a subarray are not compared to the pivot. This is because the median method used has side effects; it sorts the smallest element of the three into the first position of the subarray, the largest element into the last, and the middle element into the second to last. This is so that they end up on the right side of the partition when compared to the pivot. Since this is already done in the median method, the partition method can skip them. However, to calculate the median of 3 subarrays must be of at least length 3, so this is checked for and shorter subarrays are manually sorted. There were lots of index out of range and stack overflow errors. The code appears to be working after some initial testing, but needs refinement and isn’t clean.","distinct":true,"url":"https://api.github.com/repos/readysetlearn/Sorting-Algorithms/commits/7ec94995e34daef6fd376f1cc8d6a0e352f2e75c"}]}
{"actor":{"display_login":"readysetlearn"}}