Fixed the boundary condition where input1<input two. Updated
test cases to reflect the fix.
Implemented the Euclid Algorithm in Java.
Improved readability of Java Euclid Algorithm.
Implemented Euclids algorithm in Javascript
Changed the input to only accept unsigned integers.

I could have returned an error if the value passed in was negative
however the definition of Euclid's algorithm is that the input
comes from the set of positive integers. Therefore, in keeping
with the definition, I decided to change the set that the input
can come from.
Fixed the range of input returning a negative value in the event
a invalid value is passed into the function.
Extended invalid values for Java implementation to include 0
Added boundary condition where m or n is equal to 0
Updated README to include Javascript info
Don't need to swap variables, loop takes care of that.
Fixed the makefile to no longer rely on environment variables.
Fixed java version to not switch variables as it is taken care of
if first iteration of loop.
Updated Javascrit algorithm to handle negative and 0 values to
return a error indicator (-1).

Removed swap as its taken care of in the first iteration.

Created makefile for executing test code in firefox browser.
Didn't need that m!=n statment in the forloop. Not sure when/why
that got put there.
Initial version of go program working. Need to write better test
cases and perform error handling.
added a makefile for consistancy