{"push_id":2027577845,"size":47,"distinct_size":47,"ref":"refs/heads/master","head":"e1b508ad061cea091a9075de16f27b9e8b619179","before":"51d0e8b31a5d0947c35279316c9536dd587386f9","commits":[{"sha":"d3628fe341193a455f49a3f058087eb34abc3a7d","author":{"name":"Unknown","email":"6d902740be005494fb0f1ce9a7b452edb9bdc9b9@gmail.com"},"message":"Add info to binary search README.md","distinct":true,"url":"https://api.github.com/repos/bsemexan/cosmos/commits/d3628fe341193a455f49a3f058087eb34abc3a7d"},{"sha":"995098430d7ffffa7ceeadc5c80d952f7eaa6161","author":{"name":"Nishant Tanwar","email":"1b0af70817362720db680365310968a545f63b52@gmail.com"},"message":"Merge pull request #1 from OpenGenus/master\n\nUpdating fork","distinct":true,"url":"https://api.github.com/repos/bsemexan/cosmos/commits/995098430d7ffffa7ceeadc5c80d952f7eaa6161"},{"sha":"d3877eee4f874c9b808281442d82b3fad81982e9","author":{"name":"Nishant Tanwar","email":"1b0af70817362720db680365310968a545f63b52@gmail.com"},"message":"Added Permutations of String in CPP","distinct":true,"url":"https://api.github.com/repos/bsemexan/cosmos/commits/d3877eee4f874c9b808281442d82b3fad81982e9"},{"sha":"cd3aafcc005375bbc88507d362c27c9cde7d08c0","author":{"name":"Uday Vig","email":"b8b0ad2b384311039c160f035710976e3bd5c6a0@gmail.com"},"message":"Added HashTable in Java\n\nImplementation of HashTable in Java using array of linked lists with functions like get, put, remove etc.","distinct":true,"url":"https://api.github.com/repos/bsemexan/cosmos/commits/cd3aafcc005375bbc88507d362c27c9cde7d08c0"},{"sha":"47018a482f0dd4931e8f093dc132141c26e5c5d5","author":{"name":"ravilkashyap","email":"67a9b1039336188473e5272508d2a06272729075@gmail.com"},"message":"Create Binary Search Tree Height(Max Depth).cpp\n\nA Binary Tree implementation in C++ for insertion of nodes and finding the depth(height) of the BST","distinct":true,"url":"https://api.github.com/repos/bsemexan/cosmos/commits/47018a482f0dd4931e8f093dc132141c26e5c5d5"},{"sha":"50eee46b03706892e90afe7b30717c80257265c3","author":{"name":"sirjan13","email":"2fda1a9ffdc899b178e09e20271587158fd1279b@yahoo.com"},"message":"added code for BSTheight in Python","distinct":true,"url":"https://api.github.com/repos/bsemexan/cosmos/commits/50eee46b03706892e90afe7b30717c80257265c3"},{"sha":"bfb824c52bc0aa865182340824134aa61eb86bdd","author":{"name":"sirjan13","email":"2fda1a9ffdc899b178e09e20271587158fd1279b@yahoo.com"},"message":"updated code for BSTheight in Python","distinct":true,"url":"https://api.github.com/repos/bsemexan/cosmos/commits/bfb824c52bc0aa865182340824134aa61eb86bdd"},{"sha":"87c02865619164414dc44c0583c9c4878d3fe9c8","author":{"name":"c650","email":"0666695e9e22013495f2b002c9d8a569daf09ea6@protonmail.com"},"message":"add algorithm x","distinct":true,"url":"https://api.github.com/repos/bsemexan/cosmos/commits/87c02865619164414dc44c0583c9c4878d3fe9c8"},{"sha":"11689c880a00e0dd563645c4913ecf952ca01c15","author":{"name":"ravilkashyap","email":"67a9b1039336188473e5272508d2a06272729075@gmail.com"},"message":"Amicable numbers.cpp\n\nProgram to Calculate Amicable Numbers under 10000 and find sum.\r\nAn amicable pair of numbers consists of two different integers where the sum of the divisors of the first integer is equal to the second integer, and the sum of the divisors of the second integer is equal to the first integer.","distinct":true,"url":"https://api.github.com/repos/bsemexan/cosmos/commits/11689c880a00e0dd563645c4913ecf952ca01c15"},{"sha":"c8f418b7bb584320e06417c9dbd5d55cb3935776","author":{"name":"Sahil Sharma","email":"446a090c15c7627c09c0aac3b1114851fe1545c8@gmail.com"},"message":"Added insertion.rs file\n\nan insert sort program in rust.","distinct":true,"url":"https://api.github.com/repos/bsemexan/cosmos/commits/c8f418b7bb584320e06417c9dbd5d55cb3935776"},{"sha":"9310542ea3f41473890203ce3533a96363152160","author":{"name":"leodevo","email":"7d9ad24b111cb84f83196cb3d977cf768c551043@gmail.com"},"message":"adding description in README.md for the bubble sort algorighm","distinct":true,"url":"https://api.github.com/repos/bsemexan/cosmos/commits/9310542ea3f41473890203ce3533a96363152160"},{"sha":"1a0c2046771daea986de08089507e4e26acb3f67","author":{"name":"leodevo","email":"7d9ad24b111cb84f83196cb3d977cf768c551043@gmail.com"},"message":"Add missing footer in bubble sort README.md","distinct":true,"url":"https://api.github.com/repos/bsemexan/cosmos/commits/1a0c2046771daea986de08089507e4e26acb3f67"},{"sha":"9a67d03dc64c492e4d6430d6da398692b4fb296c","author":{"name":"ravilkashyap","email":"67a9b1039336188473e5272508d2a06272729075@gmail.com"},"message":"Inversion Count using Divide And Conquer Approach\n\nInversion count of the array is calculated using Merge Sort","distinct":true,"url":"https://api.github.com/repos/bsemexan/cosmos/commits/9a67d03dc64c492e4d6430d6da398692b4fb296c"},{"sha":"8dbd8723027171c42714bace57654a90fe750bad","author":{"name":"Sahil Sharma","email":"446a090c15c7627c09c0aac3b1114851fe1545c8@gmail.com"},"message":"Added merge_sort.php\n\nA php program for merge sort.\r\nO (n log n) comparison-based sorting algorithm.","distinct":true,"url":"https://api.github.com/repos/bsemexan/cosmos/commits/8dbd8723027171c42714bace57654a90fe750bad"},{"sha":"e670f776739ec9772e044b29417cf36cd215abcd","author":{"name":"Caio Henrique Segawa Tonetti","email":"dd93bbaebd026461e40d898c680d5692fe48e678@gmail.com"},"message":"Add a c++ bridge and articulation points in graph","distinct":true,"url":"https://api.github.com/repos/bsemexan/cosmos/commits/e670f776739ec9772e044b29417cf36cd215abcd"},{"sha":"959b87399d37c8f0db1d2466f5342fae4bb52d60","author":{"name":"Nicholas Mertin","email":"d872aac8820d7d04a385f1e5de36cfa001e7fe6c@mertin.home"},"message":"Added C# MergeSort","distinct":true,"url":"https://api.github.com/repos/bsemexan/cosmos/commits/959b87399d37c8f0db1d2466f5342fae4bb52d60"},{"sha":"4c205e2d9e996c789afd48650fbd689547ddcfec","author":{"name":"Levi Franca","email":"aa45ff41954d090db12dfceed809e2f2dced13bb@gmail.com"},"message":"Adding Minimum Coins in Python","distinct":true,"url":"https://api.github.com/repos/bsemexan/cosmos/commits/4c205e2d9e996c789afd48650fbd689547ddcfec"},{"sha":"e3c777bdf5c592c4e37984460a2d15155c40bada","author":{"name":"Nicholas Mertin","email":"d872aac8820d7d04a385f1e5de36cfa001e7fe6c@mertin.home"},"message":"Added C# HeapSort","distinct":true,"url":"https://api.github.com/repos/bsemexan/cosmos/commits/e3c777bdf5c592c4e37984460a2d15155c40bada"},{"sha":"916b6d99f84e1f408567208aa4c1ae1a666820a3","author":{"name":"Levi Franca","email":"aa45ff41954d090db12dfceed809e2f2dced13bb@gmail.com"},"message":"Adding Minimum Coins in C++ and small fixes on Python version","distinct":true,"url":"https://api.github.com/repos/bsemexan/cosmos/commits/916b6d99f84e1f408567208aa4c1ae1a666820a3"},{"sha":"80bc7d1be559d884aff78eb7a250e3e1908401db","author":{"name":"bhaveshAn","email":"048495cf008a094bdc46bdbae6ba0085a797b9b1@gmail.com"},"message":"python imp for queue using LL","distinct":true,"url":"https://api.github.com/repos/bsemexan/cosmos/commits/80bc7d1be559d884aff78eb7a250e3e1908401db"}]}
{"actor":{"display_login":"AdiChat"}}