cpp/Q19.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

//19. Check if the array arr = [1, 2, 3, 4, 5] is sorted in ascending order, and print true or false.

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

bool isSortedConcise(int arr[], int size) {
    return std::is_sorted(arr, arr + size);
}

int main() {
    int arr[] = {1, 2, 3, 4, 5};
    int size = sizeof(arr) / sizeof(arr[0]);

    bool result = isSortedConcise(arr, size);
    cout << (result ? "True" : "False") << endl;

    return 0;
}

#include <iostream>
using namespace std;

bool isSortedBruteForce(int arr[], int size) {
    for (int i = 0; i < size - 1; i++) {
        if (arr[i] > arr[i + 1]) {
            return false;
        }
    }
    return true;
}

int main() {
    int arr[] = {1, 2, 3, 4, 5};
    int size = sizeof(arr) / sizeof(arr[0]);

    bool result = isSortedBruteForce(arr, size);
    cout << (result ? "True" : "False") << endl;

    return 0;
}

#include <iostream>
using namespace std;

bool isSortedOptimized(int arr[], int size) {
    for (int i = 0; i < size - 1; i++) {
        if (arr[i] > arr[i + 1]) {
            return false;
        }
    }
    return true;
}

int main() {
    int arr[] = {1, 2, 3, 4, 5};
    int size = sizeof(arr) / sizeof(arr[0]);

    bool result = isSortedOptimized(arr, size);
    if (result) {
        cout << "True" << endl;
    } else {
        cout << "False" << endl;
    }

    return 0;
}