Hi, I can do Dijkstra's Algorithm alright, but I always have problems with questions which have some relevance to the "Order of the Algorithm".(adsbygoogle = window.adsbygoogle || []).push({});

For example, in the Further Maths, Decision 1 (OCR) textbook:

8) Suppose you purchase a new computer which is 100 times as fast as your old one. What gain in problem size per hour would you achieve in the use of Dijkstra's Algorithm? Show all necessary working.

I know that the order of Dijkstra's is n^{2}- a quadratic- and that you could use the relationship of: t α n^{2}

Please help me!

Thank You :)

**Physics Forums | Science Articles, Homework Help, Discussion**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Further Maths, D1 - Dijkstra's Algorithm!

**Physics Forums | Science Articles, Homework Help, Discussion**