{"push_id":984357357,"size":2,"distinct_size":1,"ref":"refs/heads/master","head":"70a4297af4fa7c039e4052d782556c29fe40fcb4","before":"1aff11e5710413a11e58e666ad4552160a8d53e6","commits":[{"sha":"f2f031362323d4cad59d0e09bd1174ef09a0bf3d","author":{"email":"c8a1368cb967a6b63f25c285b28a44642ec1c592@users.noreply.github.com","name":"vlsyu"},"message":"Coursera-Algorithms-I\n\nDescription.   An introduction to fundamental data types, algorithms, and data structures. Our emphasis is on applications and scientific performance analysis of Java implementations.\r\n\r\nPart I focuses on elementary data structures, sorting, and searching. Topics include union-find, binary search, stacks, queues, bags, insertion sort, selection sort, shellsort, quicksort, 3-way quicksort, mergesort, heapsort, binary heaps, binary search trees, red-black trees, separate chaining and linear probing hash tables, Graham scan, and kd-trees.\r\nPart II focuses on graph and string-processing algorithms. Topics include depth-first search, breadth-first search, topological sort, Kosaraju-Sharir, Kruskal, Prim, Dijkistra, Bellman-Ford, Ford-Fulkerson, LSD radix sort, MSD radix sort, 3-way radix quicksort, multiway tries, ternary search tries, Knuth-Morris-Pratt, Boyer-Moore, Rabin-Karp, regular expression matching, run-length coding, Huffman coding, LZW compression, and the Burrows-Wheeler transfor","distinct":false,"url":"https://api.github.com/repos/vlsyu/Coursera-Algorithms-I/commits/f2f031362323d4cad59d0e09bd1174ef09a0bf3d"},{"sha":"70a4297af4fa7c039e4052d782556c29fe40fcb4","author":{"email":"c8a1368cb967a6b63f25c285b28a44642ec1c592@users.noreply.github.com","name":"vlsyu"},"message":"Merge pull request #1 from vlsyu/vlsyu-patch-1\n\nCoursera-Algorithms-I","distinct":true,"url":"https://api.github.com/repos/vlsyu/Coursera-Algorithms-I/commits/70a4297af4fa7c039e4052d782556c29fe40fcb4"}]}