```
a) Write an algorithm to add and multiply two large integers, which cannot be
represented by built-in types.
b) Write a “c” function to find recursively the maximum and minimum element of
an array A of size “n” elements. Find also the number of comparisons required for
this.
a) Write an algorithm to add and multiply two large integers, which cannot be
represented by built-in types.
b) Write a “c” function to find recursively the maximum and minimum element of
an array A of size “n” elements. Find also the number of comparisons required for
this.
```

## Gonbe 32

nitin1
commented:
not even single effort seen , yet you give the code instead of advices +0

deceptikon
commented:
The OP's question falls under our homework rule. -2