Have this problem on my homework, any thoughts?

3. Given the following algorithm, determine the exact number of times each instruction executes (as a function of N). Count all operations. Don't worry about declarations. double brute_force(point* pts, int max_n, point *a, point *b) double d, min_d 100; for (i -0; i min_d ) continue; *bpts [j]; min d - d; return min_d