Breaking News: Grepper is joining You.com. Read the official announcement!

Divide and conquer multiplication

Fantastic Flatworm answered on December 2, 2022 Popularity 8/10 Helpfulness 4/10

answer Divide and conquer multiplication

Divide and conquer multiplication

Comment

// C++ code to demonstrate Divide and
// Conquer Algorithm#include<iostream>
# include<iostream>
using namespace std;
  
// function to find the maximum no.
// in a given array.
int DAC_Max(int arr[], int index, int l)
{
    int max;
    if(l - 1 == 0)
    {
      return arr[index];
    }
    if(index >= l - 2)
    {
        if(arr[index] > arr[index + 1])
          return arr[index];
        else
          return arr[index + 1];
    }  
    max = DAC_Max(arr, index + 1, l);    
    if(arr[index] > max)
       return arr[index];
    else
       return max;
}
  
// Function to find the minimum no.
// in a given array
int DAC_Min(int arr[], int index, int l)
{
    int min;
      if(l - 1 == 0)
    {
      return arr[index];
    }
    if(index >= l - 2)
    {
        if(arr[index] < arr[index + 1])
          return arr[index];
        else
          return arr[index + 1];
    }
      
    min = DAC_Min(arr, index + 1, l);   
    if(arr[index] < min)
       return arr[index];
    else
       return min;
}
  
// Driver code
int main()
{
    int arr[] = {120, 34, 54, 32, 58, 11, 90};
    int n = sizeof(arr) / sizeof(arr[0]);
    int max, min;
    max = DAC_Max(arr, 0, n);
    min = DAC_Min(arr, 0, n);
    cout << "Maximum: " << max << endl;
    cout << "Minimum: " << min << endl;
    return 0;
}
  
// This code is contributed by probinsah.

Popularity 8/10 Helpfulness 4/10 Language cpp

Source: www.geeksforgeeks.org

Tags: c++ divide-and-conquer

Link to this answer
Share Copy Link

Contributed on Dec 02 2022

Fantastic Flatworm

0 Answers Avg Quality 2/10

Divide and conquer multiplication

Contents

More Related Answers

Divide and conquer multiplication

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.