For my profiling, I decided to profile a maze solver algorithm I found using C at http://www.paulgriffiths.net/program/c/maze.php. This algorithm will take a maze made in text files and find the solution. Considering the maze provided was fairly small (10x 10), I decided to attach multiple mazes together to form a 6867x101 maze to show a more prominent profile. The first profiling was done with zero optimization: [[File:FlatProfile.jpg]] The second profiling was done with the -O2 flag compiler optimization: [[File:O2Flag_FlatProfile.jpg]] As you can see, the majority of the cumulative time is done in the "look" function shown here: [[File:lookFunction.jpg]] While this function is done recursively, I feel like with a simple parallelization, this single function can be made much faster. Although, other parts of the code will also need to be changed to support larger dimension of mazes. With the current supported dimension, the amount of execution time is trivial, and if larger dimensions of maze is taken as input, a segmentation fault will occur.