{"push_id":2442786206,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"18d48217c1c260d6f1bff95da427eb710f6f7b50","before":"05fae66e3f6c38c81e929278a90630690b8870ff","commits":[{"sha":"18d48217c1c260d6f1bff95da427eb710f6f7b50","author":{"name":"Yuvashri","email":"62fe861f13198254ee492564cf383cbc72c43ffa@hotmail.com"},"message":"Insertion Sort -Part 1\n\nGiven a sorted list with an unsorted number  in the rightmost cell, can you write some simple code to insert  into the array so that it remains sorted?\r\n\r\nPrint the array every time a value is shifted in the array until the array is fully sorted. The goal of this challenge is to follow the correct order of insertion sort.\r\n\r\nGuideline: You can copy the value of  to a variable and consider its cell \"empty\". Since this leaves an extra cell empty on the right, you can shift everything over until  can be inserted. This will create a duplicate of each value, but when you reach the right spot, you can replace it with .\r\n\r\nInput Format \r\nThere will be two lines of input:\r\n\r\n - the size of the array\r\n - the array containing  sorted integers and  unsorted integer  in the rightmost cell\r\nOutput Format \r\nOn each line, output the entire array every time an item is shifted in it.","distinct":true,"url":"https://api.github.com/repos/YuvashriJayakumar/HackerRank/commits/18d48217c1c260d6f1bff95da427eb710f6f7b50"}]}
{"actor":{"display_login":"YuvashriJayakumar"}}