Computer Science, asked by robintanwarrajput318, 9 months ago

Q3. ........is a technique, used to 1 point
decide paths of computations.
*
O Variables
O Subrouting
O Subscripte
O Brancing​

Answers

Answered by sg249344
0

A* is the most popular choice for pathfinding, because it's fairly flexible and can be used in a wide range of contexts. A* is like Dijkstra's Algorithm in that it can be used to find a shortest path. A* is like Greedy Best-First-Search in that it can use a heuristic to guide itself.

Answered by bhawnarathore11784
0

A is the answer

Explanation:Please mark me as brainliest

Similar questions