algorithm-archivists · GuyPozner · Jul 24, 2018 · Jul 24, 2018 · Jul 24, 2018 · Jul 24, 2018
diff --git a/contents/bitlogic/res/nand.jpg b/contents/bitlogic/res/nand.jpg
diff --git a/contents/bitlogic/res/nor.jpg b/contents/bitlogic/res/nor.jpg
diff --git a/contents/bitlogic/res/not.jpg b/contents/bitlogic/res/not.jpg
diff --git a/contents/bitlogic/res/or.jpg b/contents/bitlogic/res/or.jpg
diff --git a/contents/bitlogic/res/xor.jpg b/contents/bitlogic/res/xor.jpg
diff --git a/contents/cooley_tukey/res/FT_example.png b/contents/cooley_tukey/res/FT_example.png
diff --git a/contents/cooley_tukey/res/butterfly_diagram.png b/contents/cooley_tukey/res/butterfly_diagram.png
diff --git a/contents/cooley_tukey/res/fft.png b/contents/cooley_tukey/res/fft.png
diff --git a/contents/cooley_tukey/res/radix-2screen.jpg b/contents/cooley_tukey/res/radix-2screen.jpg
diff --git a/contents/cooley_tukey/res/radix-2screen_positive.jpg b/contents/cooley_tukey/res/radix-2screen_positive.jpg
diff --git a/contents/cooley_tukey/res/radix-8screen.jpg b/contents/cooley_tukey/res/radix-8screen.jpg
diff --git a/contents/cooley_tukey/res/sinusoid.png b/contents/cooley_tukey/res/sinusoid.png
diff --git a/contents/euclidean_algorithm/res/modulus.png b/contents/euclidean_algorithm/res/modulus.png
diff --git a/contents/euclidean_algorithm/res/subtraction.png b/contents/euclidean_algorithm/res/subtraction.png
diff --git a/contents/forward_euler_method/res/error.png b/contents/forward_euler_method/res/error.png
diff --git a/contents/forward_euler_method/res/instability.png b/contents/forward_euler_method/res/instability.png
diff --git a/contents/git_and_version_control/res/clone.png b/contents/git_and_version_control/res/clone.png
diff --git a/contents/git_and_version_control/res/fork.png b/contents/git_and_version_control/res/fork.png
diff --git a/contents/huffman_encoding/res/huffman_tree.png b/contents/huffman_encoding/res/huffman_tree.png
diff --git a/contents/monte_carlo_integration/code/python/monte_carlo.py b/contents/monte_carlo_integration/code/python/monte_carlo.py
@@ -0,0 +1,35 @@
+import math
+import random
+
+
+def in_circle(x, y, radius = 1):
+	"""Return True if the point is in the circle and False otherwise."""
+	return (x*x + y*y) < radius*radius
+
+def monte_carlo(n_samples, radius = 1):
+	"""Return the estimate of pi using the monte carlo algorithm."""
+	in_circle_count = 0
+	for i in range(n_samples):
+
+		# Sample x, y from the uniform distribution
+		x = random.uniform(0, radius)
+		y = random.uniform(0, radius)
+
+		# Count the number of points inside the circle
+		if(in_circle(x, y, radius)):
+			in_circle_count += 1
+
+	# Since we've generated points in upper left quadrant ([0,radius], [0, radius])
+	# We need to multiply the number of points by 4	
+	pi_estimate = 4 * in_circle_count / (n_samples)
+
+	return pi_estimate
+
+if __name__ == '__main__':
+
+	pi_estimate = monte_carlo(100000)
+	percent_error = 100*abs(math.pi - pi_estimate)/math.pi
+
+	print("The estimate of pi is: {:.3f}".format(pi_estimate))
+	print("The percent error is: {:.3f}".format(percent_error))
+
diff --git a/contents/monte_carlo_integration/monte_carlo_integration.md b/contents/monte_carlo_integration/monte_carlo_integration.md
@@ -59,6 +59,8 @@ each point is tested to see whether it's in the circle or not:
 [import:13-15, lang:"java"](code/java/MonteCarlo.java)
 {% sample lang="swift" %}
 [import:15-17 lang:"swift"](code/swift/monte_carlo.swift)
+{% sample lang="py" %}
+[import:5-7 lang:"python"](code/python/monte_carlo.py)
 {% endmethod %}
 
 If it's in the circle, we increase an internal count by one, and in the end,
@@ -112,6 +114,8 @@ Feel free to submit your version via pull request, and thanks for reading!
 [import, lang:"java"](code/java/MonteCarlo.java)
 {% sample lang="swift" %}
 [import, lang:"swift"](code/swift/monte_carlo.swift)
+{% sample lang="py" %}
+[import, lang:"python"](code/python/monte_carlo.py)
 {% endmethod %}
 
 

diff --git a/contents/monte_carlo_integration/res/13311.png b/contents/monte_carlo_integration/res/13311.png
diff --git a/contents/monte_carlo_integration/res/195583.png b/contents/monte_carlo_integration/res/195583.png
diff --git a/contents/monte_carlo_integration/res/31.png b/contents/monte_carlo_integration/res/31.png
diff --git a/contents/monte_carlo_integration/res/monte_carlo.gif b/contents/monte_carlo_integration/res/monte_carlo.gif
diff --git a/contents/monte_carlo_integration/res/square_circle.png b/contents/monte_carlo_integration/res/square_circle.png
diff --git a/contents/notation/res/cplot.png b/contents/notation/res/cplot.png
diff --git a/contents/taylor_series_expansion/res/function_sum.png b/contents/taylor_series_expansion/res/function_sum.png
diff --git a/contents/tree_traversal/code/scratch/scratch_tree.png b/contents/tree_traversal/code/scratch/scratch_tree.png
diff --git a/contents/tree_traversal/res/3-tree.png b/contents/tree_traversal/res/3-tree.png
diff --git a/contents/tree_traversal/res/BFS_simple.png b/contents/tree_traversal/res/BFS_simple.png
diff --git a/contents/tree_traversal/res/DFS_in.png b/contents/tree_traversal/res/DFS_in.png
diff --git a/contents/tree_traversal/res/DFS_post.png b/contents/tree_traversal/res/DFS_post.png
diff --git a/contents/tree_traversal/res/DFS_pre.png b/contents/tree_traversal/res/DFS_pre.png
diff --git a/contents/tree_traversal/res/binary_tree.png b/contents/tree_traversal/res/binary_tree.png
diff --git a/contents/verlet_integration/code/labview/verlet_labview.png b/contents/verlet_integration/code/labview/verlet_labview.png
diff --git a/contents/verlet_integration/code/scratch/verlet_scratch.png b/contents/verlet_integration/code/scratch/verlet_scratch.png