cpp/Q20.cpp at main · Priyasha-Yadav/cpp · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74

// 20. Find and print the difference between the maximum and minimum elements in arr = [80, 30, 70, 50, 20].

#include <iostream>
using namespace std;

int findDifferenceSingleLoop(int arr[], int size) {
    int maxElement = arr[0];
    int minElement = arr[0];

    for (int i = 1; i < size; i++) {
        if (arr[i] > maxElement) {
            maxElement = arr[i];
        }
        if (arr[i] < minElement) {
            minElement = arr[i];
        }
    }

    return maxElement - minElement;
}

int main() {
    int arr[] = {80, 30, 70, 50, 20};
    int size = sizeof(arr) / sizeof(arr[0]);

    cout << "Difference (Single Loop): " << findDifferenceSingleLoop(arr, size) << endl;
    return 0;
}


#include <iostream>
#include <algorithm>
using namespace std;

int findDifferenceBuiltIn(int arr[], int size) {
    int maxElement = *max_element(arr, arr + size);
    int minElement = *min_element(arr, arr + size);
    return maxElement - minElement;
}

int main() {
    int arr[] = {80, 30, 70, 50, 20};
    int size = sizeof(arr) / sizeof(arr[0]);
    cout << "Difference (Built-in): " << findDifferenceBuiltIn(arr, size) << endl;
    return 0;
}

#include <iostream>
using namespace std;

int findDifferenceSingleLoop(int arr[], int size) {
    int maxElement = arr[0];
    int minElement = arr[0];

    for (int i = 1; i < size; i++) {
        if (arr[i] > maxElement) {
            maxElement = arr[i];
        }
        if (arr[i] < minElement) {
            minElement = arr[i];
        }
    }

    return maxElement - minElement;
}

int main() {
    int arr[] = {80, 30, 70, 50, 20};
    int size = sizeof(arr) / sizeof(arr[0]);

    cout << "Difference (Single Loop): " << findDifferenceSingleLoop(arr, size) << endl;
    return 0;
}