-
Notifications
You must be signed in to change notification settings - Fork 0
/
20.cpp
75 lines (64 loc) · 1.55 KB
/
20.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
/******************************************************************************
check whether array is sorted or not using recursion
*******************************************************************************/
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
bool sorted(int a[],int n){
if(n==1){
return 1;
}
// yeh baki ka array check karega
bool restarray=sorted(a+1,n-1);
return (a[0]<a[1] && restarray);
// return statemnet main hai agar a[0]<a[1] aur baki ka array agar dono return true karte hai to array sorted hai
}
int main()
{
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++){
cin>>a[i];
}
if(sorted(a,n)){
cout<<"The array is sorted"<<endl;
}
else{
cout<<"The array is not sorted"<<endl;
}
return 0;
}
/******************************************************************************
print no in increaing and decreasing order using recursion
*******************************************************************************/
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
void printI(int n){
if(n==0){
return;
}
printI(n-1);
cout<<n<<" ";
}
void printD(int n){
if(n==0){
return;
}
cout<<n<<" ";
printD(n-1);
}
int main()
{
int n;
cin>>n;
// int a[n];
// for(int i=0;i<n;i++){
// cin>>a[i];
// }
printD(n);
cout<<endl;
printI(n);
return 0;
}