{"push_id":1207778836,"size":2,"distinct_size":2,"ref":"refs/heads/master","head":"9d244515d8741d4be73a6c07986956654b81d000","before":"08c892b6e1c0e60d3ad0173d6946d605d60a41c2","commits":[{"sha":"9d6d008504fab594f33d7681446a9dfc36b735f6","author":{"name":"Roman Coedo","email":"4094adad99fcf211ba7597947ccacc87437d4bb4@gmail.com"},"message":"Add Number of inversions algorithm based on mergesort","distinct":true,"url":"https://api.github.com/repos/rcoedo/haskell-algorithms/commits/9d6d008504fab594f33d7681446a9dfc36b735f6"},{"sha":"9d244515d8741d4be73a6c07986956654b81d000","author":{"name":"Roman Coedo","email":"4094adad99fcf211ba7597947ccacc87437d4bb4@gmail.com"},"message":"Fix mergesort directory case","distinct":true,"url":"https://api.github.com/repos/rcoedo/haskell-algorithms/commits/9d244515d8741d4be73a6c07986956654b81d000"}]}
{"actor":{"display_login":"rcoedo"}}