mirrors/TheAlgorithms-C
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C synced 2024-12-12 06:43:58 +03:00
Code Issues Packages Projects Releases Wiki Activity
9e8da353d0
TheAlgorithms-C/files.html
github-actions 03bb1302aa Documentation for 8241a58d42
2022-10-12 14:52:19 +00:00

312 lines
79 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: File List</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('files.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">File List</div></div>
</div><!--header-->
<div class="contents">
<div class="textblock">Here is a list of all documented files with brief descriptions:</div><div class="directory">
<div class="levels">[detail level <span onclick="javascript:toggleLevel(1);">1</span><span onclick="javascript:toggleLevel(2);">2</span><span onclick="javascript:toggleLevel(3);">3</span><span onclick="javascript:toggleLevel(4);">4</span>]</div><table class="directory">
<tr id="row_0_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_0_" class="arrow" onclick="toggleFolder('0_')">&#9658;</span><span id="img_0_" class="iconfclosed" onclick="toggleFolder('0_')">&#160;</span><a class="el" href="dir_a5f32cf82ad289a7dac212f63f40f55b.html" target="_self">audio</a></td><td class="desc"></td></tr>
<tr id="row_0_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/d27/alaw_8c.html" target="_self">alaw.c</a></td><td class="desc">A-law algorithm for encoding and decoding (16bit pcm &lt;=&gt; a-law). This is the implementation of <a href="https://en.wikipedia.org/wiki/G.711" target="_blank">G.711</a> in C </td></tr>
<tr id="row_1_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_1_" class="arrow" onclick="toggleFolder('1_')">&#9658;</span><span id="img_1_" class="iconfclosed" onclick="toggleFolder('1_')">&#160;</span><a class="el" href="dir_d20ad0b8de644c123692ba5582cc7a7b.html" target="_self">client_server</a></td><td class="desc"></td></tr>
<tr id="row_1_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dd/d93/client_8c.html" target="_self">client.c</a></td><td class="desc">Client side implementation of Server-Client system </td></tr>
<tr id="row_1_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d9/ddd/remote__command__exec__udp__client_8c.html" target="_self">remote_command_exec_udp_client.c</a></td><td class="desc">Client-side implementation of [Remote Command Execution Using UDP](<a href="https://www.imperva.com/learn/ddos/udp-user-datagram-protocol/">https://www.imperva.com/learn/ddos/udp-user-datagram-protocol/</a>) </td></tr>
<tr id="row_1_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dd/d79/remote__command__exec__udp__server_8c.html" target="_self">remote_command_exec_udp_server.c</a></td><td class="desc">Server-side implementation of [Remote Command Execution Using UDP](<a href="https://www.imperva.com/learn/ddos/udp-user-datagram-protocol/">https://www.imperva.com/learn/ddos/udp-user-datagram-protocol/</a>) </td></tr>
<tr id="row_1_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d1/d20/server_8c.html" target="_self">server.c</a></td><td class="desc">Server side implementation of Server-Client system </td></tr>
<tr id="row_1_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d1/d98/tcp__full__duplex__client_8c.html" target="_self">tcp_full_duplex_client.c</a></td><td class="desc">Client-side implementation of <a href="http://www.tcpipguide.com/free/t_SimplexFullDuplexandHalfDuplexOperation.htm" target="_blank">TCP Full Duplex Communication</a> </td></tr>
<tr id="row_1_5_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d1/d6b/tcp__full__duplex__server_8c.html" target="_self">tcp_full_duplex_server.c</a></td><td class="desc">Server-side implementation of <a href="http://www.tcpipguide.com/free/t_SimplexFullDuplexandHalfDuplexOperation.htm" target="_blank">TCP Full Duplex Communication</a> </td></tr>
<tr id="row_1_6_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/d07/tcp__half__duplex__client_8c.html" target="_self">tcp_half_duplex_client.c</a></td><td class="desc">Client-side implementation of <a href="http://www.tcpipguide.com/free/t_SimplexFullDuplexandHalfDuplexOperation.htm" target="_blank">TCP Half Duplex Communication</a> </td></tr>
<tr id="row_1_7_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d2b/tcp__half__duplex__server_8c.html" target="_self">tcp_half_duplex_server.c</a></td><td class="desc">Server-side implementation of <a href="http://www.tcpipguide.com/free/t_SimplexFullDuplexandHalfDuplexOperation.htm" target="_blank">TCP Half Duplex Communication</a> </td></tr>
<tr id="row_1_8_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/de6/udp__client_8c.html" target="_self">udp_client.c</a></td><td class="desc">Client side implementation of UDP client-server model </td></tr>
<tr id="row_1_9_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/dca/udp__server_8c.html" target="_self">udp_server.c</a></td><td class="desc">Server side implementation of UDP client-server model </td></tr>
<tr id="row_2_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_2_" class="arrow" onclick="toggleFolder('2_')">&#9658;</span><span id="img_2_" class="iconfclosed" onclick="toggleFolder('2_')">&#160;</span><a class="el" href="dir_9babc524d57e25f3d9f4179cabc3599e.html" target="_self">conversions</a></td><td class="desc"></td></tr>
<tr id="row_2_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/dd8/c__atoi__str__to__integer_8c.html" target="_self">c_atoi_str_to_integer.c</a></td><td class="desc">Recoding the original atoi function in stdlib.h </td></tr>
<tr id="row_2_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d1/dba/decimal__to__any__base_8c.html" target="_self">decimal_to_any_base.c</a></td><td class="desc"><a href="http://codeofthedamned.com/index.php/number-base-conversion" target="_blank">Decimal to any-base</a> is a C function wich convert positive decimal integer to any positive ascii base with the base's alphabet given in input and return it in a dynamically allocated string(recursive way) </td></tr>
<tr id="row_2_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/d30/decimal__to__binary__recursion_8c.html" target="_self">decimal_to_binary_recursion.c</a></td><td class="desc">Convert decimal to binary using recursion algorithm </td></tr>
<tr id="row_2_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/dd9/hexadecimal__to__octal2_8c.html" target="_self">hexadecimal_to_octal2.c</a></td><td class="desc">Convert hexadecimal number to octal number (with decimal intermediary) </td></tr>
<tr id="row_2_4_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/d0c/infix__to__postfix_8c.html" target="_self">infix_to_postfix.c</a></td><td class="desc"><a href="https://condor.depaul.edu/ichu/csc415/notes/notes9/Infix.htm" target="_blank">Infix to Postfix</a> Expression Conversion </td></tr>
<tr id="row_2_5_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/d96/infix__to__postfix2_8c.html" target="_self">infix_to_postfix2.c</a></td><td class="desc"><a href="https://www.includehelp.com/c/infix-to-postfix-conversion-using-stack-with-c-program.aspx" target="_blank">Infix to Postfix converter</a> implementation </td></tr>
<tr id="row_2_6_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dd/d53/int__to__string_8c.html" target="_self">int_to_string.c</a></td><td class="desc">Convert a positive integer to string (non-standard function) representation </td></tr>
<tr id="row_2_7_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/d8a/octal__to__hexadecimal_8c.html" target="_self">octal_to_hexadecimal.c</a></td><td class="desc">Octal to hexadecimal conversion by scanning user input </td></tr>
<tr id="row_3_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_3_" class="arrow" onclick="toggleFolder('3_')">&#9658;</span><span id="img_3_" class="iconfclosed" onclick="toggleFolder('3_')">&#160;</span><a class="el" href="dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html" target="_self">data_structures</a></td><td class="desc"></td></tr>
<tr id="row_3_0_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_3_0_" class="arrow" onclick="toggleFolder('3_0_')">&#9658;</span><span id="img_3_0_" class="iconfclosed" onclick="toggleFolder('3_0_')">&#160;</span><a class="el" href="dir_c7ef0fcb2f2095a74f0a3a1634dfc798.html" target="_self">array</a></td><td class="desc"></td></tr>
<tr id="row_3_0_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><a href="d2/dc3/carray_8h_source.html"><span class="icondoc"></span></a><b>carray.h</b></td><td class="desc"></td></tr>
<tr id="row_3_1_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_3_1_" class="arrow" onclick="toggleFolder('3_1_')">&#9658;</span><span id="img_3_1_" class="iconfclosed" onclick="toggleFolder('3_1_')">&#160;</span><a class="el" href="dir_e39df94f82619fa5256f1786519937be.html" target="_self">binary_trees</a></td><td class="desc"></td></tr>
<tr id="row_3_1_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/d02/binary__search__tree_8c.html" target="_self">binary_search_tree.c</a></td><td class="desc">A basic unbalanced binary search tree implementation in C </td></tr>
<tr id="row_3_1_1_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/da0/segment__tree_8c.html" target="_self">segment_tree.c</a></td><td class="desc">Segment trees with only point updates </td></tr>
<tr id="row_3_1_2_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/d3c/threaded__binary__trees_8c.html" target="_self">threaded_binary_trees.c</a></td><td class="desc">This file is a simple implementation of a Threaded Binary Tree </td></tr>
<tr id="row_3_1_3_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d3/d78/words__alphabetical_8c.html" target="_self">words_alphabetical.c</a></td><td class="desc">Printing the <a href="http://www.dailyfreecode.com/Code/word-list-reads-text-file-makes-2050.aspx" target="_blank">words contained in a file</a> named <code>file.txt</code> in alphabetical order and also their frequencies in to another file "wordcount.txt" </td></tr>
<tr id="row_3_2_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_3_2_" class="arrow" onclick="toggleFolder('3_2_')">&#9658;</span><span id="img_3_2_" class="iconfclosed" onclick="toggleFolder('3_2_')">&#160;</span><a class="el" href="dir_7445e5a68245b48f3c03982b6d501815.html" target="_self">dictionary</a></td><td class="desc"></td></tr>
<tr id="row_3_2_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><a href="d8/d7c/dict_8h_source.html"><span class="icondoc"></span></a><b>dict.h</b></td><td class="desc"></td></tr>
<tr id="row_3_3_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_3_3_" class="arrow" onclick="toggleFolder('3_3_')">&#9658;</span><span id="img_3_3_" class="iconfclosed" onclick="toggleFolder('3_3_')">&#160;</span><a class="el" href="dir_bd4a7dd282074645ef41b1ea31ac813a.html" target="_self">dynamic_array</a></td><td class="desc"></td></tr>
<tr id="row_3_3_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><a href="d8/da2/dynamic__array_8h_source.html"><span class="icondoc"></span></a><b>dynamic_array.h</b></td><td class="desc"></td></tr>
<tr id="row_3_4_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_3_4_" class="arrow" onclick="toggleFolder('3_4_')">&#9658;</span><span id="img_3_4_" class="iconfclosed" onclick="toggleFolder('3_4_')">&#160;</span><a class="el" href="dir_2fede762f95c9c526850a639b984c56b.html" target="_self">graphs</a></td><td class="desc"></td></tr>
<tr id="row_3_4_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><a href="d6/df3/graph_8h_source.html"><span class="icondoc"></span></a><b>graph.h</b></td><td class="desc"></td></tr>
<tr id="row_3_4_1_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><a href="d8/d38/queue_8h_source.html"><span class="icondoc"></span></a><b>queue.h</b></td><td class="desc"></td></tr>
<tr id="row_3_5_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_3_5_" class="arrow" onclick="toggleFolder('3_5_')">&#9658;</span><span id="img_3_5_" class="iconfclosed" onclick="toggleFolder('3_5_')">&#160;</span><a class="el" href="dir_955029374964e51cf770754b424e7d39.html" target="_self">hash_set</a></td><td class="desc"></td></tr>
<tr id="row_3_5_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><a href="dc/de3/hash__set_8h_source.html"><span class="icondoc"></span></a><b>hash_set.h</b></td><td class="desc"></td></tr>
<tr id="row_3_6_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_3_6_" class="arrow" onclick="toggleFolder('3_6_')">&#9658;</span><span id="img_3_6_" class="iconfclosed" onclick="toggleFolder('3_6_')">&#160;</span><a class="el" href="dir_261dd1200fad5b2fe1eca9af8320656e.html" target="_self">linked_list</a></td><td class="desc"></td></tr>
<tr id="row_3_6_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dd/d29/doubly__linked__list_8c.html" target="_self">doubly_linked_list.c</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Doubly_linked_list" target="_blank">Doubly linked list</a> </td></tr>
<tr id="row_3_7_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_3_7_" class="arrow" onclick="toggleFolder('3_7_')">&#9658;</span><span id="img_3_7_" class="iconfclosed" onclick="toggleFolder('3_7_')">&#160;</span><a class="el" href="dir_b6018f60d424a2ef7e4c942ac681e38b.html" target="_self">list</a></td><td class="desc"></td></tr>
<tr id="row_3_7_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><a href="da/d23/list_8h_source.html"><span class="icondoc"></span></a><b>list.h</b></td><td class="desc"></td></tr>
<tr id="row_3_8_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_3_8_" class="arrow" onclick="toggleFolder('3_8_')">&#9658;</span><span id="img_3_8_" class="iconfclosed" onclick="toggleFolder('3_8_')">&#160;</span><a class="el" href="dir_fb09f588f9daea69f78b63a0310e98cc.html" target="_self">queue</a></td><td class="desc"></td></tr>
<tr id="row_3_8_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><a href="d1/dbe/include_8h_source.html"><span class="icondoc"></span></a><b>include.h</b></td><td class="desc"></td></tr>
<tr id="row_3_9_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_3_9_" class="arrow" onclick="toggleFolder('3_9_')">&#9658;</span><span id="img_3_9_" class="iconfclosed" onclick="toggleFolder('3_9_')">&#160;</span><a class="el" href="dir_2176ba3565d8b1fe2a106d18679cc7bf.html" target="_self">stack</a></td><td class="desc"></td></tr>
<tr id="row_3_9_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span id="arr_3_9_0_" class="arrow" onclick="toggleFolder('3_9_0_')">&#9658;</span><span id="img_3_9_0_" class="iconfclosed" onclick="toggleFolder('3_9_0_')">&#160;</span><a class="el" href="dir_0472225043064b54f3dfff9011a9fae0.html" target="_self">stack_linked_list</a></td><td class="desc"></td></tr>
<tr id="row_3_9_0_0_" class="even" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;">&#160;</span><a href="da/d90/stack__linked__list_2stack_8h_source.html"><span class="icondoc"></span></a><b>stack.h</b></td><td class="desc"></td></tr>
<tr id="row_3_9_1_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><a href="d7/de0/stack_8h_source.html"><span class="icondoc"></span></a><b>stack.h</b></td><td class="desc"></td></tr>
<tr id="row_4_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_4_" class="arrow" onclick="toggleFolder('4_')">&#9658;</span><span id="img_4_" class="iconfclosed" onclick="toggleFolder('4_')">&#160;</span><a class="el" href="dir_abf1a26ece768c4076e73592705ae077.html" target="_self">developer_tools</a></td><td class="desc"></td></tr>
<tr id="row_4_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/d84/malloc__dbg_8c.html" target="_self">malloc_dbg.c</a></td><td class="desc">This file contains malloc_dbg, calloc_dbg, free_dbg and printLeaks implementations </td></tr>
<tr id="row_4_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d2/ddd/malloc__dbg_8h_source.html"><span class="icondoc"></span></a><a class="el" href="d2/ddd/malloc__dbg_8h.html" target="_self">malloc_dbg.h</a></td><td class="desc">Header file that contains macros used to replace malloc/calloc and free </td></tr>
<tr id="row_4_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/deb/min__printf_8h_source.html"><span class="icondoc"></span></a><a class="el" href="d9/deb/min__printf_8h.html" target="_self">min_printf.h</a></td><td class="desc">Implementation of a <a href="https://www.geeksforgeeks.org/variable-length-argument-c" target="_blank">function</a> similar to <code>printf</code> </td></tr>
<tr id="row_4_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dd/d11/test__malloc__dbg_8c.html" target="_self">test_malloc_dbg.c</a></td><td class="desc">File used to test the malloc_dbg, calloc_dbg and free_dbg functions </td></tr>
<tr id="row_4_4_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/d5c/test__min__printf_8c.html" target="_self">test_min_printf.c</a></td><td class="desc">File used to test min_printf function </td></tr>
<tr id="row_5_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_5_" class="arrow" onclick="toggleFolder('5_')">&#9658;</span><span id="img_5_" class="iconfclosed" onclick="toggleFolder('5_')">&#160;</span><a class="el" href="dir_48bf5503321d91c557399989fed5dabd.html" target="_self">exercism</a></td><td class="desc"></td></tr>
<tr id="row_5_0_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_5_0_" class="arrow" onclick="toggleFolder('5_0_')">&#9658;</span><span id="img_5_0_" class="iconfclosed" onclick="toggleFolder('5_0_')">&#160;</span><a class="el" href="dir_fe5d69ed7d90cb356556070c2a2e5478.html" target="_self">acronym</a></td><td class="desc"></td></tr>
<tr id="row_5_0_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><a href="df/dc6/acronym_8h_source.html"><span class="icondoc"></span></a><b>acronym.h</b></td><td class="desc"></td></tr>
<tr id="row_5_1_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_5_1_" class="arrow" onclick="toggleFolder('5_1_')">&#9658;</span><span id="img_5_1_" class="iconfclosed" onclick="toggleFolder('5_1_')">&#160;</span><a class="el" href="dir_4500de955d1eddb82f69331d96e39ed9.html" target="_self">hello_world</a></td><td class="desc"></td></tr>
<tr id="row_5_1_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><a href="db/ddb/hello__world_8h_source.html"><span class="icondoc"></span></a><b>hello_world.h</b></td><td class="desc"></td></tr>
<tr id="row_5_2_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_5_2_" class="arrow" onclick="toggleFolder('5_2_')">&#9658;</span><span id="img_5_2_" class="iconfclosed" onclick="toggleFolder('5_2_')">&#160;</span><a class="el" href="dir_76784a7b04633629b9ecb5543b9ad889.html" target="_self">isogram</a></td><td class="desc"></td></tr>
<tr id="row_5_2_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><a href="d6/d48/isogram_8h_source.html"><span class="icondoc"></span></a><b>isogram.h</b></td><td class="desc"></td></tr>
<tr id="row_5_3_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_5_3_" class="arrow" onclick="toggleFolder('5_3_')">&#9658;</span><span id="img_5_3_" class="iconfclosed" onclick="toggleFolder('5_3_')">&#160;</span><a class="el" href="dir_81f43aa0067826ea5befe80cd7aefcc5.html" target="_self">rna_transcription</a></td><td class="desc"></td></tr>
<tr id="row_5_3_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><a href="d7/d90/rna__transcription_8h_source.html"><span class="icondoc"></span></a><b>rna_transcription.h</b></td><td class="desc"></td></tr>
<tr id="row_5_4_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_5_4_" class="arrow" onclick="toggleFolder('5_4_')">&#9658;</span><span id="img_5_4_" class="iconfclosed" onclick="toggleFolder('5_4_')">&#160;</span><a class="el" href="dir_475f56e0a4ef6254f5610544d8d68aa3.html" target="_self">word_count</a></td><td class="desc"></td></tr>
<tr id="row_5_4_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><a href="dd/d95/word__count_8h_source.html"><span class="icondoc"></span></a><b>word_count.h</b></td><td class="desc"></td></tr>
<tr id="row_6_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_6_" class="arrow" onclick="toggleFolder('6_')">&#9658;</span><span id="img_6_" class="iconfclosed" onclick="toggleFolder('6_')">&#160;</span><a class="el" href="dir_4b6f782e158b0b98da980a0e11a23a15.html" target="_self">games</a></td><td class="desc"></td></tr>
<tr id="row_6_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/de2/naval__battle_8c.html" target="_self">naval_battle.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Battleship_(game)" target="_blank">naval_battle</a> implementation in C using only the stdio.h for Standard Input and Output </td></tr>
<tr id="row_7_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_7_" class="arrow" onclick="toggleFolder('7_')">&#9658;</span><span id="img_7_" class="iconfclosed" onclick="toggleFolder('7_')">&#160;</span><a class="el" href="dir_e3380d2178455503f266746fb14246a5.html" target="_self">geometry</a></td><td class="desc"></td></tr>
<tr id="row_7_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d0/dc7/geometry__datatypes_8h_source.html"><span class="icondoc"></span></a><a class="el" href="d0/dc7/geometry__datatypes_8h.html" target="_self">geometry_datatypes.h</a></td><td class="desc">Generic header that provides data types for 3D vectors and quaternions </td></tr>
<tr id="row_7_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/d98/quaternions_8c.html" target="_self">quaternions.c</a></td><td class="desc">Functions related to 3D quaternions and Euler angles </td></tr>
<tr id="row_7_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/db8/vectors__3d_8c.html" target="_self">vectors_3d.c</a></td><td class="desc">Functions related to 3D vector operations </td></tr>
<tr id="row_8_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_8_" class="arrow" onclick="toggleFolder('8_')">&#9658;</span><span id="img_8_" class="iconfclosed" onclick="toggleFolder('8_')">&#160;</span><a class="el" href="dir_e79632891301b850df87e9c0030293fa.html" target="_self">graphics</a></td><td class="desc"></td></tr>
<tr id="row_8_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/d98/spirograph_8c.html" target="_self">spirograph.c</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Spirograph" target="_blank">Spirograph</a> </td></tr>
<tr id="row_9_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_9_" class="arrow" onclick="toggleFolder('9_')">&#9658;</span><span id="img_9_" class="iconfclosed" onclick="toggleFolder('9_')">&#160;</span><a class="el" href="dir_a4300992e825aa9b9238bf43160a241e.html" target="_self">greedy_approach</a></td><td class="desc"></td></tr>
<tr id="row_9_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d9/dcc/prim_8c.html" target="_self">prim.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Prim%27s_algorithm" target="_blank">Prim's algorithm</a> implementation in C to find the MST of a weighted, connected graph </td></tr>
<tr id="row_10_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_10_" class="arrow" onclick="toggleFolder('10_')">&#9658;</span><span id="img_10_" class="iconfclosed" onclick="toggleFolder('10_')">&#160;</span><a class="el" href="dir_72aaf47615111200018c039a56ef48be.html" target="_self">hash</a></td><td class="desc"></td></tr>
<tr id="row_10_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d3/d39/hash__adler32_8c.html" target="_self">hash_adler32.c</a></td><td class="desc">32-bit <a href="https://en.wikipedia.org/wiki/Adler-32" target="_blank">Adler hash</a> algorithm </td></tr>
<tr id="row_10_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d9/dc9/hash__crc32_8c.html" target="_self">hash_crc32.c</a></td><td class="desc">32-bit <a href="https://en.wikipedia.org/wiki/Cyclic_redundancy_check#CRC-32_algorithm" target="_blank">CRC hash</a> algorithm </td></tr>
<tr id="row_10_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/de3/hash__djb2_8c.html" target="_self">hash_djb2.c</a></td><td class="desc"><a href="http://www.cse.yorku.ca/~oz/hash.html" target="_blank">DJB2 hash algorithm</a> </td></tr>
<tr id="row_10_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/d0c/hash__sdbm_8c.html" target="_self">hash_sdbm.c</a></td><td class="desc"><a href="http://www.cse.yorku.ca/~oz/hash.html" target="_blank">SDBM hash algorithm</a> </td></tr>
<tr id="row_10_4_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/d57/hash__xor8_8c.html" target="_self">hash_xor8.c</a></td><td class="desc">8-bit <a href="https://en.wikipedia.org/wiki/XOR_cipher" target="_blank">XOR hash</a> algorithm for ASCII characters </td></tr>
<tr id="row_11_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_11_" class="arrow" onclick="toggleFolder('11_')">&#9658;</span><span id="img_11_" class="iconfclosed" onclick="toggleFolder('11_')">&#160;</span><a class="el" href="dir_03902f230b9e9b7c999f936617a23997.html" target="_self">leetcode</a></td><td class="desc"></td></tr>
<tr id="row_11_0_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_11_0_" class="arrow" onclick="toggleFolder('11_0_')">&#9658;</span><span id="img_11_0_" class="iconfclosed" onclick="toggleFolder('11_0_')">&#160;</span><a class="el" href="dir_614f310c248f2b9541b559085cafcb40.html" target="_self">src</a></td><td class="desc"></td></tr>
<tr id="row_11_0_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/df3/6_8c.html" target="_self">6.c</a></td><td class="desc">Implementation of the <a href="https://leetcode.com/problems/zigzag-conversion/" target="_blank">ZigZag Conversion</a> Leetcode problem </td></tr>
<tr id="row_12_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_12_" class="arrow" onclick="toggleFolder('12_')">&#9658;</span><span id="img_12_" class="iconfclosed" onclick="toggleFolder('12_')">&#160;</span><a class="el" href="dir_3343723ae086de42ee4ca9774da3a13f.html" target="_self">machine_learning</a></td><td class="desc"></td></tr>
<tr id="row_12_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dd/d8c/adaline__learning_8c.html" target="_self">adaline_learning.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/ADALINE" target="_blank">Adaptive Linear Neuron (ADALINE)</a> implementation </td></tr>
<tr id="row_12_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d76/k__means__clustering_8c.html" target="_self">k_means_clustering.c</a></td><td class="desc">K Means Clustering Algorithm implemented </td></tr>
<tr id="row_12_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d2/df6/kohonen__som__topology_8c.html" target="_self">kohonen_som_topology.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Self-organizing_map" target="_blank">Kohonen self organizing map</a> (topological map) </td></tr>
<tr id="row_12_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/d46/kohonen__som__trace_8c.html" target="_self">kohonen_som_trace.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Self-organizing_map" target="_blank">Kohonen self organizing map</a> (data tracing) </td></tr>
<tr id="row_13_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_13_" class="arrow" onclick="toggleFolder('13_')">&#9658;</span><span id="img_13_" class="iconfclosed" onclick="toggleFolder('13_')">&#160;</span><a class="el" href="dir_a52f4d3d586a58b02f3a4ddf0a992157.html" target="_self">misc</a></td><td class="desc"></td></tr>
<tr id="row_13_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/d80/cantor__set_8c.html" target="_self">cantor_set.c</a></td><td class="desc">Program to generate <a href="https://en.wikipedia.org/wiki/Cantor_set" target="_blank">Cantor ternary set</a> </td></tr>
<tr id="row_13_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d2e/cartesian__to__polar_8c.html" target="_self">cartesian_to_polar.c</a></td><td class="desc">Function to convert a Cartesian co-ordinate to polar form </td></tr>
<tr id="row_13_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/d80/collatz_8c.html" target="_self">collatz.c</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Collatz_conjecture" target="_blank">Collatz' conjecture</a> </td></tr>
<tr id="row_13_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d3d/factorial__large__number_8c.html" target="_self">factorial_large_number.c</a></td><td class="desc">Compute factorial of arbitrarily large numbers by storing individual digits in a byte </td></tr>
<tr id="row_13_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d99/fibonacci__fast_8c.html" target="_self">fibonacci_fast.c</a></td><td class="desc">Compute \(m^{mth}\) Fibonacci number using the formulae: </td></tr>
<tr id="row_13_5_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/d75/fibonacci__formula_8c.html" target="_self">fibonacci_formula.c</a></td><td class="desc">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 </td></tr>
<tr id="row_13_6_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/d16/palindrome_8c.html" target="_self">palindrome.c</a></td><td class="desc">Program to identify if a number is <a href="https://en.wikipedia.org/wiki/Palindrome" target="_blank">palindrome number</a> or not </td></tr>
<tr id="row_13_7_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/dcb/poly__add_8c.html" target="_self">poly_add.c</a></td><td class="desc">Implementation of [Addition of two polynomials] (<a href="https://en.wikipedia.org/wiki/Polynomial#Addition">https://en.wikipedia.org/wiki/Polynomial#Addition</a>) </td></tr>
<tr id="row_13_8_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/d43/postfix__evaluation_8c.html" target="_self">postfix_evaluation.c</a></td><td class="desc"><a href="https://www.includehelp.com/c/evaluation-of-postfix-expressions-using-stack-with-c-program.aspx" target="_blank">Postfix evaluation algorithm</a> implementation </td></tr>
<tr id="row_13_9_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/d93/prime_8c.html" target="_self">prime.c</a></td><td class="desc">Program to identify if a number is <a href="https://en.wikipedia.org/wiki/Prime_number" target="_blank">prime number</a> or not </td></tr>
<tr id="row_13_10_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/dd5/prime__seive_8c.html" target="_self">prime_seive.c</a></td><td class="desc"><a href="https://leetcode.com/problems/count-primes/" target="_blank">Prime Seive</a> algorithm implementation </td></tr>
<tr id="row_13_11_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d1/dc7/run__length__encoding_8c.html" target="_self">run_length_encoding.c</a></td><td class="desc">Encode a null terminated string using <a href="https://en.wikipedia.org/wiki/Run-length_encoding" target="_blank">Run-length encoding</a> </td></tr>
<tr id="row_13_12_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/dcc/strong__number_8c.html" target="_self">strong_number.c</a></td><td class="desc">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) </td></tr>
<tr id="row_13_13_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/dac/sudoku__solver_8c.html" target="_self">sudoku_solver.c</a></td><td class="desc">Sudoku Solver using recursive implementation of brute-force algorithm </td></tr>
<tr id="row_13_14_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/df3/union__find_8c.html" target="_self">union_find.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Disjoint-set_data_structure" target="_blank">Union find</a> algorithm </td></tr>
<tr id="row_14_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_14_" class="arrow" onclick="toggleFolder('14_')">&#9658;</span><span id="img_14_" class="iconfclosed" onclick="toggleFolder('14_')">&#160;</span><a class="el" href="dir_9c6faab82c22511b50177aa2e38e2780.html" target="_self">numerical_methods</a></td><td class="desc"></td></tr>
<tr id="row_14_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/d38/durand__kerner__roots_8c.html" target="_self">durand_kerner_roots.c</a></td><td class="desc">Compute all possible approximate roots of any given polynomial using <a href="https://en.wikipedia.org/wiki/Durand%E2%80%93Kerner_method" target="_blank">Durand Kerner algorithm</a> </td></tr>
<tr id="row_14_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/d2e/lu__decompose_8c.html" target="_self">lu_decompose.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/LU_decompositon" target="_blank">LU decomposition</a> of a square matrix </td></tr>
<tr id="row_14_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dd/d08/newton__raphson__root_8c.html" target="_self">newton_raphson_root.c</a></td><td class="desc">Find approximate solution for \(f(x) = 0\) using Newton-Raphson interpolation algorithm </td></tr>
<tr id="row_14_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d07/ode__forward__euler_8c.html" target="_self">ode_forward_euler.c</a></td><td class="desc">Solve a multivariable first order <a href="https://en.wikipedia.org/wiki/Ordinary_differential_equation" target="_blank">ordinary differential equation (ODEs)</a> using <a href="https://en.wikipedia.org/wiki/Numerical_methods_for_ordinary_differential_equations#Euler_method" target="_blank">forward Euler method</a> </td></tr>
<tr id="row_14_4_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d1/dc2/ode__midpoint__euler_8c.html" target="_self">ode_midpoint_euler.c</a></td><td class="desc">Solve a multivariable first order <a href="https://en.wikipedia.org/wiki/Ordinary_differential_equation" target="_blank">ordinary differential equation (ODEs)</a> using <a href="https://en.wikipedia.org/wiki/Midpoint_method" target="_blank">midpoint Euler method</a> </td></tr>
<tr id="row_14_5_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d99/ode__semi__implicit__euler_8c.html" target="_self">ode_semi_implicit_euler.c</a></td><td class="desc">Solve a multivariable first order <a href="https://en.wikipedia.org/wiki/Ordinary_differential_equation" target="_blank">ordinary differential equation (ODEs)</a> using <a href="https://en.wikipedia.org/wiki/Semi-implicit_Euler_method" target="_blank">semi implicit Euler method</a> </td></tr>
<tr id="row_14_6_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d68/qr__decompose_8h_source.html"><span class="icondoc"></span></a><a class="el" href="d4/d68/qr__decompose_8h.html" target="_self">qr_decompose.h</a></td><td class="desc">Library functions to compute <a href="https://en.wikipedia.org/wiki/QR_decomposition" target="_blank">QR decomposition</a> of a given matrix </td></tr>
<tr id="row_14_7_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/d23/qr__decomposition_8c.html" target="_self">qr_decomposition.c</a></td><td class="desc">Program to compute the <a href="https://en.wikipedia.org/wiki/QR_decomposition" target="_blank">QR decomposition</a> of a given matrix </td></tr>
<tr id="row_14_8_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/d50/qr__eigen__values_8c.html" target="_self">qr_eigen_values.c</a></td><td class="desc">Compute real eigen values and eigen vectors of a symmetric matrix using <a href="https://en.wikipedia.org/wiki/QR_decomposition" target="_blank">QR decomposition</a> method </td></tr>
<tr id="row_14_9_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/d47/realtime__stats_8c.html" target="_self">realtime_stats.c</a></td><td class="desc">Compute statistics for data entered in rreal-time </td></tr>
<tr id="row_15_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_15_" class="arrow" onclick="toggleFolder('15_')">&#9658;</span><span id="img_15_" class="iconfclosed" onclick="toggleFolder('15_')">&#160;</span><a class="el" href="dir_b3d331eabd4234f247030c297aaf021c.html" target="_self">project_euler</a></td><td class="desc"></td></tr>
<tr id="row_15_0_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_15_0_" class="arrow" onclick="toggleFolder('15_0_')">&#9658;</span><span id="img_15_0_" class="iconfclosed" onclick="toggleFolder('15_0_')">&#160;</span><a class="el" href="dir_8c6743d405e8ed13cc39f42e382307fd.html" target="_self">problem_1</a></td><td class="desc"></td></tr>
<tr id="row_15_0_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/d35/problem__1_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=1" target="_blank">Problem 1</a> solution </td></tr>
<tr id="row_15_0_1_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d2/dae/problem__1_2sol2_8c.html" target="_self">sol2.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=1" target="_blank">Problem 1</a> solution </td></tr>
<tr id="row_15_0_2_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/d56/problem__1_2sol3_8c.html" target="_self">sol3.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=1" target="_blank">Problem 1</a> solution </td></tr>
<tr id="row_15_0_3_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d1b/sol4_8c.html" target="_self">sol4.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=1" target="_blank">Problem 1</a> solution </td></tr>
<tr id="row_15_1_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_15_1_" class="arrow" onclick="toggleFolder('15_1_')">&#9658;</span><span id="img_15_1_" class="iconfclosed" onclick="toggleFolder('15_1_')">&#160;</span><a class="el" href="dir_16b947d8e9a05fe119d0675493324331.html" target="_self">problem_10</a></td><td class="desc"></td></tr>
<tr id="row_15_1_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/d6d/problem__10_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=10" target="_blank">Problem 10</a> solution </td></tr>
<tr id="row_15_1_1_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d9/da7/problem__10_2sol2_8c.html" target="_self">sol2.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=10" target="_blank">Problem 10</a> solution </td></tr>
<tr id="row_15_2_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_15_2_" class="arrow" onclick="toggleFolder('15_2_')">&#9658;</span><span id="img_15_2_" class="iconfclosed" onclick="toggleFolder('15_2_')">&#160;</span><a class="el" href="dir_d9112ab06cf4d4e5a25d385a268d1949.html" target="_self">problem_12</a></td><td class="desc"></td></tr>
<tr id="row_15_2_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/d1f/problem__12_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=12" target="_blank">Problem 12</a> solution </td></tr>
<tr id="row_15_3_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_15_3_" class="arrow" onclick="toggleFolder('15_3_')">&#9658;</span><span id="img_15_3_" class="iconfclosed" onclick="toggleFolder('15_3_')">&#160;</span><a class="el" href="dir_f7d3c03fcac84aef1b0c66cc497ed1ea.html" target="_self">problem_13</a></td><td class="desc"></td></tr>
<tr id="row_15_3_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/d01/problem__13_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=13" target="_blank">Problem 13</a> solution </td></tr>
<tr id="row_15_4_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_15_4_" class="arrow" onclick="toggleFolder('15_4_')">&#9658;</span><span id="img_15_4_" class="iconfclosed" onclick="toggleFolder('15_4_')">&#160;</span><a class="el" href="dir_aba97bf327db94061e830e9bc18e925d.html" target="_self">problem_14</a></td><td class="desc"></td></tr>
<tr id="row_15_4_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/dea/problem__14_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=14" target="_blank">Problem 14</a> solution </td></tr>
<tr id="row_15_5_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_15_5_" class="arrow" onclick="toggleFolder('15_5_')">&#9658;</span><span id="img_15_5_" class="iconfclosed" onclick="toggleFolder('15_5_')">&#160;</span><a class="el" href="dir_2b14f32f14b51065d3a322bea21da3c0.html" target="_self">problem_15</a></td><td class="desc"></td></tr>
<tr id="row_15_5_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/d91/problem__15_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=15" target="_blank">Problem 15</a> solution </td></tr>
<tr id="row_15_6_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_15_6_" class="arrow" onclick="toggleFolder('15_6_')">&#9658;</span><span id="img_15_6_" class="iconfclosed" onclick="toggleFolder('15_6_')">&#160;</span><a class="el" href="dir_18cba55772148686552805a354a79093.html" target="_self">problem_16</a></td><td class="desc"></td></tr>
<tr id="row_15_6_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d88/problem__16_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=16" target="_blank">Problem 16</a> solution </td></tr>
<tr id="row_15_7_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_15_7_" class="arrow" onclick="toggleFolder('15_7_')">&#9658;</span><span id="img_15_7_" class="iconfclosed" onclick="toggleFolder('15_7_')">&#160;</span><a class="el" href="dir_0bc3e2a5baf077fa21dadc079776fcac.html" target="_self">problem_19</a></td><td class="desc"></td></tr>
<tr id="row_15_7_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dd/df0/problem__19_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=19" target="_blank">Problem 19</a> solution </td></tr>
<tr id="row_15_8_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_15_8_" class="arrow" onclick="toggleFolder('15_8_')">&#9658;</span><span id="img_15_8_" class="iconfclosed" onclick="toggleFolder('15_8_')">&#160;</span><a class="el" href="dir_eeeea13e3a5e5edad3499183767ce312.html" target="_self">problem_2</a></td><td class="desc"></td></tr>
<tr id="row_15_8_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/d7f/so1_8c.html" target="_self">so1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=2" target="_blank">Problem 2</a> solution </td></tr>
<tr id="row_15_9_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_15_9_" class="arrow" onclick="toggleFolder('15_9_')">&#9658;</span><span id="img_15_9_" class="iconfclosed" onclick="toggleFolder('15_9_')">&#160;</span><a class="el" href="dir_4991c92e00761dd3d764efa2906b4318.html" target="_self">problem_20</a></td><td class="desc"></td></tr>
<tr id="row_15_9_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/d80/problem__20_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=20" target="_blank">Problem 20</a> solution </td></tr>
<tr id="row_15_10_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_15_10_" class="arrow" onclick="toggleFolder('15_10_')">&#9658;</span><span id="img_15_10_" class="iconfclosed" onclick="toggleFolder('15_10_')">&#160;</span><a class="el" href="dir_d9e100c82ada2163abea49688a71e81c.html" target="_self">problem_21</a></td><td class="desc"></td></tr>
<tr id="row_15_10_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/d1a/problem__21_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=21" target="_blank">Problem 21</a> solution </td></tr>
<tr id="row_15_11_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_15_11_" class="arrow" onclick="toggleFolder('15_11_')">&#9658;</span><span id="img_15_11_" class="iconfclosed" onclick="toggleFolder('15_11_')">&#160;</span><a class="el" href="dir_2abe2c0880d3fb0dba0f784bee3fc9e0.html" target="_self">problem_22</a></td><td class="desc"></td></tr>
<tr id="row_15_11_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dd/d8b/problem__22_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=22" target="_blank">Problem 22</a> solution </td></tr>
<tr id="row_15_12_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_15_12_" class="arrow" onclick="toggleFolder('15_12_')">&#9658;</span><span id="img_15_12_" class="iconfclosed" onclick="toggleFolder('15_12_')">&#160;</span><a class="el" href="dir_f75ccd45e00436eafed446b9b2682984.html" target="_self">problem_23</a></td><td class="desc"></td></tr>
<tr id="row_15_12_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/ddb/problem__23_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=23" target="_blank">Problem 23</a> solution </td></tr>
<tr id="row_15_12_1_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/dbd/problem__23_2sol2_8c.html" target="_self">sol2.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=23" target="_blank">Problem 23</a> solution - optimization using look-up array </td></tr>
<tr id="row_15_13_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_15_13_" class="arrow" onclick="toggleFolder('15_13_')">&#9658;</span><span id="img_15_13_" class="iconfclosed" onclick="toggleFolder('15_13_')">&#160;</span><a class="el" href="dir_079e1f799fb08a8a0b98cb030ab15687.html" target="_self">problem_25</a></td><td class="desc"></td></tr>
<tr id="row_15_13_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/d32/problem__25_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=25" target="_blank">Problem 25</a> solution implemented using arbitrarily large numbers represented as arrays </td></tr>
<tr id="row_15_14_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_15_14_" class="arrow" onclick="toggleFolder('15_14_')">&#9658;</span><span id="img_15_14_" class="iconfclosed" onclick="toggleFolder('15_14_')">&#160;</span><a class="el" href="dir_16e00c78ef36d1842d0d8a4afc46b852.html" target="_self">problem_26</a></td><td class="desc"></td></tr>
<tr id="row_15_14_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d1/df9/problem__26_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=26" target="_blank">Problem 26</a> solution </td></tr>
<tr id="row_15_15_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_15_15_" class="arrow" onclick="toggleFolder('15_15_')">&#9658;</span><span id="img_15_15_" class="iconfclosed" onclick="toggleFolder('15_15_')">&#160;</span><a class="el" href="dir_b2dbfa46230fd9f775c32c1836ed3764.html" target="_self">problem_3</a></td><td class="desc"></td></tr>
<tr id="row_15_15_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/dd3/problem__3_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=3" target="_blank">Problem 3</a> solution </td></tr>
<tr id="row_15_15_1_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d2/dbc/problem__3_2sol2_8c.html" target="_self">sol2.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=3" target="_blank">Problem 3</a> solution </td></tr>
<tr id="row_15_16_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_15_16_" class="arrow" onclick="toggleFolder('15_16_')">&#9658;</span><span id="img_15_16_" class="iconfclosed" onclick="toggleFolder('15_16_')">&#160;</span><a class="el" href="dir_1833eb69ceee7a265ffba4c38c8243d2.html" target="_self">problem_4</a></td><td class="desc"></td></tr>
<tr id="row_15_16_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/d6c/problem__4_2sol_8c.html" target="_self">sol.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=4" target="_blank">Problem 4</a> solution </td></tr>
<tr id="row_15_17_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_15_17_" class="arrow" onclick="toggleFolder('15_17_')">&#9658;</span><span id="img_15_17_" class="iconfclosed" onclick="toggleFolder('15_17_')">&#160;</span><a class="el" href="dir_2f070f19f76dfadabbc24fe483d7e98d.html" target="_self">problem_401</a></td><td class="desc"></td></tr>
<tr id="row_15_17_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d83/problem__401_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=401" target="_blank">Problem 401</a> solution - Sum of squares of divisors </td></tr>
<tr id="row_15_18_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_15_18_" class="arrow" onclick="toggleFolder('15_18_')">&#9658;</span><span id="img_15_18_" class="iconfclosed" onclick="toggleFolder('15_18_')">&#160;</span><a class="el" href="dir_607f15d36c772334f988bb9ef82d102c.html" target="_self">problem_5</a></td><td class="desc"></td></tr>
<tr id="row_15_18_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/d32/problem__5_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=5" target="_blank">Problem 5</a> solution - Naive algorithm (slowest) </td></tr>
<tr id="row_15_18_1_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/d3d/problem__5_2sol2_8c.html" target="_self">sol2.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=5" target="_blank">Problem 5</a> solution - Naive algorithm (Improved over <a class="el" href="dc/d32/problem__5_2sol1_8c.html" title="Problem 5 solution - Naive algorithm (slowest)">problem_5/sol1.c</a>) </td></tr>
<tr id="row_15_18_2_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/d7c/problem__5_2sol3_8c.html" target="_self">sol3.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=5" target="_blank">Problem 5</a> solution (Fastest) </td></tr>
<tr id="row_15_19_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_15_19_" class="arrow" onclick="toggleFolder('15_19_')">&#9658;</span><span id="img_15_19_" class="iconfclosed" onclick="toggleFolder('15_19_')">&#160;</span><a class="el" href="dir_167af11096b7752ff31b3d4bec489317.html" target="_self">problem_6</a></td><td class="desc"></td></tr>
<tr id="row_15_19_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d7b/problem__6_2sol_8c.html" target="_self">sol.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=6" target="_blank">Problem 6</a> solution </td></tr>
<tr id="row_15_20_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_15_20_" class="arrow" onclick="toggleFolder('15_20_')">&#9658;</span><span id="img_15_20_" class="iconfclosed" onclick="toggleFolder('15_20_')">&#160;</span><a class="el" href="dir_4bae997a2671812c2140d5abfb6305a4.html" target="_self">problem_7</a></td><td class="desc"></td></tr>
<tr id="row_15_20_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d1/d2f/problem__7_2sol_8c.html" target="_self">sol.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=7" target="_blank">Problem 7</a> solution </td></tr>
<tr id="row_15_20_1_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d64/problem__7_2sol2_8c.html" target="_self">sol2.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=7" target="_blank">Problem 7</a> solution </td></tr>
<tr id="row_15_21_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_15_21_" class="arrow" onclick="toggleFolder('15_21_')">&#9658;</span><span id="img_15_21_" class="iconfclosed" onclick="toggleFolder('15_21_')">&#160;</span><a class="el" href="dir_4a15c8553efb9e59e3f1091cc0d3a27d.html" target="_self">problem_8</a></td><td class="desc"></td></tr>
<tr id="row_15_21_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/d63/problem__8_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=8" target="_blank">Problem 8</a> solution </td></tr>
<tr id="row_15_21_1_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d2/d93/problem__8_2sol2_8c.html" target="_self">sol2.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=8" target="_blank">Problem 8</a> solution </td></tr>
<tr id="row_15_22_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_15_22_" class="arrow" onclick="toggleFolder('15_22_')">&#9658;</span><span id="img_15_22_" class="iconfclosed" onclick="toggleFolder('15_22_')">&#160;</span><a class="el" href="dir_d4c35186c199e728d69dee6bf5b2473c.html" target="_self">problem_9</a></td><td class="desc"></td></tr>
<tr id="row_15_22_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/da5/problem__9_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=9" target="_blank">Problem 9</a> solution - A naive implementation </td></tr>
<tr id="row_15_22_1_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/de0/problem__9_2sol2_8c.html" target="_self">sol2.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=9" target="_blank">Problem 9</a> solution </td></tr>
<tr id="row_16_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_16_" class="arrow" onclick="toggleFolder('16_')">&#9658;</span><span id="img_16_" class="iconfclosed" onclick="toggleFolder('16_')">&#160;</span><a class="el" href="dir_da574daf9ce9c05b45556bdc871ed1e3.html" target="_self">searching</a></td><td class="desc"></td></tr>
<tr id="row_16_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/d3b/binary__search_8c.html" target="_self">binary_search.c</a></td><td class="desc">Program to perform <a href="https://en.wikipedia.org/wiki/Binary_search_algorithm" target="_blank">binary search</a> of a target value in a given <em>sorted</em> array </td></tr>
<tr id="row_16_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/d6c/exponential__search_8c.html" target="_self">exponential_search.c</a></td><td class="desc"><a href="https://github.com/TheAlgorithms/Algorithms-Explanation/blob/master/en/Search%20Algorithms/Exponential%20Search.md" target="_blank">Exponential Search</a> </td></tr>
<tr id="row_16_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d2/d9b/floyd__cycle__detection__algorithm_8c.html" target="_self">floyd_cycle_detection_algorithm.c</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Cycle_detection" target="_blank">Floyd's Cycle Detection</a> algorithm </td></tr>
<tr id="row_16_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d7b/jump__search_8c.html" target="_self">jump_search.c</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Jump_search" target="_blank">jump search</a> algorithm </td></tr>
<tr id="row_16_4_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d3/d47/modified__binary__search_8c.html" target="_self">modified_binary_search.c</a></td><td class="desc"><a href="https://arxiv.org/abs/1406.1677" target="_blank">Modified binary search algorithm</a> </td></tr>
<tr id="row_16_5_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/de2/sentinel__linear__search_8c.html" target="_self">sentinel_linear_search.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Linear_search#With_a_sentinel" target="_blank">Linear Search with Sentinel</a> algorithm implementation </td></tr>
<tr id="row_17_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_17_" class="arrow" onclick="toggleFolder('17_')">&#9658;</span><span id="img_17_" class="iconfclosed" onclick="toggleFolder('17_')">&#160;</span><a class="el" href="dir_bb1b521853a9c46347182a9d10420771.html" target="_self">sorting</a></td><td class="desc"></td></tr>
<tr id="row_17_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d2/da8/bead__sort_8c.html" target="_self">bead_sort.c</a></td><td class="desc">Sorting of array list using <a href="https://en.wikipedia.org/wiki/Bead_sort" target="_blank">bead sort</a> </td></tr>
<tr id="row_17_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dd/de4/bubble__sort_8c.html" target="_self">bubble_sort.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Bubble_sort" target="_blank">Bubble sort</a> algorithm implementation </td></tr>
<tr id="row_17_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d2/d6d/bubble__sort__2_8c.html" target="_self">bubble_sort_2.c</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Bubble_sort" target="_blank">Bubble sort</a> algorithm </td></tr>
<tr id="row_17_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/d38/bubble__sort__recursion_8c.html" target="_self">bubble_sort_recursion.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Bubble_sort" target="_blank">Bubble sort</a> algorithm implementation using recursion </td></tr>
<tr id="row_17_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/dff/heap__sort__2_8c.html" target="_self">heap_sort_2.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Heapsort" target="_blank">Heap Sort</a> implementation </td></tr>
<tr id="row_17_5_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/ddf/insertion__sort_8c.html" target="_self">insertion_sort.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Insertion_sort" target="_blank">Insertion sort</a> algorithm implementation </td></tr>
<tr id="row_17_6_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/d0c/insertion__sort__recursive_8c.html" target="_self">insertion_sort_recursive.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Insertion_sort" target="_blank">Insertion sort</a> algorithm implementation </td></tr>
<tr id="row_17_7_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d2/d83/merge__sort_8c.html" target="_self">merge_sort.c</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Merge_sort" target="_blank">merge sort</a> algorithm </td></tr>
<tr id="row_17_8_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d1/d94/odd__even__sort_8c.html" target="_self">odd_even_sort.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Odd%E2%80%93even_sort" target="_blank">Odd Even Sort</a> implementation </td></tr>
<tr id="row_17_9_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/d83/selection__sort_8c.html" target="_self">selection_sort.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Selection_sort" target="_blank">Selection sort</a> algorithm implementation </td></tr>
<tr id="row_17_10_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/d39/selection__sort__recursive_8c.html" target="_self">selection_sort_recursive.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Selection_sort" target="_blank">Selection Sort</a> implementation using recursion </td></tr>
<tr id="row_17_11_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/ded/shell__sort2_8c.html" target="_self">shell_sort2.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Shell_sort" target="_blank">Shell sort algorithm</a> implementation </td></tr>
</table>
</div><!-- directory -->
</div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<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