{"push_id":3979194567,"size":1,"distinct_size":1,"ref":"refs/heads/fix/Reverse","head":"bd20d5e3568a984b3908ee1212abf077e923e50d","before":"853b21512c5399a47e43fa011e859832f71f2ce7","commits":[{"sha":"bd20d5e3568a984b3908ee1212abf077e923e50d","author":{"name":"nutax","email":"6dda063142d7c1e4ab47e6a5afef8f68afae239d@users.noreply.github.com"},"message":"fix(Reverse): Changed loop to recursivity\n\nThe loop algorithm we had relied on two iterators: one that begins at the start (0) and ends at halfway(N/2) and another one that begins at N/2 and ends at N, which means \"N complexity\". However, to get the second iterator we had to iterate N/2, meaning \"N3/2 complexity\". The recursive approach only needs to iterate once (N) but for a higher memory price.","distinct":true,"url":"https://api.github.com/repos/cs2100-utec-aed-2019ii/cs2100-listas-renzo/commits/bd20d5e3568a984b3908ee1212abf077e923e50d"}]}
{"actor":{"display_login":"nutax"}}