Hanselman how to use word very handy as I had not been shown any of that, one of those things I just expected to be able to do.
The path finding algorithm Dijkstra which is the father of A* and then A* epsilon. A* builds on Dijkstra algorithm by being greedy.
A greedy algorithm is an algorithm that follows the problem solving heuristic of making the locally optimal choice at each stage with the hope of finding a global optimum.
en.wikipedia.org/wiki/Greedy_algorithm
From .net rocks about opening files in notepad, if the first line starts with PK this is a zip file. Tried this out and appears true.
No comments:
Post a Comment