Analysing the performance, in Big-O notation, of an algorithm for finding the shortest path between two points A (start) and B (end) on a randomly generated NxN squared grid with black cells indicating obstacles (blocked cells).