2022-12-23 01:30:37 +08:00
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
< html xmlns = "http://www.w3.org/1999/xhtml" lang = "en-US" >
< head >
< meta http-equiv = "Content-Type" content = "text/xhtml;charset=UTF-8" / >
< meta http-equiv = "X-UA-Compatible" content = "IE=11" / >
2023-06-21 05:10:10 +08:00
< meta name = "generator" content = "Doxygen 1.9.7" / >
2022-12-23 01:30:37 +08:00
< meta name = "viewport" content = "width=device-width, initial-scale=1" / >
< title > Algorithms_in_C: math Directory Reference< / title >
< link href = "tabs.css" rel = "stylesheet" type = "text/css" / >
< script type = "text/javascript" src = "jquery.js" > < / script >
< script type = "text/javascript" src = "dynsections.js" > < / script >
< link href = "navtree.css" rel = "stylesheet" type = "text/css" / >
< script type = "text/javascript" src = "resize.js" > < / script >
< script type = "text/javascript" src = "navtreedata.js" > < / script >
< script type = "text/javascript" src = "navtree.js" > < / script >
< link href = "search/search.css" rel = "stylesheet" type = "text/css" / >
< script type = "text/javascript" src = "search/searchdata.js" > < / script >
< script type = "text/javascript" src = "search/search.js" > < / script >
< script type = "text/x-mathjax-config" >
MathJax.Hub.Config({
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
< / script >
< script type = "text/javascript" async = "async" src = "https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js" > < / script >
< link href = "doxygen.css" rel = "stylesheet" type = "text/css" / >
< / head >
< body >
< div id = "top" > <!-- do not remove this div, it is closed by doxygen! -->
< div id = "titlearea" >
< table cellspacing = "0" cellpadding = "0" >
< tbody >
< tr id = "projectrow" >
< td id = "projectalign" >
< div id = "projectname" > Algorithms_in_C< span id = "projectnumber" >   1.0.0< / span >
< / div >
< div id = "projectbrief" > Set of algorithms implemented in C.< / div >
< / td >
< / tr >
< / tbody >
< / table >
< / div >
<!-- end header part -->
2023-06-21 05:10:10 +08:00
<!-- Generated by Doxygen 1.9.7 -->
2022-12-23 01:30:37 +08:00
< script type = "text/javascript" >
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699& dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "search/",'.html');
/* @license-end */
< / script >
< script type = "text/javascript" src = "menudata.js" > < / script >
< script type = "text/javascript" src = "menu.js" > < / script >
< script type = "text/javascript" >
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699& dn=expat.txt MIT */
$(function() {
initMenu('',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */
< / script >
< div id = "main-nav" > < / div >
< / div > <!-- top -->
< div id = "side-nav" class = "ui-resizable side-nav-resizable" >
< div id = "nav-tree" >
< div id = "nav-tree-contents" >
< div id = "nav-sync" class = "sync" > < / div >
< / div >
< / div >
< div id = "splitbar" style = "-moz-user-select:none;"
class="ui-resizable-handle">
< / div >
< / div >
< script type = "text/javascript" >
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699& dn=expat.txt MIT */
$(document).ready(function(){initNavTree('dir_296d53ceaeaa7e099814a6def439fe8a.html',''); initResizable(); });
/* @license-end */
< / script >
< div id = "doc-content" >
<!-- window showing the filter options -->
< div id = "MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
< / div >
<!-- iframe showing the search results (closed by default) -->
< div id = "MSearchResultsWindow" >
< div id = "MSearchResults" >
< div class = "SRPage" >
< div id = "SRIndex" >
< div id = "SRResults" > < / div >
< div class = "SRStatus" id = "Loading" > Loading...< / div >
< div class = "SRStatus" id = "Searching" > Searching...< / div >
< div class = "SRStatus" id = "NoMatches" > No Matches< / div >
< / div >
< / div >
< / div >
< / div >
< div class = "header" >
< div class = "headertitle" > < div class = "title" > math Directory Reference< / div > < / div >
< / div > <!-- header -->
< div class = "contents" >
< table class = "memberdecls" >
< tr class = "heading" > < td colspan = "2" > < h2 class = "groupheader" > < a id = "files" name = "files" > < / a >
Files< / h2 > < / td > < / tr >
2023-06-21 05:10:10 +08:00
< tr class = "memitem:" > < td class = "memItemLeft" align = "right" valign = "top" > < span class = "icondoc" > < / span >   < / td > < td class = "memItemRight" valign = "bottom" > < a class = "el" href = "dc/d80/cantor__set_8c.html" > cantor_set.c< / a > < / td > < / tr >
2022-12-23 01:30:37 +08:00
< tr class = "memdesc:dc/d80/cantor__set_8c" > < td class = "mdescLeft" >   < / td > < td class = "mdescRight" > Program to generate < a href = "https://en.wikipedia.org/wiki/Cantor_set" target = "_blank" > Cantor ternary set< / a > < br / > < / td > < / tr >
< tr class = "separator:" > < td class = "memSeparator" colspan = "2" >   < / td > < / tr >
2023-06-21 05:10:10 +08:00
< tr class = "memitem:" > < td class = "memItemLeft" align = "right" valign = "top" > < span class = "icondoc" > < / span >   < / td > < td class = "memItemRight" valign = "bottom" > < a class = "el" href = "d6/d2e/cartesian__to__polar_8c.html" > cartesian_to_polar.c< / a > < / td > < / tr >
2022-12-23 01:30:37 +08:00
< tr class = "memdesc:d6/d2e/cartesian__to__polar_8c" > < td class = "mdescLeft" >   < / td > < td class = "mdescRight" > Function to convert a Cartesian co-ordinate to polar form. < br / > < / td > < / tr >
< tr class = "separator:" > < td class = "memSeparator" colspan = "2" >   < / td > < / tr >
2023-06-21 05:10:10 +08:00
< tr class = "memitem:" > < td class = "memItemLeft" align = "right" valign = "top" > < span class = "icondoc" > < / span >   < / td > < td class = "memItemRight" valign = "bottom" > < a class = "el" href = "dc/d80/collatz_8c.html" > collatz.c< / a > < / td > < / tr >
2022-12-23 01:30:37 +08:00
< tr class = "memdesc:dc/d80/collatz_8c" > < td class = "mdescLeft" >   < / td > < td class = "mdescRight" > Implementation of < a href = "https://en.wikipedia.org/wiki/Collatz_conjecture" target = "_blank" > Collatz' conjecture< / a > < br / > < / td > < / tr >
< tr class = "separator:" > < td class = "memSeparator" colspan = "2" >   < / td > < / tr >
2023-06-21 05:10:10 +08:00
< tr class = "memitem:" > < td class = "memItemLeft" align = "right" valign = "top" > < span class = "icondoc" > < / span >   < / td > < td class = "memItemRight" valign = "bottom" > < a class = "el" href = "d5/df9/euclidean__algorithm__extended_8c.html" > euclidean_algorithm_extended.c< / a > < / td > < / tr >
2023-04-14 05:36:06 +08:00
< tr class = "memdesc:d5/df9/euclidean__algorithm__extended_8c" > < td class = "mdescLeft" >   < / td > < td class = "mdescRight" > Program to perform the < a href = "https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm" target = "_blank" > extended Euclidean algorithm< / a > < br / > < / td > < / tr >
< tr class = "separator:" > < td class = "memSeparator" colspan = "2" >   < / td > < / tr >
2023-06-21 05:10:10 +08:00
< tr class = "memitem:" > < td class = "memItemLeft" align = "right" valign = "top" > < span class = "icondoc" > < / span >   < / td > < td class = "memItemRight" valign = "bottom" > < a class = "el" href = "d6/d3d/factorial__large__number_8c.html" > factorial_large_number.c< / a > < / td > < / tr >
2022-12-23 01:30:37 +08:00
< tr class = "memdesc:d6/d3d/factorial__large__number_8c" > < td class = "mdescLeft" >   < / td > < td class = "mdescRight" > Compute factorial of arbitrarily large numbers by storing individual digits in a byte. < br / > < / td > < / tr >
< tr class = "separator:" > < td class = "memSeparator" colspan = "2" >   < / td > < / tr >
2023-06-21 05:10:10 +08:00
< tr class = "memitem:" > < td class = "memItemLeft" align = "right" valign = "top" > < span class = "icondoc" > < / span >   < / td > < td class = "memItemRight" valign = "bottom" > < a class = "el" href = "d0/d6f/fibonacci_8c.html" > fibonacci.c< / a > < / td > < / tr >
2023-04-21 04:02:35 +08:00
< tr class = "memdesc:d0/d6f/fibonacci_8c" > < td class = "mdescLeft" >   < / td > < td class = "mdescRight" > Program to print the nth term of the Fibonacci series. < br / > < / td > < / tr >
< tr class = "separator:" > < td class = "memSeparator" colspan = "2" >   < / td > < / tr >
2023-06-21 05:10:10 +08:00
< tr class = "memitem:" > < td class = "memItemLeft" align = "right" valign = "top" > < span class = "icondoc" > < / span >   < / td > < td class = "memItemRight" valign = "bottom" > < a class = "el" href = "d4/d99/fibonacci__fast_8c.html" > fibonacci_fast.c< / a > < / td > < / tr >
2022-12-23 01:30:37 +08:00
< tr class = "memdesc:d4/d99/fibonacci__fast_8c" > < td class = "mdescLeft" >   < / td > < td class = "mdescRight" > Compute \(m^{mth}\) Fibonacci number using the formulae: < br / > < / td > < / tr >
< tr class = "separator:" > < td class = "memSeparator" colspan = "2" >   < / td > < / tr >
2023-06-21 05:10:10 +08:00
< tr class = "memitem:" > < td class = "memItemLeft" align = "right" valign = "top" > < span class = "icondoc" > < / span >   < / td > < td class = "memItemRight" valign = "bottom" > < a class = "el" href = "d8/d75/fibonacci__formula_8c.html" > fibonacci_formula.c< / a > < / td > < / tr >
2022-12-23 01:30:37 +08:00
< tr class = "memdesc:d8/d75/fibonacci__formula_8c" > < td class = "mdescLeft" >   < / td > < td class = "mdescRight" > Finding Fibonacci number of any < code > n< / code > number using [Binet's closed form formula](< a href = "https://en.wikipedia.org/wiki/Fibonacci_number#Binet's_formula" > https://en.wikipedia.org/wiki/Fibonacci_number#Binet's_formula< / a > ) compute \(f_{nth}\) Fibonacci number using the binet's formula: Fn = 1√5 * (1+√5 / 2)^n+1 − − < br / > < / td > < / tr >
< tr class = "separator:" > < td class = "memSeparator" colspan = "2" >   < / td > < / tr >
2023-06-21 05:10:10 +08:00
< tr class = "memitem:" > < td class = "memItemLeft" align = "right" valign = "top" > < span class = "icondoc" > < / span >   < / td > < td class = "memItemRight" valign = "bottom" > < a class = "el" href = "df/d16/palindrome_8c.html" > palindrome.c< / a > < / td > < / tr >
2022-12-23 01:30:37 +08:00
< tr class = "memdesc:df/d16/palindrome_8c" > < td class = "mdescLeft" >   < / td > < td class = "mdescRight" > Program to identify if a number is < a href = "https://en.wikipedia.org/wiki/Palindrome" target = "_blank" > palindrome number< / a > or not. < br / > < / td > < / tr >
< tr class = "separator:" > < td class = "memSeparator" colspan = "2" >   < / td > < / tr >
2023-06-21 05:10:10 +08:00
< tr class = "memitem:" > < td class = "memItemLeft" align = "right" valign = "top" > < span class = "icondoc" > < / span >   < / td > < td class = "memItemRight" valign = "bottom" > < a class = "el" href = "da/d93/prime_8c.html" > prime.c< / a > < / td > < / tr >
2022-12-23 01:30:37 +08:00
< tr class = "memdesc:da/d93/prime_8c" > < td class = "mdescLeft" >   < / td > < td class = "mdescRight" > Program to identify if a number is < a href = "https://en.wikipedia.org/wiki/Prime_number" target = "_blank" > prime number< / a > or not. < br / > < / td > < / tr >
< tr class = "separator:" > < td class = "memSeparator" colspan = "2" >   < / td > < / tr >
2023-06-21 05:10:10 +08:00
< tr class = "memitem:" > < td class = "memItemLeft" align = "right" valign = "top" > < span class = "icondoc" > < / span >   < / td > < td class = "memItemRight" valign = "bottom" > < a class = "el" href = "dd/dd3/prime__sieve_8c.html" > prime_sieve.c< / a > < / td > < / tr >
2022-12-23 01:30:37 +08:00
< tr class = "memdesc:dd/dd3/prime__sieve_8c" > < td class = "mdescLeft" >   < / td > < td class = "mdescRight" > < a href = "https://leetcode.com/problems/count-primes/" target = "_blank" > Prime Sieve< / a > algorithm implementation. < br / > < / td > < / tr >
< tr class = "separator:" > < td class = "memSeparator" colspan = "2" >   < / td > < / tr >
2023-06-21 05:10:10 +08:00
< tr class = "memitem:" > < td class = "memItemLeft" align = "right" valign = "top" > < span class = "icondoc" > < / span >   < / td > < td class = "memItemRight" valign = "bottom" > < a class = "el" href = "d4/dcc/strong__number_8c.html" > strong_number.c< / a > < / td > < / tr >
2022-12-23 01:30:37 +08:00
< tr class = "memdesc:d4/dcc/strong__number_8c" > < td class = "mdescLeft" >   < / td > < td class = "mdescRight" > Strong number is a number whose sum of all digits’ < br / > < / td > < / tr >
< tr class = "separator:" > < td class = "memSeparator" colspan = "2" >   < / td > < / tr >
< / table >
< / div > <!-- contents -->
< / div > <!-- doc - content -->
<!-- start footer part -->
< div id = "nav-path" class = "navpath" > <!-- id is needed for treeview function! -->
< ul >
< li class = "navelem" > < a class = "el" href = "dir_296d53ceaeaa7e099814a6def439fe8a.html" > math< / a > < / li >
2023-06-21 05:10:10 +08:00
< li class = "footer" > Generated by < a href = "https://www.doxygen.org/index.html" > < img class = "footer" src = "doxygen.svg" width = "104" height = "31" alt = "doxygen" / > < / a > 1.9.7 < / li >
2022-12-23 01:30:37 +08:00
< / ul >
< / div >
< / body >
< / html >
