Fixed a mistake in concrete max function for list of pairs.
Added solve all dfs solution
Described exhaustive search method for maze.
Finished exhaustive search solution to maze
Added figures to illustrate dfs stack
Added footnotes for maze solution
Added funcitonal DFS maze solution, next is the imperative ones
Started adding imperative maze solution
Python version of maze solving program is OK
Removed log line
Added imperative algorithm description
Return NIL when binary search fails
Merge branch 'algoxy' of github.com:liuxinyu95/AlgoXY into algoxy
Finished maze imperative part
Added big O analysis for maze puzzle
Updated big-O analyze for maze puzzle
Started 8 queens puzzle part
Added 8 queens solution in Haskell
Gave the description of 8 queens puzzle
Added algorithm definition for 8 queens puzzle