{"push_id":824619121,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"b28e482de71f2116b1012d5675a1a6804da8c50a","before":"39834866da88c79a24eaa88878714f27da9b8d90","commits":[{"sha":"b28e482de71f2116b1012d5675a1a6804da8c50a","author":{"email":"8058beff499fa303b4c31aec1c2ff496bb728e6d@gmail.com","name":"Thainarar Rogério"},"message":"Adding the quick_union algorithm and the time comparative between quick-find and quick-union algorithms :)","distinct":true,"url":"https://api.github.com/repos/thainararogerio/AlgorithmsPart1Coursera/commits/b28e482de71f2116b1012d5675a1a6804da8c50a"}]}