Skip to content

divide-n-conquer-hacktoberfest #2

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: main
Choose a base branch
from
Open

divide-n-conquer-hacktoberfest #2

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
54 changes: 54 additions & 0 deletions divide-n-conquer.c
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,54 @@
#include <stdio.h>
int DnC_Max(int a[], int index, int l);
int DnC_Min(int a[], int index, int l);
int DnC_Max(int a[], int index, int l)
{
int max;
if (index >= l - 2) {
if (a[index] > a[index + 1])
return a[index];
else
return a[index + 1];
}

max = DnC_Max(a, index + 1, l);

if (a[index] > max)
return a[index];
else
return max;
}

int DnC_Min(int a[], int index, int l)
{
int min;
if (index >= l - 2) {
if (a[index] < a[index + 1])
return a[index];
else
return a[index + 1];
}

min = DnC_Min(a, index + 1, l);

if (a[index] < min)
return a[index];
else
return min;
}

int main()
{
int min, max, N;

int a[7] = { 70, 250, 50, 80, 140, 12, 14 };

max = DnC_Max(a, 0, 7);

min = DnC_Min(a, 0, 7);
printf("The minimum number is : %d\n", min);
printf("The maximum number is : %d", max);
return 0;
}

// This code is contributed by Ashish Rana (GFG Team)