Comments by ARBebopKid (Top 41 by date)

how do we report spam?

You're welcome and thanks for the 5!

Reason for my vote of 2
I do not understand the first paragraph. It should be rewritten in clearer English.

Updated with simplistic overflow detection.

This works only through 19!

Alternative 7 using BigInteger is the way to go.

Just demonstrating my preferred algorithm.

And if long is 64-bit, the overflow isn't at 13.

But, yes, it should have overflow detection.

Reason for my vote of 5
Very nice.

True, but I do not consider that a means of calculating Factorials. It is a mean of storing the results of the calculations and returning the answers.

Reason for my vote of 4
I suggest you included the necessary using statements.

using System.Net.NetworkInformation;
using System.Net;

Reason for my vote of 5
Excellent information

Good point, changing mine

Find the two points that are farthest apart.
distance = sqrt((x1 - x2)^2 + (y1 - y2)^2)

Then make a circle with those two points

(distance /2 )^2 = (x - (x1+x2)/2)^2 + (y - (y1+y2)/2)^2

if all other points are in this circle, then you have the center point of ((x1+x2)/2, (y1+y2)/2)

if not, take the point farthest from the circle and combine with your original 3 points to form a circle

r^2 = (x - h)^2 + (y - k)^2

3 points : (a,b) (c,d) (e,f)

h = (1/2)((a²+b²)(f-d) + (c²+d²)(b-f) + (e²+f²)(d-b)) / (a(f-d)+c(b-f)+e(d-b))

k = (1/2)((a²+b²)(e-c) + (c²+d²)(a-e) + (e²+f²)(c-a)) / (b(e-c)+d(a-e)+f(c-a))

r² = (a-h)² + (b-k)²

(h,k) is the center point

Reason for my vote of 1
Should already be common knowledge and available immediately on Google Search.

The compiler stores an array in contiguous memory from [0,0] to [0,n], then [1,0] to [1,n] and so on, or row-wise.

Since i and k are both row indexes and j is only ever a column index, having j looped last helps optimize the algorithm.

When dealing with multiple loops and indexes, it is best to put the row index that is referenced the most in the outermost loop. So here, by intuition, the order should be ikj.

It is good to know what your compiler does, because the FORTRAN compilers I have used stored arrays column-wise. With large arrays, optimization is important.