created merge sort, added a <= at line 23 in order to resolve duplicates
creates spec tests for merge sort to sort a inorder array, out of order array, array with duplicates
added a sorting test for negative integers
added a test to check that the sort method does not crash upon getting a 1 element or no element array
created a create random array method
created tests for the create random array and large arrays
no changes
completed project, discovered the ruby memory management limits stack size to a certain level
refactored the code to remove the cur array from the merge method, this is not needed, we can just inject the first value into the [element]
changed some values for stack level of the ruby enviroment
removed comment
created binary search
all tests pass, there was a problem in ruby's algorithm and my own which found hte index of the same element but the first and second instances of such
added a iteration count to the random tests, and also added a rspec command file to output the run time of tasks