mirrors/TheAlgorithms-C
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C synced 2024-12-04 11:11:54 +03:00
Code Issues Packages Projects Releases Wiki Activity
a1e00c078e
TheAlgorithms-C/dir_a52f4d3d586a58b02f3a4ddf0a992157.html
github-actions c11ed7ac9c Documentation for 0e956c6e58
2022-11-16 00:25:55 +00:00

166 lines
13 KiB
HTML
Raw Blame History

This file contains ambiguous Unicode characters

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

<!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"/>
<meta name="generator" content="Doxygen 1.9.5"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C: misc 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">&#160;1.0.0</span>
</div>
<div id="projectbrief">Set of algorithms implemented in C.</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.5 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;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&amp;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&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('dir_a52f4d3d586a58b02f3a4ddf0a992157.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">misc 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>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dc/d80/cantor__set_8c.html">cantor_set.c</a></td></tr>
<tr class="memdesc:dc/d80/cantor__set_8c"><td class="mdescLeft">&#160;</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">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d6/d2e/cartesian__to__polar_8c.html">cartesian_to_polar.c</a></td></tr>
<tr class="memdesc:d6/d2e/cartesian__to__polar_8c"><td class="mdescLeft">&#160;</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">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dc/d80/collatz_8c.html">collatz.c</a></td></tr>
<tr class="memdesc:dc/d80/collatz_8c"><td class="mdescLeft">&#160;</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">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d6/d3d/factorial__large__number_8c.html">factorial_large_number.c</a></td></tr>
<tr class="memdesc:d6/d3d/factorial__large__number_8c"><td class="mdescLeft">&#160;</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">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d99/fibonacci__fast_8c.html">fibonacci_fast.c</a></td></tr>
<tr class="memdesc:d4/d99/fibonacci__fast_8c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Compute \(m^{mth}\) Fibonacci number using the formulae: <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/d75/fibonacci__formula_8c.html">fibonacci_formula.c</a></td></tr>
<tr class="memdesc:d8/d75/fibonacci__formula_8c"><td class="mdescLeft">&#160;</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 − 1√5 * (1−√5 / 2)^n+1. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="df/d16/palindrome_8c.html">palindrome.c</a></td></tr>
<tr class="memdesc:df/d16/palindrome_8c"><td class="mdescLeft">&#160;</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">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d0/dcb/poly__add_8c.html">poly_add.c</a></td></tr>
<tr class="memdesc:d0/dcb/poly__add_8c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of [Addition of two polynomials] (<a href="https://en.wikipedia.org/wiki/Polynomial#Addition">https://en.wikipedia.org/wiki/Polynomial#Addition</a>) <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="df/d43/postfix__evaluation_8c.html">postfix_evaluation.c</a></td></tr>
<tr class="memdesc:df/d43/postfix__evaluation_8c"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://www.includehelp.com/c/evaluation-of-postfix-expressions-using-stack-with-c-program.aspx" target="_blank">Postfix evaluation algorithm</a> implementation <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="da/d93/prime_8c.html">prime.c</a></td></tr>
<tr class="memdesc:da/d93/prime_8c"><td class="mdescLeft">&#160;</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">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="db/dd5/prime__seive_8c.html">prime_seive.c</a></td></tr>
<tr class="memdesc:db/dd5/prime__seive_8c"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://leetcode.com/problems/count-primes/" target="_blank">Prime Seive</a> algorithm implementation. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/dcf/rot13_8c.html">rot13.c</a></td></tr>
<tr class="memdesc:de/dcf/rot13_8c"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/ROT13" target="_blank">ROT13</a> is a simple letter substitution cipher that replaces a letter with the 13th letter after it in the alphabet. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d1/dc7/run__length__encoding_8c.html">run_length_encoding.c</a></td></tr>
<tr class="memdesc:d1/dc7/run__length__encoding_8c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Encode a null terminated string using <a href="https://en.wikipedia.org/wiki/Run-length_encoding" target="_blank">Run-length encoding</a> <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/dcc/strong__number_8c.html">strong_number.c</a></td></tr>
<tr class="memdesc:d4/dcc/strong__number_8c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Strong number is a number whose sum of all digits’ factorial is equal to the number n For example: 145 = 1!(1) + 4!(24) + 5!(120) <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/dac/sudoku__solver_8c.html">sudoku_solver.c</a></td></tr>
<tr class="memdesc:de/dac/sudoku__solver_8c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sudoku Solver using recursive implementation of brute-force algorithm. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="df/df3/union__find_8c.html">union_find.c</a></td></tr>
<tr class="memdesc:df/df3/union__find_8c"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Disjoint-set_data_structure" target="_blank">Union find</a> algorithm. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</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_a52f4d3d586a58b02f3a4ddf0a992157.html">misc</a></li>
<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.5 </li>
</ul>
</div>
</body>
</html>
Reference in New Issue View Git Blame Copy Permalink