Merhaba arkadaşlar şu an sınavdayım kaçak göçek girdim nete


1-) Non-decreasing Numbers: Make a recursion function to determine if a list of positive integer numbers are in non-decreasing order. Use 0 as sentinel to terminate the input. Make a program to your function.

Enter the integers. Use 0 to finish the input

2 3 4 4 5 7 0

Yes.

Enter the integers. Use 0 to finish the input

4 5 5 8 5

No.

2-) The Biggest Number: Make a program that gets a three-digit integer number and then prints the biggest number that can be obtained by re-arranging the digests of the given number. Use two user defined functions in your program: One function to separate the digits into three variables and another function to obtain the biggest number. Complete the following code. You may use additional functions.

#include<stdio.h>
void seperateDigits(int, int *,int *, int *);
int biggestNumber(int,int,int);
int main(){
   int num,d1,d2,d3;
   printf("Enter a number between 100 and 999: ");
   scanf("%d"&num);
   seperateDigits(num,&d1,&d2,&d3);
   num=biggestNumber(d1,d2,d3);
   printf("The result is %d./n",num);
   return 0;
}

Enter a number between 100 and 999: 253

The result is 532.