48 lines
1.2 KiB
C
48 lines
1.2 KiB
C
/*
|
|
COS135 HW7
|
|
Nicholas Pease
|
|
Random Number Generation
|
|
|
|
*/
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
|
|
// Find lowest number in array nums
|
|
int find_lowest(int nums[], int size) {
|
|
// holds smallest number index, starts as 0
|
|
int lowest = 0;
|
|
for(int i = 0; i < (size/(int)sizeof(int)); i++) {
|
|
if (nums[i] < nums[lowest])
|
|
lowest = i;
|
|
}
|
|
// will always return something, no -1 needed
|
|
return lowest;
|
|
}
|
|
|
|
// Find lowest number in array nums
|
|
// int size = sizeof(array)
|
|
int find_highest(int nums[], int size) {
|
|
// holds largest number index, starts as 0
|
|
int highest = 0;
|
|
for(int i = 0; i < (size/(int)sizeof(int)); i++) {
|
|
if (nums[i] > nums[highest])
|
|
highest = i;
|
|
}
|
|
// will always return something, no -1 needed
|
|
return highest;
|
|
}
|
|
|
|
int main() {
|
|
// primary random number array and initialization
|
|
int nums[200];
|
|
for (int i =0; i < 200; i++) {
|
|
nums[i] = (rand() % 1000);
|
|
}
|
|
// call functions
|
|
int lowest = find_lowest(nums, sizeof(nums));
|
|
int highest = find_highest(nums, sizeof(nums));
|
|
// outputs
|
|
printf("Lowest number %d is at index %d\n",nums[lowest], lowest);
|
|
printf("Highest number %d is at index %d\n",nums[highest], highest);
|
|
return 0;
|
|
} |