I have written 4 different algorithms that implement the same mathematical functional in different ways, the first is supposed to be slowest as it uses multiple layers of nested loops, the last one is supposed to be the fastest as it uses no nested loops and only uses integer maths.
I want to find out the actual processing duration of these functions for a given 2D array and also find out how this duration changes as I increase the size of the 2D array.
I am using C++ in the visual studio 2015 community version.