{"push_id":537750876,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"056177e234041db5620460e7738c277d3985db0e","before":"9e248f79cab8b0b8f0bd5e5da2faa601da518486","commits":[{"sha":"056177e234041db5620460e7738c277d3985db0e","author":{"email":"d4d823d69c5af3e50c2a0490e6a8206bcecf4680@gmail.com","name":"Leo"},"message":"Makes a small optimization to quicksort.\n\nThe optimization is to end the recursion when the length of the array becomes 10 or less. When this happens, we simply do a insertionsort instead of partitioning again.","distinct":true,"url":"https://api.github.com/repos/ExpLog/JuliaCLRS/commits/056177e234041db5620460e7738c277d3985db0e"}]}