[pull] master from TheAlgorithms:master #166

Original file line number	Diff line number	Diff line change
Expand Up		@@ -146,14 +146,13 @@ def predict(self, x):
		"""
		if self.prediction is not None:
		return self.prediction
	elif self.left or self.right is not None:
	elif self.left is not None and self.right is not None:
		if x >= self.decision_boundary:
		return self.right.predict(x)
		else:
		return self.left.predict(x)
		else:
	print("Error: Decision tree not yet trained")
	return None
	raise ValueError("Decision tree not yet trained")


		class TestDecisionTree:
Expand Down Expand Up		@@ -201,4 +200,4 @@ def main():
		main()
		import doctest

	doctest.testmod(name="mean_squarred_error", verbose=True)
	doctest.testmod(name="mean_squared_error", verbose=True)

2 changes: 1 addition & 1 deletion maths/monte_carlo.py

Show comments View file Open in desktop

Original file line number	Diff line number	Diff line change
Expand Up		@@ -8,7 +8,7 @@
		from statistics import mean


	def pi_estimator(iterations: int):
	def pi_estimator(iterations: int) -> None:
		"""
		An implementation of the Monte Carlo method used to find pi.
		1. Draw a 2x2 square centred at (0,0).
Expand Down

Navigation Menu