Algorithms — A-Level Revision Notes

3 notes on Algorithms for A-Level Computer Science.

Big-O Time ComplexityMeasuring algorithm efficiency We compare algorithms by how their… Graph and Tree TraversalsTraversing graphs and trees Traversal means visiting every node… Dijkstra's Shortest Path AlgorithmThe shortest path problem Dijkstra's algorithm finds the shortest…

← All A-Level Computer Science notes