1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147
|
#ifndef MYFUNCTIONS_H_INCLUDED
#define MYFUNCTIONS_H_INCLUDED
#include<cassert>
using namespace std;
int max(int m,int n)
{
int maxNum;
if(m>n)
{
maxNum=m;
}
else
{
maxNum=n;
}
return maxNum;
}
double max(double m, double n)
{
int maxNum;
if(m>n)
{
maxNum=m;
}
else
{
maxNum=n;
}
return maxNum;
}
int max(int m[ ],int n)
{
int maxArr = m[10];
for(int i = 1; i < n; i++)
if(m[i] > maxArr)
maxArr = m[i];
return maxArr;
}
double max (double m[ ], int n)
{
}
double max (double m[ ], double n)
{
}
int min ( int m, int n )
{
int minNum;
if(m<n)
{
m=minNum;
}
else
{
n=minNum;
}
return minNum;
}
double min (double m, double n)
{
int minNum;
if(m<n)
{
minNum=m;
}
else
{
minNum=n;
}
return minNum;
}
int min (int m[ ], int n)
{
}
double min (double m[ ], double n)
{
}
int absoluteValue ( int m)
{
int absVal;
if(m>0)
{
absVal = m;
}
else
{
absVal = -(m);
}
return absVal;
}
double absoluteValue ( double m )
{
}
double factorial( int n)
{
double val=1;
assert(n>=0);
while(n>0)
{
val *= n;
n--;
}
return val;
}
double combination( int m, int n)
{
}
double permutation( int m, int n)
{
}
#endif // MYFUNCTIONS_H_INCLUDED
|