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>
119 lines
3.3 KiB
C++
119 lines
3.3 KiB
C++
/**
|
|
* @file
|
|
* @brief Compute factorial of any arbitratily large number/
|
|
*
|
|
* \author [Krishna Vedala](https://github.com/kvedala)
|
|
* @see factorial.cpp
|
|
*/
|
|
#include <cstring>
|
|
#include <ctime>
|
|
#include <iostream>
|
|
|
|
#include "./large_number.h"
|
|
|
|
/** Test implementation for 10! Result must be 3628800.
|
|
* @returns True if test pass else False
|
|
*/
|
|
bool test1() {
|
|
std::cout << "---- Check 1\t";
|
|
unsigned int i, number = 10;
|
|
large_number result;
|
|
for (i = 2; i <= number; i++) /* Multiply every number from 2 thru N */
|
|
result *= i;
|
|
|
|
const char *known_reslt = "3628800";
|
|
|
|
/* check 1 */
|
|
if (strlen(known_reslt) != result.num_digits()) {
|
|
std::cerr << "Result lengths dont match! " << strlen(known_reslt)
|
|
<< " != " << result.num_digits() << std::endl;
|
|
return false;
|
|
}
|
|
|
|
const size_t N = result.num_digits();
|
|
for (i = 0; i < N; i++) {
|
|
if (known_reslt[i] != result.digit_char(i)) {
|
|
std::cerr << i << "^th digit mismatch! " << known_reslt[i]
|
|
<< " != " << result.digit_char(i) << std::endl;
|
|
return false;
|
|
}
|
|
}
|
|
|
|
std::cout << "Passed!" << std::endl;
|
|
return true;
|
|
}
|
|
|
|
/** Test implementation for 100! The result is the 156 digit number:
|
|
* ```
|
|
* 9332621544394415268169923885626670049071596826438162146859296389521759
|
|
* 9993229915608941463976156518286253697920827223758251185210916864000000
|
|
* 000000000000000000
|
|
* ```
|
|
* @returns True if test pass else False
|
|
*/
|
|
bool test2() {
|
|
std::cout << "---- Check 2\t";
|
|
unsigned int i, number = 100;
|
|
large_number result;
|
|
for (i = 2; i <= number; i++) /* Multiply every number from 2 thru N */
|
|
result *= i;
|
|
|
|
const char *known_reslt =
|
|
"9332621544394415268169923885626670049071596826438162146859296389521759"
|
|
"9993229915608941463976156518286253697920827223758251185210916864000000"
|
|
"000000000000000000";
|
|
|
|
/* check 1 */
|
|
if (strlen(known_reslt) != result.num_digits()) {
|
|
std::cerr << "Result lengths dont match! " << strlen(known_reslt)
|
|
<< " != " << result.num_digits() << std::endl;
|
|
return false;
|
|
}
|
|
|
|
const size_t N = result.num_digits();
|
|
for (i = 0; i < N; i++) {
|
|
if (known_reslt[i] != result.digit_char(i)) {
|
|
std::cerr << i << "^th digit mismatch! " << known_reslt[i]
|
|
<< " != " << result.digit_char(i) << std::endl;
|
|
return false;
|
|
}
|
|
}
|
|
|
|
std::cout << "Passed!" << std::endl;
|
|
return true;
|
|
}
|
|
|
|
/**
|
|
* Main program
|
|
**/
|
|
int main(int argc, char *argv[]) {
|
|
int number, i;
|
|
|
|
if (argc == 2) {
|
|
number = atoi(argv[1]);
|
|
} else {
|
|
std::cout << "Enter the value of n(n starts from 0 ): ";
|
|
std::cin >> number;
|
|
}
|
|
|
|
large_number result;
|
|
|
|
std::clock_t start_time = std::clock();
|
|
for (i = 2; i <= number; i++) /* Multiply every number from 2 thru N */
|
|
result *= i;
|
|
std::clock_t end_time = std::clock();
|
|
double time_taken =
|
|
static_cast<double>(end_time - start_time) / CLOCKS_PER_SEC;
|
|
|
|
std::cout << number << "! = " << result << std::endl
|
|
<< "Number of digits: " << result.num_digits() << std::endl
|
|
<< "Time taken: " << std::scientific << time_taken << " s"
|
|
<< std::endl;
|
|
|
|
test1();
|
|
test2();
|
|
result.test();
|
|
|
|
return 0;
|
|
}
|