Comparison of algorithm time complexity

Question: 1-1/x + 1/x ^ 2-1/x ^ 3 +... + 1/(-x) ^ (n-1)

Algorithm 1:

 

# Include <stdio. h> # include <sys/timeb. h> void main () {timeb T1, T2; long T; Double X, sum = 1, sum1; int I, j, N; printf ("Enter x N: "); scanf (" % lf % d ", & X, & N); ftime (& T1); for (I = 1; I <= N; I ++) {sum1 = 1; for (j = 1; j <= I; j ++) sum1 = sum1 * (-1.0/X); sum + = sum1 ;} ftime (& T2); t = (t2.time-t1.time) * 1000 + (t2.millitm-t1.millitm); printf ("sum = % lf % LD millisecond \ n", sum, t );}

Time Complexity:

Algorithm 2:

# Include <stdio. h> # include <sys/timeb. h> void main () {timeb T1, T2; long T; Double X, sum = 1, sum1 = 1; int I, j, N; printf ("Enter x N:"); scanf ("% lf % d", & X, & N); ftime (& T1); for (I = 1; I <= N; I ++) {sum1 * = (-1.0/X); sum + = sum1;} ftime (& T2); t = (t2.time-t1.time) * 1000 + (t2.millitm-t1.millitm); printf ("sum = % lf % LD millisecond \ n", sum, T );}

Time Complexity: