Seal
Seal
Seal
1#include <stdio.h>
2. void sortDescending(int arr[], int n) {
3. int i, g, max_index, temp;
4.
5. // One after the other move the boundary of the unsorted subarray
6. for (i = 0; i < n - 1; i++) {
7. // Find the maximum element in the given unsorted array
8. max_index = i;
9. for (g = i + 1; g < n; g++) {
10. if (arr[g] > arr[max_index]) {
11. max_index = g;
12. }
13. }
14.
15. // Swap the found maximum element with the first element
16. temp = arr[max_index];
17. arr[max_index] = arr[i];
18. arr[i] = temp;
19. }
20. }
21. int main() {
22. int numbers[] = { 45, 29, 11, 89, 42, 100, 34, 22, 32 };
23. int n = sizeof(numbers) / sizeof(numbers[0]);
24.
25. sortDescending(numbers, n);
26.
27. printf("Sorted array from highest to lowest: \n");
28. for (int i = 0; i < n; i++) {
29. printf("%d ", numbers[i]);
30. }
31. printf("\n");
32.
33. return 0;
34. }
}
else if (Guess<randomNumber){
printf("Its too low!! Try again.\n");
}
else {
printf("Wow you made the right guess in %d attempts.\n",attempts);
}
} while ("guess!=randomNumber");
return 0;
}
#include<stdio.h>
#include<string.h>
int main()
{
char romanSymbols[] = { 'M','D','C','L','X','V','I' };
int romanValues[] = { 1000,500,100,50,10,5,1 };
int number;
char romanNumeral[20];
printf("Enter an integer value:");
scanf_s("%d", &number);
int i = 0;
while (number > 0); {
if (number >= romanValues[i]) {
strcat_s(romanNumeral, &romanSymbols[i]);
number -= romanValues[i];
}
else {
i++;
}
}
printf("Original integer;%d\n", number);
printf("Roman number of the integer;%s\n", romanNumeral);
return 0;
}