```
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.
```

pestallozi 0 Newbie Poster

Gonbe 32 Newbie Poster

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

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

pestallozi 0 Newbie Poster

Be a part of the DaniWeb community

We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.