Answer:
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main()
{
int arr[100];
int i = 0;
int j = 0;
char c[10];
char temp;
int sum = 0;
FILE* fp;
if ((fp = fopen("test.txt", "r")) == NULL) {
printf("cannot open the file");
return;
}
else {
do {
temp = fgetc(fp);
if (temp == ' ' || temp == '\n') {
c[j] = '\0';
arr[i++] = atoi(c);
j = 0;
continue;
}
c[j++] = temp;
} while (temp != EOF);
for (j = i - 1; j >= 0; j--) {
printf("%d\n", arr[j]);
}
}
getchar();
}
Explanation:
<span>Speak up more so people don't think you're rude</span>
# is used to begin a comment.
Answer:
Explanation:
Since all of the items in the array would be integers sorting them would not be a problem regardless of the difference in integers. O(n) time would be impossible unless the array is already sorted, otherwise, the best runtime we can hope for would be such a method like the one below with a runtime of O(n^2)
static void sortingMethod(int arr[], int n)
{
int x, y, temp;
boolean swapped;
for (x = 0; x < n - 1; x++)
{
swapped = false;
for (y = 0; y < n - x - 1; y++)
{
if (arr[y] > arr[y + 1])
{
temp = arr[y];
arr[y] = arr[y + 1];
arr[y + 1] = temp;
swapped = true;
}
}
if (swapped == false)
break;
}
}
