|
|
|
|
|
|
by ammon
3307 days ago
|
|
|
The goal of this quiz is to be a little challenging and fun and maybe educational. It's not to judge whether someone can do a software engineering job! The answers to the graph problems are indeed fairly straight forward. But asking about why one might use a BST in place of a sorted list prompts interesting discussion. And going into Dijkstra's vs A* and iterative deepening depth first search is (I think) pretty interesting! |
|
|