Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- 1-1
- // function to return sum of elements in array
- int sum_array(int array[], int n)
- {
- int sum=0;
- for(int i=0; i<n; i++){
- if(n>0)
- sum = sum + array[i];
- else sum = 0;
- }
- return sum;
- }
- 1-2
- // function to return average of elements in an array
- double average(int array[], int n)
- {
- double average = 0;
- double sum = 0;
- for(int i=0; i<n; i++){
- sum = sum + array[i];
- }
- if (n>0)
- average = sum/n;
- else average = 0;
- return average;
- }
- 1-3
- // function to return number of elements that equal given parameter
- int count(int array[], int n, int num)
- {
- int equal = 0;
- for(int i=0; i<n; i++){
- if(array[i]==num)
- equal++;
- }
- return equal;
- }
- 1-5
- // function to count number of even numbers between 1 and given number
- int count_even(int number)
- {
- int count = 0;
- for (int i=1; i<=number; i++){
- if(i%2==0)
- count++;
- }
- return count;
- }
- 2-1
- // function to return smallest number in an array
- int minimum(int array[], int n)
- {
- int min = array[0];
- for(int i=0; i<n; i++){
- if(array[i] < min)
- min = array[i];
- }
- return min;
- }
- 2-2
- // function to return maximum element in array
- int maximum(int array[], int n)
- {
- int max = array[0];
- for(int i=0; i<n; i++){
- if(max < array[i])
- max = array[i];
- }
- return max;
- }
- 2-4
- // function to determine if array is in ascending order
- bool ascending(int array[], int n)
- {
- for(int i=0; i<n; i++){
- if(array[i] > array[i+1])
- return false;
- }
- return true;
- }
- 2-5
- // function to determine if elements in array are descending
- bool descending(int array[], int n)
- {
- for(int i=0; i<n-1; i++){
- if(array[i] < array[i+1])
- return false;
- }
- return true;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement