{"push_id":914584924,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"4f00a42fd1d4c81d67e5d61f3febe8ef6090a655","before":"bdc0c1298493afb4e214f1e11073209b96e4a37e","commits":[{"sha":"4f00a42fd1d4c81d67e5d61f3febe8ef6090a655","author":{"email":"3bbe29e8ef937d488ec97d95b0db61d8db5706da@i.ua","name":"Anatolii"},"message":"Домашнее задание к 5 модулю, вторая часть. Сортировка методом Merge O(n)=n*log(n)","distinct":true,"url":"https://api.github.com/repos/AazzIT/MyHomeWork/commits/4f00a42fd1d4c81d67e5d61f3febe8ef6090a655"}]}