Checking if the array is sorted or not using c++

Author: MohammadFahad1

.cph/.Insert_it.cpp_28d48cf57636c54b50b466931c9a63c4.prob

@@ -0,0 +1 @@
+{"name":"Insert it","group":"HackerRank - Assignment 01 | Basic Data Structure | Batch 05","url":"https://www.hackerrank.com/contests/assignment-01-a-basic-data-structure-a-batch-05/challenges/insert-the-vector","interactive":false,"memoryLimit":512,"timeLimit":4000,"tests":[{"input":"5\n2 3 4 5 6\n3\n10 20 30\n3\n","output":"2 3 4 10 20 30 5 6\n","id":1720457307283},{"input":"5\n2 3 4 5 6\n3\n10 20 30\n0\n","output":"10 20 30 2 3 4 5 6\n","id":1720457307201},{"input":"4\n3 4 5 6\n3\n10 20 30\n4\n","output":"3 4 5 6 10 20 30\n","id":1720457307230}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"InsertIt"}},"batch":{"id":"6b38f826-f801-4885-9a41-cc20efb0e01f","size":1},"srcPath":"f:\\Tutorials\\Video Tutorials\\Phitron\\3. Basic Data Structures\\Insert_it.cpp"}

.cph/.Sorted.cpp_806eca4818762cabd6e39a68f2d3a557.prob

@@ -0,0 +1 @@
+{"name":"Sorted","group":"HackerRank - Assignment 01 | Basic Data Structure | Batch 05","url":"https://www.hackerrank.com/contests/assignment-01-a-basic-data-structure-a-batch-05/challenges/sorted-2-2","interactive":false,"memoryLimit":512,"timeLimit":4000,"tests":[{"id":1720452186610,"input":"3\n5\n2 4 6 7 10\n8\n1 100 101 120 120 121 1000 1000\n4\n100 1 102 12\n","output":"YES\nYES\nNO\n"}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"Sorted"}},"batch":{"id":"e3d0163d-cb58-4d18-9f49-f40529f81c89","size":1},"srcPath":"f:\\Tutorials\\Video Tutorials\\Phitron\\3. Basic Data Structures\\Sorted.cpp"}

.vscode/settings.json

@@ -0,0 +1,5 @@
+{
+  "files.associations": {
+    "iostream": "cpp"
+  }
+}

Insert_it.cpp

@@ -0,0 +1,35 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int main()
+{
+    int t;
+    cin >> t;
+    while (t--)
+    {
+        int n;
+        cin >> n;
+        int a[n];
+        bool flag = true;
+        for (int i = 0; i < n; i++)
+        {
+            cin >> a[i];
+        }
+
+        for (int i = 1; i < n; i++)
+        {
+            if (a[i - 1] > a[i])
+            {
+                flag = false;
+                break;
+            }
+        }
+
+        if (flag)
+            cout << "YES" << endl;
+        else
+            cout << "NO" << endl;
+    }
+
+    return 0;
+}

Sorted.bin

@@ -1,2 +1,7 @@
+3
 5
-1 2 3 4 5
+2 4 6 7 10
+8
+1 100 101 120 120 121 1000 1000
+4
+100 1 102 12

Sorted.cpp

@@ -1 +1,3 @@
+YES
+YES
 NO