mirror of
https://github.com/theoludwig/libcproject.git
synced 2024-11-14 16:03:13 +01:00
Théo LUDWIG
2fd8d102e9
Also add `mathematics_max_values` and `mathematics_min_values` to check in array.
71 lines
1.9 KiB
C
71 lines
1.9 KiB
C
#include "mathematics.h"
|
|
|
|
bool mathematics_equals(const float number1, const float number2) {
|
|
return (number1 - number2) < MATHEMATICS_FLOAT_PRECISION;
|
|
}
|
|
|
|
unsigned long long mathematics_absolute_value(const long long number) {
|
|
if (number >= 0) {
|
|
return number;
|
|
}
|
|
return -number;
|
|
}
|
|
|
|
unsigned long long mathematics_pow(unsigned long long base, unsigned long long exponent) {
|
|
return exponent == 0 ? 1 : base * mathematics_pow(base, exponent - 1);
|
|
}
|
|
|
|
float mathematics_root(float number, unsigned int nth_root) {
|
|
float result = number;
|
|
float previous_result = 0;
|
|
while (!mathematics_equals(result, previous_result)) {
|
|
result = (((nth_root - 1) * previous_result) + (number / mathematics_pow(result, nth_root - 1))) / nth_root;
|
|
previous_result = result;
|
|
}
|
|
return result;
|
|
}
|
|
|
|
float mathematics_square_root(float number) {
|
|
return mathematics_root(number, 2);
|
|
}
|
|
|
|
unsigned long long mathematics_factorial(unsigned long long number) {
|
|
return number == 0 ? 1 : number * mathematics_factorial(number - 1);
|
|
}
|
|
|
|
int64_t mathematics_opposite(int64_t number) {
|
|
return number * -1;
|
|
}
|
|
|
|
int64_t mathematics_max(int64_t number1, int64_t number2) {
|
|
return number1 > number2 ? number1 : number2;
|
|
}
|
|
|
|
int64_t mathematics_max_values(int64_t *values, size_t values_length) {
|
|
int64_t max = 0;
|
|
if (values_length <= 0) {
|
|
return max;
|
|
}
|
|
max = values[0];
|
|
for (size_t index = 1; index < values_length; index++) {
|
|
max = mathematics_max(max, values[index]);
|
|
}
|
|
return max;
|
|
}
|
|
|
|
int64_t mathematics_min(int64_t number1, int64_t number2) {
|
|
return number1 > number2 ? number2 : number1;
|
|
}
|
|
|
|
int64_t mathematics_min_values(int64_t *values, size_t values_length) {
|
|
int64_t min = 0;
|
|
if (values_length <= 0) {
|
|
return min;
|
|
}
|
|
min = values[0];
|
|
for (size_t index = 1; index < values_length; index++) {
|
|
min = mathematics_min(min, values[index]);
|
|
}
|
|
return min;
|
|
}
|