Advertisement
Lirbo

C Q2

Feb 6th, 2023
1,165
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C 0.95 KB | None | 0 0
  1. #include<stdio.h>
  2.  
  3. void print_biggest_margin(int arr[], int size);
  4.  
  5. int main()
  6. {
  7.     int arr[] = {2, 3, 1, 9, 5, 8};
  8.     int size = 6;
  9.     print_biggest_margin(arr, size);
  10. }
  11.  
  12. void print_biggest_margin(int arr[], int size)
  13. {
  14.     int max, min;
  15.     if(arr[0] > arr[1])
  16.     {
  17.         max = arr[0];
  18.         min = arr[1];
  19.     }
  20.     else
  21.     {
  22.         max = arr[1];
  23.         min = arr[0];
  24.     }
  25.     int biggestMargin = max-min;
  26.     int biggestMarginIndex = 1;
  27.     for(int i = 2; i < size-1; i+=2)
  28.     {
  29.         if(arr[i] > arr[i+1])
  30.         {
  31.             max = arr[i];
  32.             min = arr[i+1];
  33.         }
  34.         else
  35.         {
  36.             max = arr[i+1];
  37.             min = arr[i];
  38.         }
  39.         if(max-min > biggestMargin)
  40.         {
  41.             biggestMargin = max-min;
  42.             biggestMarginIndex = (i + 2) / 2;
  43.         }
  44.     }
  45.     printf("Pair #%d has the biggest margin of %d.", biggestMarginIndex, biggestMargin);
  46. }
  47.  
  48.  
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement