added factorial solution

lower-case · lower-case · commit c331c7bc0232 · 2015-10-20T16:54:43.000+05:30
diff --git a/README.md b/README.md
@@ -49,7 +49,7 @@ Numbers
 **Tax Calculator** - Asks the user to enter a cost and either a country or state tax. It then returns the tax plus the total cost with tax. [[tel (Haskell)]](https://github.com/tel/Projects/blob/master/Numbers/TaxCalculator.hs)[[jbruno2 (C++)]](https://github.com/jbruno2/Simple-Programs-and-Solutions/blob/master/C%2B%2B/Tax%20calculator.cpp)  [[ScottKolo (Go)]](https://github.com/ScottKolo/GoProjects/blob/master/Numbers/tax.go) [[brotatotes (Python)]](https://github.com/brotatotes/myStuff/blob/master/Tax_Calculator.py) [[desertwebdesigns (Python)]](https://bitbucket.org/desertwebdesigns/learn_python/src/master/Numbers/tax.py)
  [[neivin (Python)]](https://github.com/neivin/projects/blob/master/numbers/tax_calculator.py)[[Vdrey (Python)]](https://github.com/vdrey/Project-Programs/blob/master/Python/Tax%20Calculator.py) [[viktorahlstrom (Bash)]](https://github.com/viktorahlstrom/all/blob/master/coding-problems-solved/projects-solutions/tax.sh)
 
-**Factorial Finder** - The factorial of a positive integer *n* is defined as the product of the sequence , n-1, n-2, ...1 and the factorial of 0 is defined as being 1. Solve this using both loops and recursion. [[tel (Haskell)]](https://github.com/tel/Projects/blob/master/Numbers/Factorial.hs) [[rramchand (python)]](https://github.com/rramchand/Projects-Solutions/blob/master/factorial.py) [[ScottKolo (Go)]](https://github.com/ScottKolo/GoProjects/blob/master/Numbers/factorial.go) [[aysark (Java)]](https://github.com/aysark/Review/blob/master/Projects/src/FactorialFinder.java) [[JaredCubilla (Javascript)]](https://github.com/JaredCubilla/Projects/blob/master/Javascript/numbers/factorialFinder.js) [[turlapatykaushik(Python)]](https://github.com/turlapatykaushik/Programs-and-codes/blob/master/problems/factorial.py) [[Josenberg (Ruby)]](https://github.com/josenberg/factorial_ruby/blob/master/factorial_finder.rb) [[melvin0008(SML)]](https://github.com/melvin0008/FactorialComparer/blob/master/fact.sml)[[melvin0008 (Python)]](https://github.com/melvin0008/FactorialComparer/blob/master/fact.py)[[melvin0008(haskell)]](https://github.com/melvin0008/FactorialComparer/blob/master/fact.hs)[[melvin0008 (Julia)]](https://github.com/melvin0008/FactorialComparer/blob/master/fact.jl) [[hkuchampudi (Java)]](https://github.com/hkuchampudi/MegaProject_Solutions/blob/master/Numbers/factorial_finder.java) [[kvsingh (Python)]](https://github.com/kvsingh/python-practice/blob/master/factorial.py)
+**Factorial Finder** - The factorial of a positive integer *n* is defined as the product of the sequence , n-1, n-2, ...1 and the factorial of 0 is defined as being 1. Solve this using both loops and recursion. [[tel (Haskell)]](https://github.com/tel/Projects/blob/master/Numbers/Factorial.hs) [[rramchand (python)]](https://github.com/rramchand/Projects-Solutions/blob/master/factorial.py) [[ScottKolo (Go)]](https://github.com/ScottKolo/GoProjects/blob/master/Numbers/factorial.go) [[aysark (Java)]](https://github.com/aysark/Review/blob/master/Projects/src/FactorialFinder.java) [[JaredCubilla (Javascript)]](https://github.com/JaredCubilla/Projects/blob/master/Javascript/numbers/factorialFinder.js) [[turlapatykaushik(Python)]](https://github.com/turlapatykaushik/Programs-and-codes/blob/master/problems/factorial.py) [[Josenberg (Ruby)]](https://github.com/josenberg/factorial_ruby/blob/master/factorial_finder.rb) [[melvin0008(SML)]](https://github.com/melvin0008/FactorialComparer/blob/master/fact.sml)[[melvin0008 (Python)]](https://github.com/melvin0008/FactorialComparer/blob/master/fact.py)[[melvin0008(haskell)]](https://github.com/melvin0008/FactorialComparer/blob/master/fact.hs)[[melvin0008 (Julia)]](https://github.com/melvin0008/FactorialComparer/blob/master/fact.jl) [[hkuchampudi (Java)]](https://github.com/hkuchampudi/MegaProject_Solutions/blob/master/Numbers/factorial_finder.java) [[kvsingh (Python)]](https://github.com/kvsingh/python-practice/blob/master/factorial.py) [[iamvoid13 (C++)]](https://github.com/iamvoid13/Programs/blob/master/src/factorial.cpp)
 
 **Complex Number Algebra** - Show addition, multiplication, negation, and inversion of complex numbers in separate functions. (Subtraction and division operations can be made with pairs of these operations.) Print the results for each operation tested. [[tel (Haskell)]](https://github.com/tel/Projects/blob/master/Numbers/ComplexNumberAlgebra.hs) [[aysark (Java)]](https://github.com/aysark/Review/blob/master/Projects/src/ComplexNumbers.java)[[ppype (python)]](https://github.com/ppype/Complex-Number-Algebra/blob/master/programs/main.py)  [[sijunhe (c)]](https://github.com/sijunhe/Project-Programs/blob/master/c/complex.c)
 
