


def       _a			(				SCREAMING_SNAKE_CASE					):


		"""simple docstring"""




		return 10 - x * x
def       _a			(				SCREAMING_SNAKE_CASE						,    SCREAMING_SNAKE_CASE					):


		"""simple docstring"""




		if equation(SCREAMING_SNAKE_CASE					) * equation(SCREAMING_SNAKE_CASE					) >= 0:
				raise ValueError('''Wrong space!'''					)

		lowercase__						=				a
		while (b - a) >= 0.01:
				# Find middle point
				lowercase__						=				(a + b) / 2
				# Check if middle point is root
				if equation(SCREAMING_SNAKE_CASE					) == 0.0:
						break
				# Decide the side to repeat the steps
				if equation(SCREAMING_SNAKE_CASE					) * equation(SCREAMING_SNAKE_CASE					) < 0:
						lowercase__						=				c
				else:
						lowercase__						=				c
		return c


if __name__ == "__main__":
			import doctest

			doctest.testmod()

			print(bisection(-2, 5))
			print(bisection(0, 6))






def       _a			(				SCREAMING_SNAKE_CASE						,    SCREAMING_SNAKE_CASE					):


		"""simple docstring"""




		lowercase__						=				len(SCREAMING_SNAKE_CASE					)
		lowercase__						=				[]
		for i in range(len(SCREAMING_SNAKE_CASE					) - pat_len + 1					):
				lowercase__						=				True
				for j in range(SCREAMING_SNAKE_CASE					):
						if s[i + j] != pattern[j]:
								lowercase__						=				False
								break
				if match_found:
						position.append(SCREAMING_SNAKE_CASE					)
		return position


if __name__ == "__main__":
			assert naive_pattern_search('ABCDEFG', 'DE') == [3]
			print(naive_pattern_search('ABAAABCDBBABCDDEBCABC', 'ABC'))


