title: What is the time complexity of A* search
body: <p>I'm new to stack overflow, but I'm here because I've searched everywhere and can't seem to find much info on the time complexity of A*, besides off the wiki. I would also like to compare it to Dijkstra's algorithm and see how adding a heuristic in A* improves it's performance.</p>
  
  <p>I know it's a very advanced topic, but I just can't fully understand it from the info given on wiki (Even the analysis of Dijkstra's algorithm on wiki seems quite advanced).</p>
  
  <p><a href="https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" rel="nofollow noreferrer">https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm</a>
  <a href="https://en.wikipedia.org/wiki/A*_search_algorithm" rel="nofollow noreferrer">https://en.wikipedia.org/wiki/A*_search_algorithm</a></p>
  
  <p>I would greatly appreciate it if anyone could explain the time complexity in more detail, or suggest any reading / learning material on the topic. I do have a good understanding of the A* algorithm, but I've just started learning the analysis thereof now.</p>