|
|
|
|
|
|
by nurettin
315 days ago
|
|
|
Agreed! As an 8th grader I felt very smart finding the minimum number of steps required to solve this binary search using logarithms. It is also a great intro to algorithmic complexity. Path finding in a 16x16 grid is also another great demonstration of BFS and DFS. Using derivatives to make a targeting system and animating the result is another cool mathematical experiment. |
|
|