-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathis_sorted_recursion.cpp
86 lines (59 loc) · 1.21 KB
/
is_sorted_recursion.cpp
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
75
76
77
78
79
80
81
82
83
84
85
86
/******************************************************************************
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.
*******************************************************************************/
#include <iostream>
using namespace std;
bool issorted(int a[],int n){
if(n==0 || n==1){
return true;
}
else if(a[0]>a[1]){
return false;
}
bool smallout = issorted(a+1,n-1);
return smallout;
}
int main()
{
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++){
cin>>a[i];
}
bool out = issorted(a,n);
cout<<out;
return 0;
}
// second method
#include <iostream>
using namespace std;
bool issorted(int a[],int n){
if(n==0 || n==1){
return true;
}
bool smallout = issorted(a+1,n-1);
if(!smallout){
return false;
}
if(a[0]>a[1]){
return false;
}
else{
return true;
}
}
int main()
{
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++){
cin>>a[i];
}
bool out = issorted(a,n);
cout<<out;
return 0;
}