{"push_id":1807327260,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"8a72324460794430a547ef652dbe242d6f79360a","before":"d33cb840dae4060d73ed84315aee5b7217fb7aec","commits":[{"sha":"8a72324460794430a547ef652dbe242d6f79360a","author":{"name":"Alex","email":"915749e7acf0e4b94f77e35bf82a7f8489291d9f@gmail.com"},"message":"Rewrote the merge sort algorithm.\n\nIt was attempting to do the sorting in place, however that wasn't working as the final swap would get left out. Instead, I use a double buffering approach with a swap between the read and write buffers every iteration.","distinct":true,"url":"https://api.github.com/repos/AlexSabourinDev/cpp-utility/commits/8a72324460794430a547ef652dbe242d6f79360a"}]}
{"actor":{"display_login":"AlexSabourinDev"}}