Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdlib.h>
- int get_largest_number(int* array, unsigned int SIZE)
- {
- int i;
- int max = 0;
- for(i = 0; i <= SIZE; i++)
- {
- if(array[i] > max)
- {
- max = array[i];
- }
- }
- return max;
- }
- int main ()
- {
- int *array;
- unsigned int SIZE;
- printf("nEnter size of array: ");
- scanf ("%d", &SIZE);
- int i;
- printf("nEnter %d elements: nn", SIZE);
- array = malloc(sizeof(int) * SIZE);
- for (i = 0; i <= SIZE; i++)
- {
- printf("array[%d] = ", i);
- scanf("%d", &array[i]);
- }
- printf("The largest number: ", get_largest_number(array, SIZE));
- return 0;
- }
- for (i = 0; i <= SIZE; i++)
- for (i = 0; i < SIZE; i++)
- printf("The largest number: %dn"
- #include <stdio.h>
- #include <stdlib.h>
- int get_largest_number(int* array, unsigned int SIZE)
- {
- int i;
- int max = array[0];
- for(i = 1; i < SIZE; i++)
- {
- if(array[i] > max)
- {
- max = array[i];
- }
- }
- return max;
- }
- int main ()
- {
- int *array;
- unsigned int SIZE;
- printf("nEnter size of array: ");
- scanf ("%d", &SIZE);
- int i;
- printf("nEnter %d elements: nn", SIZE);
- array = malloc(sizeof(int) * SIZE);
- for (i = 0; i < SIZE; i++)
- {
- printf("array[%d] = ", i);
- scanf("%d", &array[i]);
- }
- printf("The largest number: %dn", get_largest_number(array, SIZE));
- free(array);
- return 0;
- }
- max = 0;
- for(i = 0; i <= SIZE; i++)
- for(i = 0; i < SIZE; i++)
- int get_largest_number(int* array, unsigned int SIZE) {
- if (SIZE <= 0)
- // что-то вернуть, если элементов нет
- int max = array[0];
- for(int i = 1; i < SIZE; i++) {
- if(array[i] > max)
- max = array[i];
- }
- return max;
- }
- max = MIN_INT;
Add Comment
Please, Sign In to add comment