The document contains code to check if an array is sorted or not using recursion. It defines a function isSorted that takes an array and size as parameters and recursively checks if each element is greater than the next element. It also defines a function returnValue that returns a string "Not" or "completely" depending on the boolean value passed. The main function calls isSorted on sample arrays and prints whether each array is sorted or not.

1. Find Array is sorted or not?
Recursion
&7Cipher

2. Program
&7Cipher
#include<iostream>
#include <string>
using namespace std;
string returnValue(int n){
if (n == 0)
{
return "Not";
}
else
{
return "completly";
}
}

3. Program
&7Cipher
bool isSorted(int a[], int size){
if (size == 0 || size == 1)
{
return true;
}
if (a[0] > a[1])
{
return false;
}
bool isSmallerSorted = isSorted(a + 1, size - 1);
return isSmallerSorted;
}

4. Program
&7Cipher
int main(){
int A[] = {1,3,5,6,3,32};
int B[] = {3,5,7,8,423,543,645};
int C[] = {1};
bool isASorted = isSorted(A,6);
cout << " Array A is " << returnValue(isASorted) << " Sorted" << endl ;
bool isBSorted = isSorted(B,7);
cout << " Array B is " << returnValue(isBSorted) << " Sorted" << endl ;
bool isCSorted = isSorted(C,1);
cout << " Array c is " << returnValue(isCSorted) << " Sorted" << endl ;
return 0;
}

5. Thanks for Watching
&7Cipher