mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-02-03 18:46:50 +08:00
* fix: add <cstdint> to subset_sum.cpp * fix: add <cstdint> to subarray_sum.cpp * fix: add <cstdint> to wildcard_matching.cpp * fix: add <cstdint> to count_bit_flips.cpp * fix: add <cstdint> to count_of_set_bits.cpp * fix: add <cstdint> to trailing_ciphers.cpp * fix: add <cstdint> to hamming_distance.cpp * doc: include doc for hamming_distance * fix: add <cstdint> to next_higher_numebr_with_same_number_of_set_bits.cpp * fix: add <cstdint> to power_of_2.cpp * fix: add <cstdint> to set_kth_bit.cpp * fix: add <cstdint> to bit_manipulation/set_kth_bit.cpp * fix: add <cstdint> to bit_manipulation/travelling_salesman_using_bit_manipulation.cpp * fix: add <cstdint> to ciphers/base64_encoding.cpp * fix: add <cstdint> to ciphers/hill_cipher.cpp * fix: add <cstdint> to ciphers/uint128_t.hpp * fix: add <cstdint> to data_structures/dsu_path_compression.cpp * fix: add <cstdint> to data_structures/dsu_path_compression.cpp * fix add <cstdint> to datastructures/list_array>cpp * fix add <cstdint> to datastructures/queue_using_array.cpp * fix: add <cstdint> to sparse_table.cpp * fix: add <cstdint> to stack_using_list_queue.cpp * fix: add <cstdint> to treap.cpp * fix: add <cstdint> to graham_scan_functions.hpp * fix: add <cstdint> to graph/** * fix: add integral typdefs to hashing/** * fix: add <cstdint> to math/** * fix: add <cstdint> to numerical_methods/** * fix: add <cstdint> to other/** * fix: add <cstdint> to search/** * fix: add <cstdint> to sorting/** * fix: add <cstdint> to string/** * doc: remove include statement from comment * fix: make tests static Co-authored-by: David Leal <halfpacho@gmail.com> * fix: make tests static Co-authored-by: David Leal <halfpacho@gmail.com> * chore: use iwyu on backtracking/**.cpp * chore: use iwyu on bit_manip/**.cpp * chore: use iwyu on ciphers/**.cpp * chore: use iwyu on cpu_scheduling_algorithms/**.cpp * chore: use iwyu on data_structures/**.cpp * chore: use iwyu on divide_and_conquer/**.cpp * chore: use iwyu on geometry/**.cpp * chore: use iwyu on graph/**.cpp * chore: use iwyu on hashing/**.cpp * chore: use iwyu on machine_learning/**.cpp * chore: use iwyu on math/**.cpp * chore: use iwyu on numerical_methods/**.cpp * chore: use iwyu on others/**.cpp * chore: use iwyu on probablity/**.cpp * chore: use iwyu on search/**.cpp * chore: use iwyu on sorting/**.cpp * chore: use iwyu on strings/**.cpp * Revert "chore: use iwyu on strings/**.cpp" This reverts commitf2127456a8. * Revert "chore: use iwyu on sorting/**.cpp" This reverts commita290ae7ee2. * Revert "chore: use iwyu on search/**.cpp" This reverts commit19d136ae0f. * Revert "chore: use iwyu on probablity/**.cpp" This reverts commit5dd7f82a34. * Revert "chore: use iwyu on others/**.cpp" This reverts commit8a8fd42383. * Revert "chore: use iwyu on numerical_methods/**.cpp" This reverts commiteff2f44a50. * Revert "chore: use iwyu on math/**.cpp" This reverts commitc47117ca3f. * Revert "chore: use iwyu on machine_learning/**.cpp" This reverts commitc3897d3763. * Revert "chore: use iwyu on hashing/**.cpp" This reverts commit0c6611a835. * Revert "chore: use iwyu on graph/**.cpp" This reverts commitdabd6d2591. * Revert "chore: use iwyu on geometry/**.cpp" This reverts commit740bd65932. * Revert "chore: use iwyu on divide_and_conquer/**.cpp" This reverts commit16ee49e086. * Revert "chore: use iwyu on data_structures/**.cpp" This reverts commita3b719e368. * Revert "chore: use iwyu on cpu_scheduling_algorithms/**.cpp" This reverts commit24e597f7e2. * Revert "chore: use iwyu on ciphers/**.cpp" This reverts commit3d80295883. * Revert "chore: use iwyu on bit_manip/**.cpp" This reverts commit7edcb6e458. * Revert "chore: use iwyu on backtracking/**.cpp" This reverts commitf0a30d7cdb. * Update search/binary_search.cpp * Update backtracking/subarray_sum.cpp * Update backtracking/subset_sum.cpp * Update backtracking/wildcard_matching.cpp * Update bit_manipulation/count_bits_flip.cpp * Update bit_manipulation/count_of_set_bits.cpp * Update bit_manipulation/count_of_trailing_ciphers_in_factorial_n.cpp * Update bit_manipulation/hamming_distance.cpp * Update bit_manipulation/next_higher_number_with_same_number_of_set_bits.cpp * Update bit_manipulation/power_of_2.cpp * Update others/lru_cache.cpp * Update bit_manipulation/set_kth_bit.cpp * Update bit_manipulation/travelling_salesman_using_bit_manipulation.cpp * Update ciphers/base64_encoding.cpp * Update ciphers/hill_cipher.cpp * Update ciphers/uint128_t.hpp * Update cpu_scheduling_algorithms/fcfs_scheduling.cpp * Update data_structures/dsu_path_compression.cpp * Update data_structures/dsu_union_rank.cpp * Update data_structures/list_array.cpp * Update data_structures/queue_using_array.cpp * Update data_structures/sparse_table.cpp * Update data_structures/stack_using_queue.cpp * Update data_structures/treap.cpp * Update geometry/graham_scan_functions.hpp * Update graph/bidirectional_dijkstra.cpp * Update graph/connected_components_with_dsu.cpp * Update graph/cycle_check_directed_graph.cpp * Update graph/is_graph_bipartite2.cpp * Update graph/travelling_salesman_problem.cpp * Update hashing/md5.cpp * Update hashing/sha1.cpp * Update math/n_choose_r.cpp * Update strings/z_function.cpp * Update strings/manacher_algorithm.cpp * Update sorting/wiggle_sort.cpp * Update sorting/selection_sort_recursive.cpp * Update sorting/selection_sort_iterative.cpp * Update sorting/recursive_bubble_sort.cpp * Update sorting/radix_sort2.cpp * Update sorting/dnf_sort.cpp * Update sorting/cycle_sort.cpp * Update search/sublist_search.cpp * Update search/saddleback_search.cpp * Update search/interpolation_search.cpp * Update search/floyd_cycle_detection_algo.cpp * Update search/exponential_search.cpp * Update search/exponential_search.cpp * Update math/n_bonacci.cpp * Update math/aliquot_sum.cpp * Update math/check_factorial.cpp * Update math/double_factorial.cpp * Update math/eulers_totient_function.cpp * Update math/factorial.cpp * Update math/fibonacci.cpp * Update math/fibonacci_matrix_exponentiation.cpp * Update math/fibonacci_sum.cpp * Update math/finding_number_of_digits_in_a_number.cpp * chore: remove "/// for integral typedefs" * chore: remove for integral typedefs from modular division * fix: remove comment from include * fix: add cstdint to gale shapely --------- Co-authored-by: David Leal <halfpacho@gmail.com>
137 lines
5.5 KiB
C++
137 lines
5.5 KiB
C++
/**
|
|
* @file
|
|
* @brief Compute integral approximation of the function using [Riemann
|
|
* sum](https://en.wikipedia.org/wiki/Riemann_sum)
|
|
* @details In mathematics, a Riemann sum is a certain kind of approximation of
|
|
* an integral by a finite sum. It is named after nineteenth-century German
|
|
* mathematician Bernhard Riemann. One very common application is approximating
|
|
* the area of functions or lines on a graph and the length of curves and other
|
|
* approximations. The sum is calculated by partitioning the region into shapes
|
|
* (rectangles, trapezoids, parabolas, or cubics) that form a region similar to
|
|
* the region being measured, then calculating the area for each of these
|
|
* shapes, and finally adding all of these small areas together. This approach
|
|
* can be used to find a numerical approximation for a definite integral even if
|
|
* the fundamental theorem of calculus does not make it easy to find a
|
|
* closed-form solution. Because the region filled by the small shapes is
|
|
* usually not the same shape as the region being measured, the Riemann sum will
|
|
* differ from the area being measured. This error can be reduced by dividing up
|
|
* the region more finely, using smaller and smaller shapes. As the shapes get
|
|
* smaller and smaller, the sum approaches the Riemann integral. \author
|
|
* [Benjamin Walton](https://github.com/bwalton24) \author [Shiqi
|
|
* Sheng](https://github.com/shiqisheng00)
|
|
*/
|
|
#include <cassert> /// for assert
|
|
#include <cmath> /// for mathematical functions
|
|
#include <cstdint>
|
|
#include <functional> /// for passing in functions
|
|
#include <iostream> /// for IO operations
|
|
|
|
/**
|
|
* @namespace math
|
|
* @brief Mathematical functions
|
|
*/
|
|
namespace math {
|
|
/**
|
|
* @brief Computes integral approximation
|
|
* @param lb lower bound
|
|
* @param ub upper bound
|
|
* @param func function passed in
|
|
* @param delta
|
|
* @returns integral approximation of function from [lb, ub]
|
|
*/
|
|
double integral_approx(double lb, double ub,
|
|
const std::function<double(double)>& func,
|
|
double delta = .0001) {
|
|
double result = 0;
|
|
uint64_t numDeltas = static_cast<uint64_t>((ub - lb) / delta);
|
|
for (int i = 0; i < numDeltas; i++) {
|
|
double begin = lb + i * delta;
|
|
double end = lb + (i + 1) * delta;
|
|
result += delta * (func(begin) + func(end)) / 2;
|
|
}
|
|
return result;
|
|
}
|
|
|
|
/**
|
|
* @brief Wrapper to evaluate if the approximated
|
|
* value is within `.XX%` threshold of the exact value.
|
|
* @param approx aprroximate value
|
|
* @param exact expected value
|
|
* @param threshold values from [0, 1)
|
|
*/
|
|
void test_eval(double approx, double expected, double threshold) {
|
|
assert(approx >= expected * (1 - threshold));
|
|
assert(approx <= expected * (1 + threshold));
|
|
}
|
|
|
|
/**
|
|
* @brief Self-test implementations to
|
|
* test the `integral_approx` function.
|
|
*
|
|
* @returns `void`
|
|
*/
|
|
} // namespace math
|
|
|
|
static void test() {
|
|
double test_1 = math::integral_approx(
|
|
3.24, 7.56, [](const double x) { return log(x) + exp(x) + x; });
|
|
std::cout << "Test Case 1" << std::endl;
|
|
std::cout << "function: log(x) + e^x + x" << std::endl;
|
|
std::cout << "range: [3.24, 7.56]" << std::endl;
|
|
std::cout << "value: " << test_1 << std::endl;
|
|
math::test_eval(test_1, 1924.80384023549, .001);
|
|
std::cout << "Test 1 Passed!" << std::endl;
|
|
std::cout << "=====================" << std::endl;
|
|
|
|
double test_2 = math::integral_approx(0.023, 3.69, [](const double x) {
|
|
return x * x + cos(x) + exp(x) + log(x) * log(x);
|
|
});
|
|
std::cout << "Test Case 2" << std::endl;
|
|
std::cout << "function: x^2 + cos(x) + e^x + log^2(x)" << std::endl;
|
|
std::cout << "range: [.023, 3.69]" << std::endl;
|
|
std::cout << "value: " << test_2 << std::endl;
|
|
math::test_eval(test_2, 58.71291345202729, .001);
|
|
std::cout << "Test 2 Passed!" << std::endl;
|
|
std::cout << "=====================" << std::endl;
|
|
|
|
double test_3 = math::integral_approx(
|
|
10.78, 24.899, [](const double x) { return x * x * x - x * x + 378; });
|
|
std::cout << "Test Case 3" << std::endl;
|
|
std::cout << "function: x^3 - x^2 + 378" << std::endl;
|
|
std::cout << "range: [10.78, 24.899]" << std::endl;
|
|
std::cout << "value: " << test_3 << std::endl;
|
|
math::test_eval(test_3, 93320.65915078377, .001);
|
|
std::cout << "Test 3 Passed!" << std::endl;
|
|
std::cout << "=====================" << std::endl;
|
|
|
|
double test_4 = math::integral_approx(
|
|
.101, .505,
|
|
[](const double x) { return cos(x) * tan(x) * x * x + exp(x); },
|
|
.00001);
|
|
std::cout << "Test Case 4" << std::endl;
|
|
std::cout << "function: cos(x)*tan(x)*x^2 + e^x" << std::endl;
|
|
std::cout << "range: [.101, .505]" << std::endl;
|
|
std::cout << "value: " << test_4 << std::endl;
|
|
math::test_eval(test_4, 0.566485986311631, .001);
|
|
std::cout << "Test 4 Passed!" << std::endl;
|
|
std::cout << "=====================" << std::endl;
|
|
|
|
double test_5 = math::integral_approx(
|
|
-1, 1, [](const double x) { return exp(-1 / (x * x)); });
|
|
std::cout << "Test Case 5" << std::endl;
|
|
std::cout << "function: e^(-1/x^2)" << std::endl;
|
|
std::cout << "range: [-1, 1]" << std::endl;
|
|
std::cout << "value: " << test_5 << std::endl;
|
|
math::test_eval(test_5, 0.1781477117815607, .001);
|
|
std::cout << "Test 5 Passed!" << std::endl;
|
|
}
|
|
|
|
/**
|
|
* @brief Main function
|
|
* @returns 0 on exit
|
|
*/
|
|
int main() {
|
|
test(); // run self-test implementations
|
|
return 0;
|
|
}
|