Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<stdio.h>
- void print_biggest_margin(int arr[], int size);
- int main()
- {
- int arr[] = {2, 3, 1, 9, 5, 8};
- int size = 6;
- print_biggest_margin(arr, size);
- }
- void print_biggest_margin(int arr[], int size)
- {
- int max, min;
- if(arr[0] > arr[1])
- {
- max = arr[0];
- min = arr[1];
- }
- else
- {
- max = arr[1];
- min = arr[0];
- }
- int biggestMargin = max-min;
- int biggestMarginIndex = 1;
- for(int i = 2; i < size-1; i+=2)
- {
- if(arr[i] > arr[i+1])
- {
- max = arr[i];
- min = arr[i+1];
- }
- else
- {
- max = arr[i+1];
- min = arr[i];
- }
- if(max-min > biggestMargin)
- {
- biggestMargin = max-min;
- biggestMarginIndex = (i + 2) / 2;
- }
- }
- printf("Pair #%d has the biggest margin of %d.", biggestMarginIndex, biggestMargin);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement