{"push_id":2923419854,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"b84412be2cfe99db48089b3bf08eb880c75227b1","before":"2ebabc8c57442a8563ceb112686d7f5be3175b66","commits":[{"sha":"b84412be2cfe99db48089b3bf08eb880c75227b1","author":{"name":"DivyanxiM","email":"6c1963ce05a9732276bcc7d94f492d557b5de4ca@users.noreply.github.com"},"message":"Scala session II acadgild\n\nTask 1\r\nCreate a Scala application to find the GCD of two numbers\r\nTask 2\r\nFibonacci series (starting from 1) written in order without any spaces in between, thus\r\nproducing a sequence of digits.\r\nWrite a Scala application to find the Nth digit in the sequence.\r\n➢ Write the function using standard for loop\r\n➢ Write the function using recursion\r\nTask 3\r\nFind square root of number using Babylonian method.\r\n1. Start with an arbitrary positive start value x (the closer to the root, the better).\r\n2.Initialize y = 1.\r\n3. Do following until desired approximation is achieved.\r\na) Get the next approximation for root using average of x and y\r\nb) Set y = n/x","distinct":true,"url":"https://api.github.com/repos/DivyanxiM/Big-DataSession15-Assignment1/commits/b84412be2cfe99db48089b3bf08eb880c75227b1"}]}
{"actor":{"display_login":"DivyanxiM"}}