README

apauley · Sep 2, 2010 · e9d6e29a4be85e59db094f44983850f29e75391c · e9d6e29
1 parent ae6c47e
commit e9d6e29a4be85e59db094f44983850f29e75391c
Unified Split

Showing with 2 additions and 6 deletions.

+2 −0 Chapter1/Python/README.txt

+0 −3 Chapter1/Python/numerical-methods.py

+0 −3 Chapter1/Python/secant.py
diff --git a/Chapter1/Python/README.txt b/Chapter1/Python/README.txt
@@ -0,0 +1,2 @@
+This code was originally written by Zahir Jacobs:
+http://zahirj.wordpress.com/2009/04/04/complete-listing-of-python-code-for-selected-root-finding-methods/
diff --git a/Chapter1/Python/numerical-methods.py b/Chapter1/Python/numerical-methods.py
@@ -1,8 +1,5 @@
 #!/usr/bin/env python
 
-# This code was originally written by Zahir Jacobs:
-# http://zahirj.wordpress.com/2009/04/04/complete-listing-of-python-code-for-selected-root-finding-methods/
-
 import math
 from helpers import *
 
diff --git a/Chapter1/Python/secant.py b/Chapter1/Python/secant.py
@@ -1,8 +1,5 @@
 #!/usr/bin/env python
 
-# This code was originally written by Zahir Jacobs:
-# http://zahirj.wordpress.com/2009/04/04/complete-listing-of-python-code-for-selected-root-finding-methods/
-
 from helpers import *
 
 def secant(func, a, b, max_steps=MaxSteps, tolerance=Tolerance):