Hasenn 10aa214fcb Docstrings and formatting improvements (#2418) ... * Fix spelling in docstrings * Improve comments and formatting * Update print statement to reflect doctest change * improve phrasing and apply black * Update rat_in_maze.py This method is recursive starting from (i, j) and going in one of four directions: up, down, left, right. If a path is found to destination it returns True otherwise it returns False. Co-authored-by: Christian Clauss <cclauss@me.com>		2020-09-14 14:40:27 +02:00
..
all_combinations.py	pyupgrade --py37-plus **/*.py (#1654)	2020-01-03 22:25:36 +08:00
all_permutations.py	Optimized recursive_bubble_sort (#2410)	2020-09-10 10:31:26 +02:00
all_subsequences.py	Optimized recursive_bubble_sort (#2410)	2020-09-10 10:31:26 +02:00
coloring.py	Tighten up psf/black and flake8 (#2024)	2020-05-22 08:10:11 +02:00
hamiltonian_cycle.py	Docstrings and formatting improvements (#2418)	2020-09-14 14:40:27 +02:00
knight_tour.py	Euler problem 551 sol 1: Reduce McCabe code complexity (#2141)	2020-06-22 14:16:12 +02:00
minimax.py	Tighten up psf/black and flake8 (#2024)	2020-05-22 08:10:11 +02:00
n_queens_math.py	N queens math (#2175)	2020-07-10 10:30:48 +02:00
n_queens.py	Set the Python file maximum line length to 88 characters (#2122)	2020-06-16 10:09:19 +02:00
rat_in_maze.py	Docstrings and formatting improvements (#2418)	2020-09-14 14:40:27 +02:00
sudoku.py	Optimized recursive_bubble_sort (#2410)	2020-09-10 10:31:26 +02:00
sum_of_subsets.py	Optimized recursive_bubble_sort (#2410)	2020-09-10 10:31:26 +02:00