mirror of
https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git
synced 2023-10-11 13:05:55 +08:00
aaa08b0150
* delete secant method - it is identical to regula falsi * document + improvize root finding algorithms * attempt to document gaussian elimination * added file brief * commented doxygen-mainpage, added files-list link * corrected files list link path * files-list link correction - this time works :) * document successive approximations * cleaner equation * updating DIRECTORY.md * documented kmp string search * document brute force string search * document rabin-karp string search * fixed mainpage readme * doxygen v1.8.18 will suppress out the #minipage in the markdown * cpplint correction for header guard style * github action to auto format source code per cpplint standard * updated setting to add 1 space before `private` and `public` keywords * auto rename files and auto format code * added missing "run" for step * corrected asignmemt operation * fixed trim and assign syntax * added git move for renaming bad filenames * added missing pipe for trim * added missing space * use old and new fnames * store old fname using echo * move files only if there is a change in filename * put old filenames in quotes * use double quote for old filename * escape double quotes * remove old_fname * try escape characters and echo" * add file-type to find * cleanup echo * ensure all trim variables are also in quotes * try escape -quote again * remove second escpe quote * use single quote for first check * use carets instead of quotes * put variables in brackets * remove -e from echo * add debug echos * try print0 flag * find command with while instead of for-loop * find command using IFS instead * 🎉 IFS fix worked - escaped quotes for git mv * protetc each word in git mv .. * filename exists in lower cases - renamed * 🎉 git push enabled * updating DIRECTORY.md * git pull & then push * formatting filenamesd7af6fdc8c
* formatting source-code ford7af6fdc8c
* remove allman break before braces * updating DIRECTORY.md * added missing comma lost in previous commit * orchestrate all workflows * fix yml indentation * force push format changes, add title to DIRECTORY.md * pull before proceeding * reorganize pull commands * use master branches for actions * rename .cc files to .cpp * added class destructor to clean up dynamic memory allocation * rename to awesome workflow * commented whole repo cpplint - added modified files lint check * removed need for cpplint * attempt to use actions/checkout@master * temporary: no dependency on cpplint * formatting filenames153fb7b8a5
* formatting source-code for153fb7b8a5
* updating DIRECTORY.md * fix diff filename * added comments to the code * added test case * formatting source-code fora850308fba
* updating DIRECTORY.md * added machine learning folder * added adaline algorithm * updating DIRECTORY.md * fixed issue [LWG2192](https://cplusplus.github.io/LWG/issue2192) for std::abs on MacOS * add cmath for same bug: [LWG2192](https://cplusplus.github.io/LWG/issue2192) for std::abs on MacOS * formatting source-code forf8925e4822
* use STL's inner_product * formatting source-code forf94a330594
* added range comments * define activation function * use equal initial weights * change test2 function to predict * activation function not friend * previous commit correction * added option for predict function to return value before applying activation function as optional argument * added test case to classify points lying within a sphere * improve documentation for adaline * formatting source-code for15ec4c3aba
* added cmake to geometry folder * added algorithm include for std::max * add namespace - machine_learning * add namespace - statistics * add namespace - sorting * added sorting algos to namespace sorting * added namespace string_search * formatting source-code forfd69530515
* added documentation to string_search namespace * feat: Add BFS and DFS algorithms to check for cycle in a directed graph * Remove const references for input of simple types Reason: overhead on access * fix bad code sorry for force push * Use pointer instead of the non-const reference because apparently google says so. * Remove a useless and possibly bad Graph constuctor overload * Explicitely specify type of vector during graph instantiation * updating DIRECTORY.md * find openMP before adding subdirectories * added kohonen self organizing map * updating DIRECTORY.md * remove older files and folders from gh-pages before adding new files * remove chronos library due to inacceptability by cpplint * use c++ specific static_cast instead * initialize radom number generator * updated image links with those from CPP repository * rename computer.... folder to numerical methods * added durand kerner method for root computation for arbitrarily large polynomials * fixed additional comma * fix cpplint errors * updating DIRECTORY.md * convert to function module * update documentation * move openmp to main loop * added two test cases * use INT16_MAX * remove return statement from omp-for loop and use "break" * run tests when no input is provided and skip tests when input polynomial is provided * while loop cannot have break - replaced with continue and check is present in the main while condition * (1) break while loop (2) skip runs on break_loop instead of hard-break * add documentation images * use long double for errors and tolerance checks * make iterator variable i local to threads * add critical secions to omp threads * bugfix: move file writing outside of the parallel loop othersie, there is no gurantee of the order of roots written to file * rename folder to data_structures * updating DIRECTORY.md * fix ambiguous symbol `size` * add data_structures to cmake * docs: enable tree view, add timestamp in footer, try clang assistaed parsing * doxygen - open links in external window * remove invalid parameter from function docs * use HTML5 img tag to resize images * move file to proper folder * fix documentations and cpplint * formatting source-code foraacaf9828c
* updating DIRECTORY.md * cpplint: add braces for multiple statement if * add explicit link to badges * remove duplicate line Signed-off-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * remove namespace indentation * remove file associations in settings * add author name * enable cmake in subfolders of data_structures * create and link object file * cpp lint fixes and instantiate template classes * cpp lint fixes and instantiate template classes Signed-off-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * cpplint - ignore `build/include` Signed-off-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * disable redundant gcc compilation in cpplint workflow Signed-off-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * template header files contain function codes as well and removed redundant subfolders Signed-off-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * updating DIRECTORY.md * remove semicolons after functions in a class Signed-off-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * cpplint header guard style Signed-off-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * remove semilon Signed-off-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * added LU decomposition algorithm Signed-off-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * added QR decomposition algorithm Signed-off-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * use QR decomposition to find eigen values Signed-off-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * updating DIRECTORY.md * use std::rand for thread safety Signed-off-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * move srand to main() Signed-off-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * cpplint braces correction Signed-off-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * updated eigen value documentation Signed-off-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * fix matrix shift doc Signed-off-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * rename CONTRIBUTION.md to CONTRIBUTING.md #836 * remove 'sort alphabetical order' check * added documentation check * remove extra paranthesis * added gitpod * added gitpod link from README * attempt to add vscode gitpod extensions * update gitpod extensions * add gitpod extensions cmake-tools and git-graph * remove gitpod init and add commands * use init to one time install doxygen, graphviz, cpplint * use gitpod dockerfile * add ninja build system to docker * remove configure task * add github prebuild specs to gitpod * disable gitpod addcommit * update documentation for kohonen_som * added ode solve using forward euler method * added mid-point euler ode solver * fixed itegration step equation * added semi-implicit euler ODE solver * updating DIRECTORY.md * fix cpplint issues - lines 117 and 124 * added documentation to ode group * corrected semi-implicit euler function * updated docs and test cases better structure * replace `free` with `delete` operator * formatting source-code forf55ab50cf2
* updating DIRECTORY.md * main function must return * added machine learning group * added kohonen som topology algorithm * fix graph image path * updating DIRECTORY.md * fix braces * use snprintf instead of sprintf * use static_cast * hardcode character buffer size * fix machine learning groups in documentation * fix missing namespace function * replace kvedala fork references to TheAlgorithms * fix bug in counting_sort Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Co-authored-by: Anmol3299 <mittalanmol22@gmail.com>
194 lines
5.4 KiB
C++
194 lines
5.4 KiB
C++
/**
|
|
* \file
|
|
* \brief Compute statistics for data entered in rreal-time
|
|
*
|
|
* This algorithm is really beneficial to compute statistics on data read in
|
|
* realtime. For example, devices reading biometrics data. The algorithm is
|
|
* simple enough to be easily implemented in an embedded system.
|
|
* \author [Krishna Vedala](https://github.com/kvedala)
|
|
*/
|
|
#include <cassert>
|
|
#include <cmath>
|
|
#include <iostream>
|
|
|
|
/**
|
|
* \namespace statistics
|
|
* \brief Statistical algorithms
|
|
*/
|
|
namespace statistics {
|
|
|
|
/**
|
|
* continuous mean and variance computance using
|
|
* first value as an approximation for the mean.
|
|
* If the first number is much far form the mean, the algorithm becomes very
|
|
* inaccurate to compute variance and standard deviation.
|
|
*/
|
|
template <typename T>
|
|
class stats_computer1 {
|
|
public:
|
|
/** Constructor
|
|
* \param[in] x new data sample
|
|
*/
|
|
void new_val(T x) {
|
|
if (n == 0)
|
|
K = x;
|
|
n++;
|
|
T tmp = x - K;
|
|
Ex += tmp;
|
|
Ex2 += tmp * tmp;
|
|
}
|
|
|
|
/** return sample mean computed till last sample */
|
|
double mean() const { return K + Ex / n; }
|
|
|
|
/** return data variance computed till last sample */
|
|
double variance() const { return (Ex2 - (Ex * Ex) / n) / (n - 1); }
|
|
|
|
/** return sample standard deviation computed till last sample */
|
|
double std() const { return std::sqrt(this->variance()); }
|
|
|
|
/** short-hand operator to read new sample from input stream
|
|
* \n e.g.: `std::cin >> stats1;`
|
|
*/
|
|
friend std::istream &operator>>(std::istream &input,
|
|
stats_computer1 &stat) {
|
|
T val;
|
|
input >> val;
|
|
stat.new_val(val);
|
|
return input;
|
|
}
|
|
|
|
private:
|
|
unsigned int n = 0;
|
|
double Ex, Ex2;
|
|
T K;
|
|
};
|
|
|
|
/**
|
|
* continuous mean and variance computance using
|
|
* Welford's algorithm (very accurate)
|
|
*/
|
|
template <typename T>
|
|
class stats_computer2 {
|
|
public:
|
|
/** Constructor
|
|
* \param[in] x new data sample
|
|
*/
|
|
void new_val(T x) {
|
|
n++;
|
|
double delta = x - mu;
|
|
mu += delta / n;
|
|
double delta2 = x - mu;
|
|
M += delta * delta2;
|
|
}
|
|
|
|
/** return sample mean computed till last sample */
|
|
double mean() const { return mu; }
|
|
|
|
/** return data variance computed till last sample */
|
|
double variance() const { return M / n; }
|
|
|
|
/** return sample standard deviation computed till last sample */
|
|
double std() const { return std::sqrt(this->variance()); }
|
|
|
|
/** short-hand operator to read new sample from input stream
|
|
* \n e.g.: `std::cin >> stats1;`
|
|
*/
|
|
friend std::istream &operator>>(std::istream &input,
|
|
stats_computer2 &stat) {
|
|
T val;
|
|
input >> val;
|
|
stat.new_val(val);
|
|
return input;
|
|
}
|
|
|
|
private:
|
|
unsigned int n = 0;
|
|
double mu = 0, var = 0, M = 0;
|
|
};
|
|
|
|
} // namespace statistics
|
|
|
|
using statistics::stats_computer1;
|
|
using statistics::stats_computer2;
|
|
|
|
/** Test the algorithm implementation
|
|
* \param[in] test_data array of data to test the algorithms
|
|
*/
|
|
void test_function(const float *test_data, const int number_of_samples) {
|
|
float mean = 0.f, variance = 0.f;
|
|
|
|
stats_computer1<float> stats01;
|
|
stats_computer2<float> stats02;
|
|
|
|
for (int i = 0; i < number_of_samples; i++) {
|
|
stats01.new_val(test_data[i]);
|
|
stats02.new_val(test_data[i]);
|
|
mean += test_data[i];
|
|
}
|
|
|
|
mean /= number_of_samples;
|
|
|
|
for (int i = 0; i < number_of_samples; i++) {
|
|
float temp = test_data[i] - mean;
|
|
variance += temp * temp;
|
|
}
|
|
variance /= number_of_samples;
|
|
|
|
std::cout << "<<<<<<<< Test Function >>>>>>>>" << std::endl
|
|
<< "Expected: Mean: " << mean << "\t Variance: " << variance
|
|
<< std::endl;
|
|
std::cout << "\tMethod 1:"
|
|
<< "\tMean: " << stats01.mean()
|
|
<< "\t Variance: " << stats01.variance()
|
|
<< "\t Std: " << stats01.std() << std::endl;
|
|
std::cout << "\tMethod 2:"
|
|
<< "\tMean: " << stats02.mean()
|
|
<< "\t Variance: " << stats02.variance()
|
|
<< "\t Std: " << stats02.std() << std::endl;
|
|
|
|
assert(std::abs(stats01.mean() - mean) < 0.01);
|
|
assert(std::abs(stats02.mean() - mean) < 0.01);
|
|
assert(std::abs(stats02.variance() - variance) < 0.01);
|
|
|
|
std::cout << "(Tests passed)" << std::endl;
|
|
}
|
|
|
|
/** Main function */
|
|
int main(int argc, char **argv) {
|
|
const float test_data1[] = {3, 4, 5, -1.4, -3.6, 1.9, 1.};
|
|
test_function(test_data1, sizeof(test_data1) / sizeof(test_data1[0]));
|
|
|
|
std::cout
|
|
<< "Enter data. Any non-numeric data will terminate the data input."
|
|
<< std::endl;
|
|
|
|
stats_computer1<float> stats1;
|
|
stats_computer2<float> stats2;
|
|
|
|
while (1) {
|
|
double val;
|
|
std::cout << "Enter number: ";
|
|
std::cin >> val;
|
|
|
|
// check for failure to read input. Happens for
|
|
// non-numeric data
|
|
if (std::cin.fail())
|
|
break;
|
|
|
|
stats1.new_val(val);
|
|
stats2.new_val(val);
|
|
|
|
std::cout << "\tMethod 1:"
|
|
<< "\tMean: " << stats1.mean()
|
|
<< "\t Variance: " << stats1.variance()
|
|
<< "\t Std: " << stats1.std() << std::endl;
|
|
std::cout << "\tMethod 2:"
|
|
<< "\tMean: " << stats2.mean()
|
|
<< "\t Variance: " << stats2.variance()
|
|
<< "\t Std: " << stats2.std() << std::endl;
|
|
}
|
|
|
|
return 0;
|
|
}
|