10.3
#include <stdio.h> int return_max (const int *index, int n); int main(void) { const int array[10]={1, 5 ,2, 6, 8, 10, 15, 6,21,-10}; printf("the max number of array is %d",return_max(array,10)); return 0; } int return_max(const int *index, int n) { int max_number; int i; for(i = 1, max_number = index[0]; i < n ; i++) { if (max_number < index[i]) max_number = index[i]; } return max_number; }
10.4
#include <stdio.h> int return_index (double *array, int n); int main(void) { double array [10] = {2.2, 2.5, 8.5, 64.4, 5.1, 10.2, 9.7, 99.7, 10.5, 55.8}; printf("the max number's index is %d",return_index(array,10)); return 0; } int return_index(double *array, int n) { int i,index; double max_number; for (i = 0 ,index = 0, max_number = array[index]; i < n; i++) { if (max_number < array[i]) { index = i; max_number = array[i]; } } return index; }
10.5
#include <stdio.h> double return_index (double *array, int n); int main(void) { double array [10] = {1.1, 2.5, 8.5, 64.4, 5.1, 10.2, 9.7, 99.7, 10.5, 55.8}; printf("the number is %.1f",return_index(array,10)); return 0; } double return_index(double *array, int n) { int i; double max_number, min_number; for (i = 1 , max_number = array[0],min_number = array[0]; i < n; i++) { if (max_number < array[i]) { max_number = array[i]; } if (min_number > array[i]) { min_number = array[i]; } } return (max_number - min_number); }