Answered

Explore Westonci.ca, the top Q&A platform where your questions are answered by professionals and enthusiasts alike. Explore a wealth of knowledge from professionals across different disciplines on our comprehensive platform. Explore comprehensive solutions to your questions from knowledgeable professionals across various fields on our platform.

Write a recursive function that returns 1 if an array of size n is in sorted order and 0 otherwise. Note: If array a stores 3, 6, 7, 7, 12, then isSorted(a, 5) should return 1 . If array b stores 3, 4, 9, 8, then isSorted(b, 4) should return 0.

Sagot :

MrRoyal

Answer:

The function in C++ is as follows:

int isSorted(int ar[], int n){

if ([tex]n == 1[/tex] || [tex]n == 0[/tex]){

 return 1;}

if ([tex]ar[n - 1][/tex] < [tex]ar[n - 2][/tex]){

 return 0;}

return isSorted(ar, n - 1);}

Explanation:

This defines the function

int isSorted(int ar[], int n){

This represents the base case; n = 1 or 0 will return 1 (i.e. the array is sorted)

if ([tex]n == 1[/tex] || [tex]n == 0[/tex]){

 return 1;}

This checks if the current element is less than the previous array element; If yes, the array is not sorted

if ([tex]ar[n - 1][/tex] < [tex]ar[n - 2][/tex]){

 return 0;}

This calls the function, recursively

return isSorted(ar, n - 1);

}

Your visit means a lot to us. Don't hesitate to return for more reliable answers to any questions you may have. Thanks for using our platform. We aim to provide accurate and up-to-date answers to all your queries. Come back soon. Discover more at Westonci.ca. Return for the latest expert answers and updates on various topics.