Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Updated README.md #76

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Updated README.md #76

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 6 additions & 0 deletions README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -22,3 +22,9 @@ The key insight in the algorithm is as follows. If there is a cycle, then, for a

The algorithm thus maintains two pointers into the given sequence, one (the tortoise) at xi, and the other (the hare) at x2i. At each step of the algorithm, it increases i by one, moving the tortoise one step forward and the hare two steps forward in the sequence, and then compares the sequence values at these two pointers. The smallest value of i > 0 for which the tortoise and hare point to equal values is the desired value ν.

## Lee's Algorithm
If you ever get stuck in a large maze, don't panic and hope to find a chocolate bar in your pocket: that's the only advice we can give you. However, if you get yourself into a situation in a virtual maze, this topic might offer you some assistance. The Lee algorithm is one of the possible solutions for the maze routing problem — finding the shortest path between two points on a 2D grid.

The Lee algorithm is used in computer-aided design systems to route wires on printed circuit boards, in the game industry (especially for real-time strategies) and other areas.