-
Notifications
You must be signed in to change notification settings - Fork 0
/
intal_01FB16ECS352.c
688 lines (558 loc) · 16.5 KB
/
intal_01FB16ECS352.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
#include "intal.h"
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
static void* zero_array() {
char *z_arr = (char *)malloc(sizeof(char) * 2);
z_arr[0] = '0';
z_arr[1] = '\0';
return z_arr;
}
void* intal_create(const char* str) {
char *intal;
long int i = 0, z_count = 0, eff_len = 0;
if(str[0] > '9' || str[0] < '0') return zero_array();
//while() is used count the number of zeros.
while(str[i] != '\0') {
if(str[i] == '0') z_count += 1;
else break;
i += 1;
}
//For 0, 00, 000, 0000, . . . . . . . .
if(str[i - 1] == '0' && strlen(str) == z_count) z_count -= 1;
//"eff_len" is the count of all valid numbers before the non-decimal digit and after removing all preceeding 0s.
for(i = z_count; str[i] != '\0'; i++) {
if(str[i] >= '0' && str[i] <= '9') eff_len += 1;
else break;
}
if(eff_len == 0) return zero_array();//printf("num_count : %d\n", num_count);
//Length of the intal after removing insignificant 0's before non-zero MSB.Ex: For 0012, eff_len will be 4-2 = 2
intal = (char *)malloc(sizeof(char) * (eff_len + 1));//One extra space for null character.
for(i = 0; i < eff_len; i++)
intal[i] = str[i + z_count];//To extract the number from the string
intal[i] = '\0';
return intal;
}
void intal_destroy(void* intal) {
if(intal == NULL) return;
free(intal);
return;
}
char* intal2str(void* intal) {
if(intal == NULL) {
char *nan = (char *)malloc(sizeof(char) * 4);
strcpy(nan, "NaN");
nan[3] = '\0';
return nan;
}
char *itl = (char *)intal;
long int len = strlen(itl);
char *f_itl = (char *)malloc(sizeof(char) * (len + 1));
strcpy(f_itl, itl);
f_itl[len] = '\0';
return f_itl;
}
void* intal_increment(void* intal) {
char *nan = NULL;
if(intal == NULL) return nan;
char *f_itl = (char *)intal;
long int i;
int carry = 0, sum = 0, digit;
for(i = strlen(intal) - 1; i >= 0; i--) {
digit = f_itl[i] - '0';//printf("Digit : %d\n", digit);
if(i == strlen(intal) - 1) {
sum = carry + digit + 1;
if(sum / 10 == 1) {
carry = 1;
sum = sum % 10;
f_itl[i] = sum + '0';
}
else {
carry = 0;
f_itl[i] = sum + '0';
}//printf("Char in if : %c\n", f_itl[i]);
}
else {
if(carry == 1) {
sum = carry + digit;
if(sum / 10 == 1) {
carry = 1;
sum = sum % 10;
f_itl[i] = sum + '0';
}
else {
carry = 0;
f_itl[i] = sum + '0';
}
}
else break;//printf("Char in else : %c\n", f_itl[i]);
}
}
if(carry == 1) {
char *new_intal;
int i;
new_intal = (char *)malloc(sizeof(char) * strlen(f_itl) + 2);//+2 because, 1 for new increase in array size, 1 for NULL character
new_intal[0] = '1';//Carry, i.e., 1
for(i = 1; i <= strlen(f_itl); i++)
new_intal[i] = f_itl[i - 1];//To extract the number from the string
new_intal[i] = '\0';
intal_destroy(intal);
return new_intal;
}
//printf("The inc. string : %s\n", f_itl);
return f_itl;
}
void* intal_decrement(void* intal) {
char *f_itl = (char *)intal;
char *nan = NULL;
if(intal == NULL) return nan;
int i, borrow = 0, diff = 0;
int digit;
int org_len = strlen(intal);//Original length of string, before decrementation.
if(strlen(intal) == 1 && f_itl[0] == '0') return intal;
if(strlen(intal) == 1 && f_itl[0] == '1') {
f_itl[0] = '0';
return f_itl;
}
for(i = strlen(intal) - 1; i >= 0; i--) {
digit = f_itl[i] - '0';
if(i == strlen(intal) - 1) {
if(digit == 0) {
borrow += 1;
f_itl[i] = 9 + '0';
}
else {
diff = digit - 1;
f_itl[i] = diff + '0';
}//printf("Char in if : %c\n", f_itl[i]);
}
else {
if(digit != 0 && borrow > 0) {
diff = digit - borrow;
borrow -= 1;
f_itl[i] = diff + '0';
}
//Filling all 0s with 9, because of borrow.
else if(borrow != 0) {
f_itl[i] = 9 + '0';
}
else {
//f_itl[i] = digit + '0';
break;
}//printf("Char in else : %c\n", f_itl[i]);
}
}
//Creating new array if first digit becomes zero after decrementation
if(f_itl[0] == '0') {
char *new_intal;
int i;
new_intal = (char *)malloc(sizeof(char) * org_len);//+2 because, 1 for new increase in array size, 1 for NULL character
for(i = 0; i < (org_len - 1); i++)
new_intal[i] = f_itl[i + 1];//To extract the number from the string
new_intal[i] = '\0';
intal_destroy(intal);
return new_intal;
}
return f_itl;
}
void* intal_add(void* intal1, void* intal2) {
if(intal1 == NULL || intal2 == NULL) return NULL;
char *itl1 = (char *)intal1;
char *itl2 = (char *)intal2;
long int f_len;
long int i = 0, j = strlen(itl1) - 1, k = strlen(itl2) - 1;
int sum = 0, carry = 0;
if(intal_compare(intal1, intal2) > 0) f_len = strlen(itl1);
else f_len = strlen(itl2);
char *f_itl = (char *)malloc(sizeof(char) * (f_len + 1));//One extra for NULL character
f_itl[f_len] = '\0';//printf("Length : %ld\n", f_len);
i = f_len - 1;//To access the last digit(because, \0 and 0-based indexing)
while(i >= 0 && j >= 0 && k >= 0) {
sum = (itl1[j] - '0') + (itl2[k] - '0') + carry;//printf("i = %d j = %d k = %d\n", i, j, k);
j -= 1;k -= 1;
if(sum / 10 > 0) {
carry = sum / 10;
f_itl[i] = (sum % 10) + '0';
}
else {
f_itl[i] = sum + '0';
carry = 0;
}//printf("Array : %d\n", f_itl[i] - '0');
i -= 1;
}
while(i >= 0 && k >= 0) {
sum = (itl2[k] - '0') + carry;//printf("i = %d j = %d k = %d\n", i, j, k);
k -= 1;
if(sum / 10 > 0) {
carry = sum / 10;
f_itl[i] = (sum % 10) + '0';
}
else {
f_itl[i] = sum + '0';
carry = 0;
}//printf("Array : %d\n", f_itl[i] - '0');
i -= 1;
}
while(i >= 0 && j >= 0) {
sum = (itl1[j] - '0') + carry;//printf("i = %d j = %d k = %d\n", i, j, k);
j -= 1;
if(sum / 10 > 0) {
carry = sum / 10;
f_itl[i] = (sum % 10) + '0';
}
else {
f_itl[i] = sum + '0';
carry = 0;
}//printf("Array : %d\n", f_itl[i] - '0');
i -= 1;
}
if(carry != 0) {
char *new_intal;
int i;
new_intal = (char *)malloc(sizeof(char) * strlen(f_itl) + 2);//+2 because, 1 for new increase in array size, 1 for NULL character
new_intal[0] = '1';
new_intal[0] = carry + '0';//Carry, i.e., 1
for(i = 1; i <= strlen(f_itl); i++)
new_intal[i] = f_itl[i - 1];//To extract the number from the string
new_intal[i] = '\0';
intal_destroy(f_itl);
return new_intal;
}
return f_itl;
}
void* intal_diff(void* intal1, void* intal2) {
if(intal1 == NULL || intal2 == NULL) return NULL;
char *itl1;
char *itl2;
char *f_itl;
int check = intal_compare(intal1, intal2);
if(check > 0) {
itl1 = (char *)intal1;
itl2 = (char *)intal2;
}
else if(check < 0){
itl1 = (char *)intal2;
itl2 = (char *)intal1;
}
else {
return zero_array();
}
//If smaller operand is '1', simply calling intal_decrement() and return decremented value
if(strlen(itl2) == 1 && itl2[0] == '1') {
f_itl = (char *)malloc(sizeof(char) * (strlen(itl1) + 1));
strcpy(f_itl, itl1);
f_itl[strlen(itl1)] = '\0';
return(intal_decrement(f_itl));
}
long int f_len = strlen(itl1);
long int i = strlen(itl1) - 1, j = strlen(itl2) - 1, k;
int diff = 0, borrow = 0, unwant = 0;
f_itl = (char *)malloc(sizeof(char) * (f_len + 1));//One extra for NULL character
f_itl[f_len] = '\0';
k = f_len - 1;//Points to last location of resultant array
while(k >= 0 && i >= 0 && j >= 0) {
diff = (itl1[i] - '0') - (itl2[j] - '0');//printf("i = %ld j = %ld k = %ld\n", i, j, k);printf("DIff : %d\n", diff);
if(diff < 0) {
f_itl[k] = (((itl1[i] - '0') + 10) - ((itl2[j] - '0') + borrow)) + '0';//'borrow' is added to second operand, to satisfy the borrowal
borrow = 1;
//printf("Borrow in IF : %d\n", borrow);printf("Array in if, f_itl[%ld] : %c\n\n", k, f_itl[k]);
}
else if(diff == 0 && borrow != 0) {
f_itl[k] = (((itl1[i] - '0') + 10) - ((itl2[j] - '0') + borrow)) + '0';
borrow = 1;
}
else {
//printf("Borrow in ELSE : %d\n", borrow);
f_itl[k] = diff - borrow + '0';
borrow = 0;//printf("Array in else, f_itl[%ld] : %c\n\n", k, f_itl[k]);
}
i -= 1;j -= 1;
k -= 1;
}
while(k >= 0 && i >= 0) {
diff = (itl1[i] - '0') - borrow;//printf("i = %ld j = %ld k = %ld\n", i, j, k);
//'borrow' is taken from a 0-digit
if(diff <= 0) {
f_itl[k] = (((itl1[i] - '0') + 10) - borrow) + '0';//'borrow' is added to second operand, to satisfy the borrowal
borrow = 1;//printf("Array in if, f_itl[%ld] : %c\n", k, f_itl[k]);
}
else {
f_itl[k] = diff + '0';
borrow = 0;
}
i -= 1;
k -= 1;
}
if(f_itl[0] < '0' || f_itl[0] > '9') {
int r;
for(r = 0; r < f_len; r++) {
if(f_itl[r] < '0' || f_itl[r] > '9')
unwant += 1;
}//printf("unwant : %d\n", unwant);
for(r = 0; f_itl[r + unwant] != '\0'; r++) {
f_itl[r] = f_itl[r + unwant];
}
f_itl[r] = '\0';
}
if(f_itl[0] == '0') {
char *new_itl = intal_create(f_itl);
free(f_itl);
return new_itl;
}
return f_itl;
}
void* intal_multiply(void* intal1, void* intal2) {
if(intal1 == NULL || intal2 == NULL) return NULL;
char *itl1, *itl2, *f_itl;
if(intal_compare(intal1, intal2) > 0) {
itl1 = (char *)intal1;
itl2 = (char *)intal2;
}
else {
itl1 = (char *)intal2;
itl2 = (char *)intal1;
}
long int i1_len = strlen(itl1), i2_len2 = strlen(itl2);
if(i2_len2 == 1 || i1_len == 1) {
if(itl2[0] == '0' || itl1[0] == '0')
return zero_array();
if(itl2[0] == '1' && i2_len2 == 1) {
f_itl = (char *)malloc(sizeof(char) * (strlen(itl1) + 1));
strcpy(f_itl, itl1);
f_itl[strlen(itl1)] = '\0';
return f_itl;
}
if(itl1[0] == '1' && i1_len == 1) {
f_itl = (char *)malloc(sizeof(char) * (strlen(itl2) + 1));
strcpy(f_itl, itl2);
f_itl[strlen(itl2)] = '\0';
return f_itl;
}
}
long int i, j = i2_len2 - 1;
long int f_len = i1_len + i2_len2;
long int i2_len = j;
f_itl = (char *)malloc(sizeof(char) * (f_len + 1));//+1 for NULL character
for(int w = 0; w < f_len; w++) f_itl[w] = '0';
f_itl[f_len] = '\0';
long int k = f_len - 1;
int carry = 0, prod = 0, sum = 0, s_carry = 0;
while(j >= 0) {
i = i1_len - 1;
while(i >= 0) {
prod = ((itl2[j] - '0') * (itl1[i] - '0')) + carry;//printf("Prod : %d\n", prod);
if(prod >= 10) {
carry = prod / 10;//printf("First prod : %d\t", prod);
sum = (f_itl[k] - '0') + (prod % 10) + s_carry;//printf("First sum : %d\n", sum);
if(sum > 9) {
s_carry = sum / 10;
f_itl[k] = (sum % 10) + '0';
}
else {
s_carry = 0;
f_itl[k] = sum + '0';
}//printf("First : f_itl[%d] : %c\n", k, f_itl[k]);
}
else {
carry = 0;//printf("Second prod : %d\t", prod);
sum = (f_itl[k] - '0') + prod + s_carry;//printf("Second sum : %d\n", sum);
if(sum > 9) {
s_carry = sum / 10;
f_itl[k] = (sum % 10) + '0';
}
else {
s_carry = 0;
f_itl[k] = sum + '0';
}//printf("Second : f_itl[%d] : %c\n", k, f_itl[k]);
}//printf("k val, i val : %d\t%d\n\n", k, i);
k -= 1;
i -= 1;
}//printf("Carry : %d\n", carry);
if(carry != 0 || s_carry != 0) {
sum = (f_itl[k] - '0') + carry + s_carry;//printf("Last sum : %d\n", sum);
if(sum > 9) {
s_carry = sum / 10;
f_itl[k] = (sum % 10) + '0';
}
else {
s_carry = 0;
f_itl[k] = sum + '0';
}
carry = 0;//printf("f_itl[%d] : %c\n\n", k, f_itl[k]);
k -= 1;
}
j -= 1;
k = (f_len - 1) - (i2_len - j);//One vacant space after multiplication of one digit j with itl1
}
if(f_itl[0] == '0') {
char *new_itl = intal_create(f_itl);
free(f_itl);
return new_itl;
}
return f_itl;
}
void* intal_divide(void* intal1, void* intal2)
{ if(!intal1) return NULL;
if(!intal2) return NULL;
if (!strcmp(intal2str(intal2), "0"))
return NULL;
if (!strcmp(intal2str(intal1), "0"))
return intal_create("0");
if (!intal_compare(intal1, intal2))
return intal_create("1");
if (-1==intal_compare(intal1, intal2))
return intal_create("0");
char *intal11 = intal2str(intal1);
char *intal22 = intal2str(intal2);
char *partintal1 = (char*)malloc(sizeof(char*) * strlen(intal22));
partintal1[0] = intal11[0];
int i = 0;
char *result;
char *res = (char*)malloc(sizeof(char) * strlen(intal11));
int count = 0;
while(intal_compare(intal_create(partintal1), intal2) != 1)
{
i++;
partintal1[i] = intal11[i];
}
partintal1 = realloc(partintal1, sizeof(partintal1)+sizeof(char));
int index=0, length=1;
while(i < strlen(intal11))
{
while(intal_compare(intal_create(partintal1), intal2) >= 0)
{
strcpy(partintal1, intal2str(intal_diff(intal_create(partintal1), intal2)));
count++;
}
result = (char*)malloc(sizeof(char));
result[index] = count + '0';
strcat(res, intal2str(intal_create(result)));
count = 0;
strcpy(partintal1, intal2str(intal_create(partintal1)));
int j = strlen(partintal1) - 1;
if(!intal11[i+1]) break;
while(intal_compare(intal_create(partintal1), intal2) != 1)
{ j++; i++;
partintal1[j] = intal11[i];
break;
}
}
return intal_create(res);
}
static void* power_divide(void* intal1, void* intal2) {
if(intal1 == NULL || intal2 == NULL) return NULL;
char *itl1 = (char *)intal1;//dividend
char *itl2 = (char *)intal2;//divisor
char *f_itl;//quotient
//Return NaN, if anyone of the second operand is zero.
if(strlen(itl2) == 1 && itl2[0] == '0') {
char *nan = NULL;
return nan;
}
int flag = intal_compare(intal1, intal2), i;
if(flag < 0)
return zero_array();
else if(flag == 0) {
f_itl = (char *)malloc(sizeof(char) * 2);
f_itl[0] = '1';
f_itl[1] = '\0';
return f_itl;
}
char *new_itl1 = (char *)malloc(sizeof(char) * (strlen(itl1) + 1));//Intermediate dividend
strcpy(new_itl1, itl1);
new_itl1[strlen(itl1)] = '\0';
char *new_itl12;
long int f_len = strlen(itl1) - strlen(itl2) + 1;
f_itl = (char *)malloc(sizeof(char) * (f_len + 1));
f_itl[f_len] = '\0';
for(int w = 0; w < f_len; w++) f_itl[w] = '0';
flag = intal_compare((void *)new_itl1, (void *)itl2);
while(flag >= 0) {
new_itl12 = intal_diff(new_itl1, itl2);//passing string(or void)
strcpy(new_itl1, new_itl12);
new_itl1[strlen(new_itl12)] = '\0';
free(new_itl12);
f_itl = intal_increment(f_itl);//passing string(or void)
flag = intal_compare(new_itl1, itl2);
}
free(new_itl1);
if(f_itl[0] == '0') {
char *new_intal = (char *)malloc(sizeof(char) * f_len);
for(i = 1; i < f_len; i++)
new_intal[i - 1] = f_itl[i];//To extract the number from the string
new_intal[f_len - 1] = '\0';
intal_destroy(f_itl);
return new_intal;
}
return f_itl;
}
int intal_compare(void* intal1, void* intal2) {
if(intal1 == NULL || intal2 == NULL) return 0;
char *itl1 = (char *)intal1;
char *itl2 = (char *)intal2;
int len1 = strlen(itl1);
int len2 = strlen(itl2);
if(len1 == len2) {
int i = 0;
while(i < len1) {
if(itl1[i] - '0' == itl2[i] - '0')
i += 1;
else if(itl1[i] - '0' > itl2[i] - '0')
return 1;
else
return -1;
}
if(i == len2)
return 0;
}
else if(len1 > len2)
return 1;
else
return -1;
}
void* intal_pow(void* intal1, void* intal2) {
if(intal1 == NULL || intal2 == NULL) return NULL;
char *itl1 = (char *)intal1, *itl2 = (char *)intal2, *f_itl;
long int i1_len = strlen(itl1), i2_len = strlen(itl2), f_len = 0;
if(itl2[0] == '0' && itl1[0] == '0')
return zero_array();
if((itl1[0] == '1' && i1_len == 1) || (itl2[0] == '0' && i2_len == 1)) {
f_itl = (char *)malloc(sizeof(char) * 2);
f_itl[0] = '1';
f_itl[1] = '\0';
return f_itl;
}
if(itl2[0] == '1' && i2_len == 1) {
f_itl = (char *)malloc(sizeof(char) * (strlen(itl2) + 1));
strcpy(f_itl, itl1);
f_itl[strlen(itl1)] = '\0';
return f_itl;
}
char *base = (char *)malloc(sizeof(char) * (i1_len + 1));
strcpy(base, itl1);
base[i1_len] = '\0';
char *power = (char *)malloc(sizeof(char) * (i2_len + 1)), *p_temp;
strcpy(power, itl2);
power[i2_len] = '\0';
char *divby2 = (char *)malloc(sizeof(char) * 2);
divby2[0] = '2';divby2[1] = '\0';
char *initial = (char *)malloc(sizeof(char) * 2);
initial[0] = '1';initial[1] = '\0';
while(1) {//printf("Pow : %s\n", power);
if(strlen(power) != 1 || power[0] != '1') {
if((power[strlen(power) - 1] - '0') % 2 == 1) {
power = intal_decrement(power);
initial = intal_multiply(base, initial);
}
base = intal_multiply(base, base);
p_temp = power_divide(power, divby2);//printf("Exp : %s\n", base);
free(power);
power = p_temp;
}
else break;
}
base = intal_multiply(base, initial);//printf("Exp : %s\n", base);
free(initial);
free(power);
return base;
}