OpenSoure_Repos/TheAlgorithms-C
1
0
Fork 0
mirror of https://github.moeyy.xyz/https://github.com/TheAlgorithms/C.git synced 2023-10-11 15:56:24 +08:00
Code Issues Packages Projects Releases Wiki Activity
0306a15e57
TheAlgorithms-C/dd/d93/client_8c.html
github-actions 0306a15e57 Documentation for 526c898644
2020-09-23 18:41:49 +00:00

352 lines
60 KiB
HTML
Raw Blame History

<!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">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.20"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C: client_server/client.c File 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 style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">Algorithms_in_C
&#160;<span id="projectnumber">1.0.0</span>
</div>
<div id="projectbrief">Set of algorithms implemented in C.</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.20 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "../../search",false,'Search');
/* @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:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(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:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('dd/d93/client_8c.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">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div class="header">
<div class="summary">
<a href="#define-members">Macros</a> &#124;
<a href="#func-members">Functions</a> </div>
<div class="headertitle">
<div class="title">client.c File Reference</div> </div>
</div><!--header-->
<div class="contents">
<p>Client side implementation of Server-Client system.
<a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;stdio.h&gt;</code><br />
<code>#include &lt;stdlib.h&gt;</code><br />
<code>#include &lt;string.h&gt;</code><br />
<code>#include &lt;arpa/inet.h&gt;</code><br />
<code>#include &lt;netdb.h&gt;</code><br />
<code>#include &lt;sys/socket.h&gt;</code><br />
<code>#include &lt;unistd.h&gt;</code><br />
</div><div class="textblock"><div class="dynheader">
Include dependency graph for client.c:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/d6d/client_8c__incl.svg" width="662" height="112"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="define-members"></a>
Macros</h2></td></tr>
<tr class="memitem:a392fb874e547e582e9c66a08a1f23326"><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d93/client_8c.html#a392fb874e547e582e9c66a08a1f23326">MAX</a>&#160;&#160;&#160;80</td></tr>
<tr class="memdesc:a392fb874e547e582e9c66a08a1f23326"><td class="mdescLeft">&#160;</td><td class="mdescRight">max. <a href="../../dd/d93/client_8c.html#a392fb874e547e582e9c66a08a1f23326">More...</a><br /></td></tr>
<tr class="separator:a392fb874e547e582e9c66a08a1f23326"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a614217d263be1fb1a5f76e2ff7be19a2"><td class="memItemLeft" align="right" valign="top"><a id="a614217d263be1fb1a5f76e2ff7be19a2"></a>
#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d93/client_8c.html#a614217d263be1fb1a5f76e2ff7be19a2">PORT</a>&#160;&#160;&#160;8080</td></tr>
<tr class="memdesc:a614217d263be1fb1a5f76e2ff7be19a2"><td class="mdescLeft">&#160;</td><td class="mdescRight">port number to connect to <br /></td></tr>
<tr class="separator:a614217d263be1fb1a5f76e2ff7be19a2"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a1e43924adac4ae865aa0acf79710261c"><td class="memItemLeft" align="right" valign="top"><a id="a1e43924adac4ae865aa0acf79710261c"></a>
#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d93/client_8c.html#a1e43924adac4ae865aa0acf79710261c">SA</a>&#160;&#160;&#160;struct sockaddr</td></tr>
<tr class="memdesc:a1e43924adac4ae865aa0acf79710261c"><td class="mdescLeft">&#160;</td><td class="mdescRight">shortname for sockaddr <br /></td></tr>
<tr class="separator:a1e43924adac4ae865aa0acf79710261c"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:ac17020a38607ab29ce18939d5194a32a"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d93/client_8c.html#ac17020a38607ab29ce18939d5194a32a">func</a> (int sockfd)</td></tr>
<tr class="memdesc:ac17020a38607ab29ce18939d5194a32a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Continuous loop to send and receive over the socket. <a href="../../dd/d93/client_8c.html#ac17020a38607ab29ce18939d5194a32a">More...</a><br /></td></tr>
<tr class="separator:ac17020a38607ab29ce18939d5194a32a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top"><a id="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d93/client_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Driver code. <br /></td></tr>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Client side implementation of Server-Client system. </p>
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Nairit11">Nairit11</a> </dd>
<dd>
<a href="https://github.com/kvedala">Krishna Vedala</a> </dd></dl>
<dl class="section see"><dt>See also</dt><dd><a class="el" href="../../d1/d20/server_8c.html" title="Server side implementation of Server-Client system.">client_server/server.c</a> </dd></dl>
</div><h2 class="groupheader">Macro Definition Documentation</h2>
<a id="a392fb874e547e582e9c66a08a1f23326"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a392fb874e547e582e9c66a08a1f23326">&#9670;&nbsp;</a></span>MAX</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">#define MAX&#160;&#160;&#160;80</td>
</tr>
</table>
</div><div class="memdoc">
<p>max. </p>
<p>characters per message </p>
</div>
</div>
<h2 class="groupheader">Function Documentation</h2>
<a id="ac17020a38607ab29ce18939d5194a32a"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ac17020a38607ab29ce18939d5194a32a">&#9670;&nbsp;</a></span>func()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void func </td>
<td>(</td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>sockfd</em></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Continuous loop to send and receive over the socket. </p>
<p>Exits when "exit" is sent from commandline. </p><dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">sockfd</td><td>socket handle number </td></tr>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><a name="l00038"></a><span class="lineno"> 38</span>&#160;{</div>
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>&#160; <span class="keywordtype">char</span> buff[<a class="code" href="../../dd/d93/client_8c.html#a392fb874e547e582e9c66a08a1f23326">MAX</a>];</div>
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>&#160; <span class="keywordtype">int</span> n;</div>
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>&#160; <span class="keywordflow">for</span> (;;)</div>
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>&#160; {</div>
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>&#160; bzero(buff, <span class="keyword">sizeof</span>(buff));</div>
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>&#160; printf(<span class="stringliteral">&quot;Enter the string : &quot;</span>);</div>
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>&#160; n = 0;</div>
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>&#160; <span class="keywordflow">while</span> ((buff[n++] = getchar()) != <span class="charliteral">&#39;\n&#39;</span>)</div>
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>&#160; {</div>
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>&#160; ;</div>
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>&#160; }</div>
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>&#160; write(sockfd, buff, <span class="keyword">sizeof</span>(buff));</div>
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>&#160; bzero(buff, <span class="keyword">sizeof</span>(buff));</div>
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>&#160; read(sockfd, buff, <span class="keyword">sizeof</span>(buff));</div>
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>&#160; printf(<span class="stringliteral">&quot;From Server : %s&quot;</span>, buff);</div>
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>&#160; <span class="keywordflow">if</span> ((strncmp(buff, <span class="stringliteral">&quot;exit&quot;</span>, 4)) == 0)</div>
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>&#160; {</div>
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>&#160; printf(<span class="stringliteral">&quot;Client Exit...\n&quot;</span>);</div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>&#160; <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>&#160; }</div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>&#160; }</div>
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>&#160;}</div>
</div><!-- fragment -->
</div>
</div>
</div><!-- contents -->
</div><!-- doc-content -->
<div class="ttc" id="aselection__sort_8c_html_ac0f2228420376f4db7e1274f2b41667c"><div class="ttname"><a href="../../df/d83/selection__sort_8c.html#ac0f2228420376f4db7e1274f2b41667c">main</a></div><div class="ttdeci">int main(int argc, const char *argv[])</div><div class="ttdoc">Driver Code.</div><div class="ttdef"><b>Definition:</b> selection_sort.c:69</div></div>
<div class="ttc" id="aproblem__23_2sol1_8c_html_ac5d600bf3077f4188afc4c5cd2c40eaf"><div class="ttname"><a href="../../d7/ddb/problem__23_2sol1_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf">get_next_abundant</a></div><div class="ttdeci">unsigned long get_next_abundant(unsigned long N)</div><div class="ttdoc">Find the next abundant number after N and not including N.</div><div class="ttdef"><b>Definition:</b> sol1.c:55</div></div>
<div class="ttc" id="aproblem__10_2sol1_8c_html_acc871ab6bfead702e983a7f9c412915f"><div class="ttname"><a href="../../d0/d6d/problem__10_2sol1_8c.html#acc871ab6bfead702e983a7f9c412915f">is_prime</a></div><div class="ttdeci">char is_prime(unsigned long n)</div><div class="ttdoc">Function to check if a number is prime.</div><div class="ttdef"><b>Definition:</b> sol1.c:11</div></div>
<div class="ttc" id="aproblem__1_2sol1_8c_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../da/d35/problem__1_2sol1_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> sol1.c:12</div></div>
<div class="ttc" id="agroup__sorting_html_ga4b9708d87be7a409eff20e5e7e8b43c8"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#ga4b9708d87be7a409eff20e5e7e8b43c8">swap</a></div><div class="ttdeci">void swap(int *a, int *b)</div><div class="ttdoc">Swap two integer variables.</div><div class="ttdef"><b>Definition:</b> merge_sort.c:17</div></div>
<div class="ttc" id="astruct_l_html"><div class="ttname"><a href="../../df/db3/struct_l.html">L</a></div><div class="ttdef"><b>Definition:</b> list.h:8</div></div>
<div class="ttc" id="ajump__search_8c_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d6/d7b/jump__search_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> jump_search.c:81</div></div>
<div class="ttc" id="amerge__sort_8c_html_a840291bc02cba5474a4cb46a9b9566fe"><div class="ttname"><a href="../../d2/d83/merge__sort_8c.html#a840291bc02cba5474a4cb46a9b9566fe">main</a></div><div class="ttdeci">int main(void)</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> merge_sort.c:101</div></div>
<div class="ttc" id="aproblem__4_2sol_8c_html_adf9bea8d35848959bde5b3f277edf0c4"><div class="ttname"><a href="../../d0/d6c/problem__4_2sol_8c.html#adf9bea8d35848959bde5b3f277edf0c4">is_palindromic</a></div><div class="ttdeci">int is_palindromic(unsigned int n)</div><div class="ttdoc">Check if number is palindromic.</div><div class="ttdef"><b>Definition:</b> sol.c:12</div></div>
<div class="ttc" id="aproblem__401_2sol1_8c_html_a236548478af932f1115a71f601a68788"><div class="ttname"><a href="../../d4/d83/problem__401_2sol1_8c.html#a236548478af932f1115a71f601a68788">sigma2</a></div><div class="ttdeci">uint64_t sigma2(uint64_t N)</div><div class="ttdoc">compute sum of squares of all integer factors of a number</div><div class="ttdef"><b>Definition:</b> sol1.c:93</div></div>
<div class="ttc" id="astructsudoku_html_a0f01e2782e82306e6fab9a8578006f56"><div class="ttname"><a href="../../dc/d18/structsudoku.html#a0f01e2782e82306e6fab9a8578006f56">sudoku::N2</a></div><div class="ttdeci">uint8_t N2</div><div class="ttdoc">block of elements</div><div class="ttdef"><b>Definition:</b> sudoku_solver.c:36</div></div>
<div class="ttc" id="ainsertion__sort_8c_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../db/ddf/insertion__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test function.</div><div class="ttdef"><b>Definition:</b> insertion_sort.c:36</div></div>
<div class="ttc" id="aproblem__401_2sol1_8c_html_a7380e14d595d560007b02ce516b6b215"><div class="ttname"><a href="../../d4/d83/problem__401_2sol1_8c.html#a7380e14d595d560007b02ce516b6b215">get_divisors</a></div><div class="ttdeci">uint64_t get_divisors(uint64_t N, uint64_t *D)</div><div class="ttdoc">Get all integer divisors of a number.</div><div class="ttdef"><b>Definition:</b> sol1.c:47</div></div>
<div class="ttc" id="aqr__eigen__values_8c_html_a002b2f4894492820fe708b1b7e7c5e70"><div class="ttname"><a href="../../d7/d50/qr__eigen__values_8c.html#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a></div><div class="ttdeci">#define EPSILON</div><div class="ttdoc">accuracy tolerance limit</div><div class="ttdef"><b>Definition:</b> qr_eigen_values.c:20</div></div>
<div class="ttc" id="aproblem__26_2sol1_8c_html_ac70138609ef6aa6fabca57aca8681e83"><div class="ttname"><a href="../../d1/df9/problem__26_2sol1_8c.html#ac70138609ef6aa6fabca57aca8681e83">compare</a></div><div class="ttdeci">int compare(const void *a, const void *b)</div><div class="ttdoc">comparison function for use with internal qsort algorithm</div><div class="ttdef"><b>Definition:</b> sol1.c:19</div></div>
<div class="ttc" id="ajump__search_8c_html_aff36d719e6fca6aea4377a089580c603"><div class="ttname"><a href="../../d6/d7b/jump__search_8c.html#aff36d719e6fca6aea4377a089580c603">jump_search</a></div><div class="ttdeci">int jump_search(const int *arr, int x, size_t n)</div><div class="ttdoc">Implement Jump-search algorithm.</div><div class="ttdef"><b>Definition:</b> jump_search.c:24</div></div>
<div class="ttc" id="aproblem__22_2sol1_8c_html_a5bc3659aa0949ea33118c95b1dee5f63"><div class="ttname"><a href="../../dd/d8b/problem__22_2sol1_8c.html#a5bc3659aa0949ea33118c95b1dee5f63">shell_sort</a></div><div class="ttdeci">void shell_sort(char data[][MAX_NAME_LEN], int LEN)</div><div class="ttdoc">Alphabetical sorting using 'shell sort' algorithm.</div><div class="ttdef"><b>Definition:</b> sol1.c:20</div></div>
<div class="ttc" id="aproblem__8_2sol1_8c_html_a9ffc8845f17b01a353767a40a3adf7bd"><div class="ttname"><a href="../../dc/d63/problem__8_2sol1_8c.html#a9ffc8845f17b01a353767a40a3adf7bd">get_product</a></div><div class="ttdeci">long long int get_product(FILE *fp, long start_pos, int num_digits)</div><div class="ttdoc">Compute the product of two numbers in a file.</div><div class="ttdef"><b>Definition:</b> sol1.c:16</div></div>
<div class="ttc" id="aqr__eigen__values_8c_html_a3c04138a5bfe5d72780bb7e82a18e627"><div class="ttname"><a href="../../d7/d50/qr__eigen__values_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">main</a></div><div class="ttdeci">int main(int argc, char **argv)</div><div class="ttdoc">main function</div><div class="ttdef"><b>Definition:</b> qr_eigen_values.c:315</div></div>
<div class="ttc" id="aproblem__5_2sol2_8c_html_adb59595677da81f071c34f3847fdbaa6"><div class="ttname"><a href="../../d5/d3d/problem__5_2sol2_8c.html#adb59595677da81f071c34f3847fdbaa6">divisors</a></div><div class="ttdeci">static unsigned int divisors[]</div><div class="ttdoc">Hack to store divisors between 1 &amp; 20.</div><div class="ttdef"><b>Definition:</b> sol2.c:21</div></div>
<div class="ttc" id="aselection__sort_8c_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../df/d83/selection__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test function.</div><div class="ttdef"><b>Definition:</b> selection_sort.c:50</div></div>
<div class="ttc" id="astructdata_html"><div class="ttname"><a href="../../df/dea/structdata.html">data</a></div><div class="ttdef"><b>Definition:</b> prime_factoriziation.c:25</div></div>
<div class="ttc" id="amodified__binary__search_8c_html_a7df9a198e30cded6229d79bef7591f8f"><div class="ttname"><a href="../../d3/d47/modified__binary__search_8c.html#a7df9a198e30cded6229d79bef7591f8f">modifiedBinarySearch</a></div><div class="ttdeci">void modifiedBinarySearch(const int **mat, int n, int m, int x)</div><div class="ttdoc">Function to perform binary search on the mid values of row to get the desired pair of rows where the ...</div><div class="ttdef"><b>Definition:</b> modified_binary_search.c:48</div></div>
<div class="ttc" id="ajump__search_8c_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="../../d6/d7b/jump__search_8c.html#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdoc">Test implementation of the function.</div><div class="ttdef"><b>Definition:</b> jump_search.c:58</div></div>
<div class="ttc" id="abubble__sort_8c_html_ad7ed8cc4603f500d610054680d28b971"><div class="ttname"><a href="../../dd/de4/bubble__sort_8c.html#ad7ed8cc4603f500d610054680d28b971">display</a></div><div class="ttdeci">void display(const int *arr, int n)</div><div class="ttdoc">Display elements of array.</div><div class="ttdef"><b>Definition:</b> bubble_sort.c:17</div></div>
<div class="ttc" id="aproblem__23_2sol2_8c_html_a1aca7f530f82b27100262adba9e7556b"><div class="ttname"><a href="../../d4/dbd/problem__23_2sol2_8c.html#a1aca7f530f82b27100262adba9e7556b">get_perfect_number</a></div><div class="ttdeci">char get_perfect_number(unsigned long N)</div><div class="ttdef"><b>Definition:</b> sol2.c:31</div></div>
<div class="ttc" id="aproblem__5_2sol3_8c_html_ae9606f1867e9921867d6572f51377b4c"><div class="ttname"><a href="../../d5/d7c/problem__5_2sol3_8c.html#ae9606f1867e9921867d6572f51377b4c">lcm</a></div><div class="ttdeci">unsigned long lcm(unsigned long a, unsigned long b)</div><div class="ttdoc">Compute Least Common Multiple (LCM) of two numbers.</div><div class="ttdef"><b>Definition:</b> sol3.c:41</div></div>
<div class="ttc" id="aproblem__22_2sol1_8c_html_ae359b8a4656b164c91ef91a084c15c9d"><div class="ttname"><a href="../../dd/d8b/problem__22_2sol1_8c.html#ae359b8a4656b164c91ef91a084c15c9d">lazy_sort</a></div><div class="ttdeci">void lazy_sort(char data[][MAX_NAME_LEN], int LEN)</div><div class="ttdoc">Alphabetical sorting using 'lazy sort' algorithm.</div><div class="ttdef"><b>Definition:</b> sol1.c:48</div></div>
<div class="ttc" id="aso1_8c_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d0/d7f/so1_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> so1.c:17</div></div>
<div class="ttc" id="aproblem__4_2sol_8c_html_a840291bc02cba5474a4cb46a9b9566fe"><div class="ttname"><a href="../../d0/d6c/problem__4_2sol_8c.html#a840291bc02cba5474a4cb46a9b9566fe">main</a></div><div class="ttdeci">int main(void)</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> sol.c:25</div></div>
<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdoc">Node, the basic data structure in the tree.</div><div class="ttdef"><b>Definition:</b> binary_search_tree.c:15</div></div>
<div class="ttc" id="aproblem__22_2sol1_8c_html_afd709f201d7643c3909621f620ea648a"><div class="ttname"><a href="../../dd/d8b/problem__22_2sol1_8c.html#afd709f201d7643c3909621f620ea648a">MAX_NAME_LEN</a></div><div class="ttdeci">#define MAX_NAME_LEN</div><div class="ttdoc">Maximum length of each name.</div><div class="ttdef"><b>Definition:</b> sol1.c:15</div></div>
<div class="ttc" id="aproblem__5_2sol1_8c_html_a24b470eef1ce1da4401c03ae250f93e3"><div class="ttname"><a href="../../dc/d32/problem__5_2sol1_8c.html#a24b470eef1ce1da4401c03ae250f93e3">check_number</a></div><div class="ttdeci">static char check_number(unsigned long long n)</div><div class="ttdoc">Pretty naive implementation.</div><div class="ttdef"><b>Definition:</b> sol1.c:18</div></div>
<div class="ttc" id="ajump__search_8c_html_a8195a86b6d75b9a3939505e8bb50021e"><div class="ttname"><a href="../../d6/d7b/jump__search_8c.html#a8195a86b6d75b9a3939505e8bb50021e">min</a></div><div class="ttdeci">#define min(X, Y)</div><div class="ttdoc">Macro to return the minimum of two values.</div><div class="ttdef"><b>Definition:</b> jump_search.c:13</div></div>
<div class="ttc" id="agroup__sorting_html_ga2fb01e00dedb437a42010f6309e7eba8"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#ga2fb01e00dedb437a42010f6309e7eba8">bead_sort</a></div><div class="ttdeci">void bead_sort(int *a, size_t len)</div><div class="ttdoc">This is where the sorting of the array takes place.</div><div class="ttdef"><b>Definition:</b> bead_sort.c:37</div></div>
<div class="ttc" id="arealtime__stats_8c_html_a63ddcdaab24f722f0963fa2fbe0ae628"><div class="ttname"><a href="../../dc/d47/realtime__stats_8c.html#a63ddcdaab24f722f0963fa2fbe0ae628">stats_computer1</a></div><div class="ttdeci">void stats_computer1(float x, float *mean, float *variance, float *std)</div><div class="ttdoc">continuous mean and variance computance using first value as an approximation for the mean.</div><div class="ttdef"><b>Definition:</b> realtime_stats.c:24</div></div>
<div class="ttc" id="aproblem__401_2sol1_8c_html_ade1bdf2529e3c58f53bfb4d844f3a9d3"><div class="ttname"><a href="../../d4/d83/problem__401_2sol1_8c.html#ade1bdf2529e3c58f53bfb4d844f3a9d3">MOD_LIMIT</a></div><div class="ttdeci">#define MOD_LIMIT</div><div class="ttdoc">modulo limit</div><div class="ttdef"><b>Definition:</b> sol1.c:17</div></div>
<div class="ttc" id="aqr__eigen__values_8c_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="../../d7/d50/qr__eigen__values_8c.html#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdoc">test function to compute eigen values of a 2x2 matrix</div><div class="ttdef"><b>Definition:</b> qr_eigen_values.c:271</div></div>
<div class="ttc" id="aproblem__20_2sol1_8c_html_a54a02c4b963fdb16f24959e0137763f1"><div class="ttname"><a href="../../db/d80/problem__20_2sol1_8c.html#a54a02c4b963fdb16f24959e0137763f1">remove_digits</a></div><div class="ttdeci">char remove_digits(big_int *digit, int N)</div><div class="ttdoc">Function to remove digits preceeding the current digit.</div><div class="ttdef"><b>Definition:</b> sol1.c:76</div></div>
<div class="ttc" id="aproblem__1_2sol3_8c_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../da/d56/problem__1_2sol3_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> sol3.c:14</div></div>
<div class="ttc" id="astructsudoku_html_a160365012280c3e10f1b31e914e8f129"><div class="ttname"><a href="../../dc/d18/structsudoku.html#a160365012280c3e10f1b31e914e8f129">sudoku::N</a></div><div class="ttdeci">uint8_t N</div><div class="ttdoc">number of elements</div><div class="ttdef"><b>Definition:</b> sudoku_solver.c:35</div></div>
<div class="ttc" id="astruct__big__int_html_a273ee73fd755f2a99512cca5f0e09008"><div class="ttname"><a href="../../dc/d77/struct__big__int.html#a273ee73fd755f2a99512cca5f0e09008">_big_int::value</a></div><div class="ttdeci">char value</div><div class="ttdoc">tens place (single digit)</div><div class="ttdef"><b>Definition:</b> sol1.c:19</div></div>
<div class="ttc" id="aqr__decompose_8h_html_a45c7640d9d22c89c11beb1f567843c56"><div class="ttname"><a href="../../d4/d68/qr__decompose_8h.html#a45c7640d9d22c89c11beb1f567843c56">qr_decompose</a></div><div class="ttdeci">void qr_decompose(double **A, double **Q, double **R, int M, int N)</div><div class="ttdoc">Decompose matrix using Gram-Schmidt process.</div><div class="ttdef"><b>Definition:</b> qr_decompose.h:142</div></div>
<div class="ttc" id="aproblem__13_2sol1_8c_html_ad51742ca5a5c99e860bdf30299163bf2"><div class="ttname"><a href="../../db/d01/problem__13_2sol1_8c.html#ad51742ca5a5c99e860bdf30299163bf2">add_numbers</a></div><div class="ttdeci">int add_numbers(uint8_t *a, uint8_t *b, uint8_t N)</div><div class="ttdoc">Function to add arbitrary length decimal integers stored in an array.</div><div class="ttdef"><b>Definition:</b> sol1.c:48</div></div>
<div class="ttc" id="aproblem__19_2sol1_8c_html_ab7f9ad087f124b8e0615aa535b4c8a75"><div class="ttname"><a href="../../dd/df0/problem__19_2sol1_8c.html#ab7f9ad087f124b8e0615aa535b4c8a75">get_month_days</a></div><div class="ttdeci">char get_month_days(short month)</div><div class="ttdoc">Function to get the number of days in a month.</div><div class="ttdef"><b>Definition:</b> sol1.c:15</div></div>
<div class="ttc" id="astructnode_html_a2d890bb9f6af0ffd73fe79b21124c2a2"><div class="ttname"><a href="../../d5/da1/structnode.html#a2d890bb9f6af0ffd73fe79b21124c2a2">node::data</a></div><div class="ttdeci">int data</div><div class="ttdoc">data of the node</div><div class="ttdef"><b>Definition:</b> binary_search_tree.c:18</div></div>
<div class="ttc" id="aproblem__22_2sol1_8c_html_a6cb9b08aacb61416795ee78bfceacd38"><div class="ttname"><a href="../../dd/d8b/problem__22_2sol1_8c.html#a6cb9b08aacb61416795ee78bfceacd38">MAX_NAMES</a></div><div class="ttdeci">#define MAX_NAMES</div><div class="ttdoc">Maximum number of names to store.</div><div class="ttdef"><b>Definition:</b> sol1.c:14</div></div>
<div class="ttc" id="aproblem__401_2sol1_8c_html_a4441a6d27134cf3aed05727800d99456"><div class="ttname"><a href="../../d4/d83/problem__401_2sol1_8c.html#a4441a6d27134cf3aed05727800d99456">is_in</a></div><div class="ttdeci">char is_in(uint64_t N, uint64_t *D, uint64_t L)</div><div class="ttdoc">Check if a number is present in given array.</div><div class="ttdef"><b>Definition:</b> sol1.c:28</div></div>
<div class="ttc" id="astruct_node_html_a87c003c9f600e3fc58e6e90835f0b605"><div class="ttname"><a href="../../db/d8b/struct_node.html#a87c003c9f600e3fc58e6e90835f0b605">Node::data</a></div><div class="ttdeci">int data</div><div class="ttdoc">stores the number</div><div class="ttdef"><b>Definition:</b> threaded_binary_trees.c:28</div></div>
<div class="ttc" id="aproblem__23_2sol2_8c_html_ac5d600bf3077f4188afc4c5cd2c40eaf"><div class="ttname"><a href="../../d4/dbd/problem__23_2sol2_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf">get_next_abundant</a></div><div class="ttdeci">unsigned long get_next_abundant(unsigned long N)</div><div class="ttdoc">Find the next abundant number after N and not including N.</div><div class="ttdef"><b>Definition:</b> sol2.c:70</div></div>
<div class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdoc">Node, the basic data structure of the tree.</div><div class="ttdef"><b>Definition:</b> threaded_binary_trees.c:27</div></div>
<div class="ttc" id="aqr__eigen__values_8c_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="../../d7/d50/qr__eigen__values_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdoc">test function to compute eigen values of a 2x2 matrix</div><div class="ttdef"><b>Definition:</b> qr_eigen_values.c:224</div></div>
<div class="ttc" id="aselection__sort_8c_html_ad126fa7239be97373c96861adc70b1d3"><div class="ttname"><a href="../../df/d83/selection__sort_8c.html#ad126fa7239be97373c96861adc70b1d3">swap</a></div><div class="ttdeci">void swap(int *first, int *second)</div><div class="ttdoc">Swapped two numbers using pointer.</div><div class="ttdef"><b>Definition:</b> selection_sort.c:16</div></div>
<div class="ttc" id="arealtime__stats_8c_html_aa54c915581fcc495489175a4386d59fd"><div class="ttname"><a href="../../dc/d47/realtime__stats_8c.html#aa54c915581fcc495489175a4386d59fd">test_function</a></div><div class="ttdeci">void test_function(const float *test_data, const int number_of_samples)</div><div class="ttdoc">Test the algorithm implementation.</div><div class="ttdef"><b>Definition:</b> realtime_stats.c:92</div></div>
<div class="ttc" id="aproblem__25_2sol1_8c_html_a001791a21d538b8b9176287ae60d9b61"><div class="ttname"><a href="../../d8/d32/problem__25_2sol1_8c.html#a001791a21d538b8b9176287ae60d9b61">MAX_DIGITS</a></div><div class="ttdeci">#define MAX_DIGITS</div><div class="ttdoc">maximum number of digits</div><div class="ttdef"><b>Definition:</b> sol1.c:13</div></div>
<div class="ttc" id="aproblem__10_2sol1_8c_html_ae3d987cb2ad0ddb0c3caa4c2506a20e5"><div class="ttname"><a href="../../d0/d6d/problem__10_2sol1_8c.html#ae3d987cb2ad0ddb0c3caa4c2506a20e5">sum_of_primes</a></div><div class="ttdeci">unsigned long long sum_of_primes(unsigned long N)</div><div class="ttdoc">Computes sum of prime numbers less than N.</div><div class="ttdef"><b>Definition:</b> sol1.c:21</div></div>
<div class="ttc" id="abubble__sort__recursion_8c_html_aa8989f6c9bfd1f040854fa18b180114f"><div class="ttname"><a href="../../d5/d38/bubble__sort__recursion_8c.html#aa8989f6c9bfd1f040854fa18b180114f">bubbleSort</a></div><div class="ttdeci">void bubbleSort(int *arr, int size)</div><div class="ttdoc">Bubble sort algorithm implements using recursion.</div><div class="ttdef"><b>Definition:</b> bubble_sort_recursion.c:29</div></div>
<div class="ttc" id="agroup__sorting_html_ga8dc3ec66cb3350313fdb34bfd1674729"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#ga8dc3ec66cb3350313fdb34bfd1674729">merge</a></div><div class="ttdeci">void merge(int *a, int l, int r, int n)</div><div class="ttdoc">Perform merge of segments.</div><div class="ttdef"><b>Definition:</b> merge_sort.c:33</div></div>
<div class="ttc" id="aclient_8c_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d93/client_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Driver code.</div><div class="ttdef"><b>Definition:</b> client.c:70</div></div>
<div class="ttc" id="aqr__decompose_8h_html"><div class="ttname"><a href="../../d4/d68/qr__decompose_8h.html">qr_decompose.h</a></div><div class="ttdoc">Library functions to compute QR decomposition of a given matrix.</div></div>
<div class="ttc" id="abubble__sort_8c_html_ad126fa7239be97373c96861adc70b1d3"><div class="ttname"><a href="../../dd/de4/bubble__sort_8c.html#ad126fa7239be97373c96861adc70b1d3">swap</a></div><div class="ttdeci">void swap(int *first, int *second)</div><div class="ttdoc">Swap two values by using pointer.</div><div class="ttdef"><b>Definition:</b> bubble_sort.c:31</div></div>
<div class="ttc" id="astruct__big__int_html_a187538b984c86d7cfdb13e297e7f3564"><div class="ttname"><a href="../../dc/d77/struct__big__int.html#a187538b984c86d7cfdb13e297e7f3564">_big_int::next_digit</a></div><div class="ttdeci">struct _big_int * next_digit</div><div class="ttdoc">hundreds place</div><div class="ttdef"><b>Definition:</b> sol1.c:20</div></div>
<div class="ttc" id="aproblem__25_2sol1_8c_html_a2b90df6bfbf0d18cd9a19c1a71453783"><div class="ttname"><a href="../../d8/d32/problem__25_2sol1_8c.html#a2b90df6bfbf0d18cd9a19c1a71453783">get_digits</a></div><div class="ttdeci">unsigned int get_digits(unsigned char *number)</div><div class="ttdoc">Get number of digits in a large number.</div><div class="ttdef"><b>Definition:</b> sol1.c:75</div></div>
<div class="ttc" id="ainsertion__sort_8c_html_a0d6c227641a5e0dae580b3a18df241fb"><div class="ttname"><a href="../../db/ddf/insertion__sort_8c.html#a0d6c227641a5e0dae580b3a18df241fb">insertionSort</a></div><div class="ttdeci">void insertionSort(int *arr, int size)</div><div class="ttdoc">Insertion sort algorithm implements.</div><div class="ttdef"><b>Definition:</b> insertion_sort.c:16</div></div>
<div class="ttc" id="aproblem__23_2sol1_8c_html_a4f128410e6582fe26488e2316cc96e17"><div class="ttname"><a href="../../d7/ddb/problem__23_2sol1_8c.html#a4f128410e6582fe26488e2316cc96e17">is_abundant</a></div><div class="ttdeci">unsigned long is_abundant(unsigned long N)</div><div class="ttdoc">Is the given number an abundant number (1) or not (0)</div><div class="ttdef"><b>Definition:</b> sol1.c:47</div></div>
<div class="ttc" id="aqr__decompose_8h_html_a90562ce8c3707401e9c5809dece68d6a"><div class="ttname"><a href="../../d4/d68/qr__decompose_8h.html#a90562ce8c3707401e9c5809dece68d6a">print_matrix</a></div><div class="ttdeci">void print_matrix(double **A, int M, int N)</div><div class="ttdoc">function to display matrix on stdout</div><div class="ttdef"><b>Definition:</b> qr_decompose.h:22</div></div>
<div class="ttc" id="aproblem__13_2sol1_8c_html_a248adc917818cc6666d8bc679a660319"><div class="ttname"><a href="../../db/d01/problem__13_2sol1_8c.html#a248adc917818cc6666d8bc679a660319">print_number</a></div><div class="ttdeci">int print_number(uint8_t *number, uint8_t N, int8_t num_digits_to_print)</div><div class="ttdoc">Function to print a long number.</div><div class="ttdef"><b>Definition:</b> sol1.c:92</div></div>
<div class="ttc" id="abubble__sort_8c_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="../../dd/de4/bubble__sort_8c.html#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdoc">Test function.</div><div class="ttdef"><b>Definition:</b> bubble_sort.c:70</div></div>
<div class="ttc" id="aproblem__21_2sol1_8c_html_aacf4b7e708651d2164e86958f2c29c93"><div class="ttname"><a href="../../df/d1a/problem__21_2sol1_8c.html#aacf4b7e708651d2164e86958f2c29c93">sum_of_divisors</a></div><div class="ttdeci">unsigned long sum_of_divisors(unsigned int N)</div><div class="ttdoc">function to return the sum of proper divisors of N</div><div class="ttdef"><b>Definition:</b> sol1.c:13</div></div>
<div class="ttc" id="amodified__binary__search_8c_html_a0cfaa56aacf960e4628a0fb27add8890"><div class="ttname"><a href="../../d3/d47/modified__binary__search_8c.html#a0cfaa56aacf960e4628a0fb27add8890">binarySearch</a></div><div class="ttdeci">int binarySearch(const int **mat, int i, int j_low, int j_high, int x)</div><div class="ttdoc">This function does Binary search for x in i-th row from j_low to j_high.</div><div class="ttdef"><b>Definition:</b> modified_binary_search.c:18</div></div>
<div class="ttc" id="aproblem__401_2sol1_8c_html_aaf964739be92adc2f500e7da11e3f6be"><div class="ttname"><a href="../../d4/d83/problem__401_2sol1_8c.html#aaf964739be92adc2f500e7da11e3f6be">sigma</a></div><div class="ttdeci">uint64_t sigma(uint64_t N)</div><div class="ttdoc">sum of squares of factors of numbers from 1 thru N</div><div class="ttdef"><b>Definition:</b> sol1.c:114</div></div>
<div class="ttc" id="aproblem__3_2sol1_8c_html_aa0f4796aa2e89c327f827bd55f5cb305"><div class="ttname"><a href="../../d7/dd3/problem__3_2sol1_8c.html#aa0f4796aa2e89c327f827bd55f5cb305">isprime</a></div><div class="ttdeci">char isprime(int no)</div><div class="ttdoc">Check if the given number is prime.</div><div class="ttdef"><b>Definition:</b> sol1.c:15</div></div>
<div class="ttc" id="aproblem__20_2sol1_8c_html_a62cbbd106aad52daadb9403a07d0da32"><div class="ttname"><a href="../../db/d80/problem__20_2sol1_8c.html#a62cbbd106aad52daadb9403a07d0da32">big_int</a></div><div class="ttdeci">struct _big_int big_int</div><div class="ttdoc">store arbitratily large integer values as a linked list of digits.</div></div>
<div class="ttc" id="aqr__decomposition_8c_html_a840291bc02cba5474a4cb46a9b9566fe"><div class="ttname"><a href="../../d5/d23/qr__decomposition_8c.html#a840291bc02cba5474a4cb46a9b9566fe">main</a></div><div class="ttdeci">int main(void)</div><div class="ttdoc">main function</div><div class="ttdef"><b>Definition:</b> qr_decomposition.c:18</div></div>
<div class="ttc" id="aproblem__401_2sol1_8c_html_a7a9a231e30b47bc0345749c8bd1e5077"><div class="ttname"><a href="../../d4/d83/problem__401_2sol1_8c.html#a7a9a231e30b47bc0345749c8bd1e5077">MAX_LENGTH</a></div><div class="ttdeci">#define MAX_LENGTH</div><div class="ttdoc">chunk size of array allocation</div><div class="ttdef"><b>Definition:</b> sol1.c:18</div></div>
<div class="ttc" id="arealtime__stats_8c_html_a3c04138a5bfe5d72780bb7e82a18e627"><div class="ttname"><a href="../../dc/d47/realtime__stats_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">main</a></div><div class="ttdeci">int main(int argc, char **argv)</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> realtime_stats.c:128</div></div>
<div class="ttc" id="abubble__sort__recursion_8c_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d5/d38/bubble__sort__recursion_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Driver Code.</div><div class="ttdef"><b>Definition:</b> bubble_sort_recursion.c:72</div></div>
<div class="ttc" id="aqr__eigen__values_8c_html_a741477692f001a805b0fea942c9dc2b9"><div class="ttname"><a href="../../d7/d50/qr__eigen__values_8c.html#a741477692f001a805b0fea942c9dc2b9">mat_mul</a></div><div class="ttdeci">double ** mat_mul(double **A, double **B, double **OUT, int R1, int C1, int R2, int C2)</div><div class="ttdoc">Perform multiplication of two matrices.</div><div class="ttdef"><b>Definition:</b> qr_eigen_values.c:59</div></div>
<div class="ttc" id="aproblem__26_2sol1_8c_html_aabf4f709c8199e41cf279c77112345fe"><div class="ttname"><a href="../../d1/df9/problem__26_2sol1_8c.html#aabf4f709c8199e41cf279c77112345fe">MAX_LEN</a></div><div class="ttdeci">#define MAX_LEN</div><div class="ttdoc">length of resulting recurring fraction number</div><div class="ttdef"><b>Definition:</b> sol1.c:15</div></div>
<div class="ttc" id="agroup__sorting_html_gad7ed8cc4603f500d610054680d28b971"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#gad7ed8cc4603f500d610054680d28b971">display</a></div><div class="ttdeci">void display(const int *arr, int n)</div><div class="ttdoc">Displays the array, passed to this method.</div><div class="ttdef"><b>Definition:</b> bead_sort.c:23</div></div>
<div class="ttc" id="abinary__search_8c_html_a840291bc02cba5474a4cb46a9b9566fe"><div class="ttname"><a href="../../df/d3b/binary__search_8c.html#a840291bc02cba5474a4cb46a9b9566fe">main</a></div><div class="ttdeci">int main(void)</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> binary_search.c:105</div></div>
<div class="ttc" id="aclient_8c_html_a392fb874e547e582e9c66a08a1f23326"><div class="ttname"><a href="../../dd/d93/client_8c.html#a392fb874e547e582e9c66a08a1f23326">MAX</a></div><div class="ttdeci">#define MAX</div><div class="ttdoc">max.</div><div class="ttdef"><b>Definition:</b> client.c:28</div></div>
<div class="ttc" id="agroup__kohonen__2d_html_gac6afabdc09a49a433ee19d8a9486056d"><div class="ttname"><a href="../../d1/d6b/group__kohonen__2d.html#gac6afabdc09a49a433ee19d8a9486056d">min</a></div><div class="ttdeci">#define min(a, b)</div><div class="ttdoc">shorthand for minimum value</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:43</div></div>
<div class="ttc" id="astruct__big__int_html_ad8405989a924410942b39ec0e9fef30b"><div class="ttname"><a href="../../dc/d77/struct__big__int.html#ad8405989a924410942b39ec0e9fef30b">_big_int::prev_digit</a></div><div class="ttdeci">struct _big_int * prev_digit</div><div class="ttdoc">units place</div><div class="ttdef"><b>Definition:</b> sol1.c:21</div></div>
<div class="ttc" id="astruct__big__int_html"><div class="ttname"><a href="../../dc/d77/struct__big__int.html">_big_int</a></div><div class="ttdoc">store arbitratily large integer values as a linked list of digits.</div><div class="ttdef"><b>Definition:</b> sol1.c:18</div></div>
<div class="ttc" id="aproblem__1_2sol2_8c_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d2/dae/problem__1_2sol2_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> sol2.c:15</div></div>
<div class="ttc" id="aproblem__12_2sol1_8c_html_aa6ce6271f6156e219f9b290717f5a222"><div class="ttname"><a href="../../d7/d1f/problem__12_2sol1_8c.html#aa6ce6271f6156e219f9b290717f5a222">count_divisors</a></div><div class="ttdeci">long count_divisors(long long n)</div><div class="ttdoc">Get number of divisors of a given number.</div><div class="ttdef"><b>Definition:</b> sol1.c:19</div></div>
<div class="ttc" id="agroup__kohonen__2d_html_gaffe776513b24d84b39af8ab0930fef7f"><div class="ttname"><a href="../../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a></div><div class="ttdeci">#define max(a, b)</div><div class="ttdoc">shorthand for maximum value</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:39</div></div>
<div class="ttc" id="aproblem__26_2sol1_8c_html_a619eec3220cebd7c5e455edbb14e9b12"><div class="ttname"><a href="../../d1/df9/problem__26_2sol1_8c.html#a619eec3220cebd7c5e455edbb14e9b12">MAX_DENO</a></div><div class="ttdeci">#define MAX_DENO</div><div class="ttdoc">limit of unit fractions</div><div class="ttdef"><b>Definition:</b> sol1.c:14</div></div>
<div class="ttc" id="arealtime__stats_8c_html_a34be233a9200ee2065f6b7b27e2d9a96"><div class="ttname"><a href="../../dc/d47/realtime__stats_8c.html#a34be233a9200ee2065f6b7b27e2d9a96">stats_computer2</a></div><div class="ttdeci">void stats_computer2(float x, float *mean, float *variance, float *std)</div><div class="ttdoc">continuous mean and variance computance using Welford's algorithm (very accurate)</div><div class="ttdef"><b>Definition:</b> realtime_stats.c:61</div></div>
<div class="ttc" id="aproblem__23_2sol2_8c_html_a34f4ad85151e3a43368ae67f42347f56"><div class="ttname"><a href="../../d4/dbd/problem__23_2sol2_8c.html#a34f4ad85151e3a43368ae67f42347f56">is_abundant</a></div><div class="ttdeci">char is_abundant(unsigned long N)</div><div class="ttdoc">Is the given number an abundant number (1) or not (0)</div><div class="ttdef"><b>Definition:</b> sol2.c:59</div></div>
<div class="ttc" id="alu__decompose_8c_html_a0789beb8d3396582d77b7aedf5e5554a"><div class="ttname"><a href="../../dc/d2e/lu__decompose_8c.html#a0789beb8d3396582d77b7aedf5e5554a">display</a></div><div class="ttdeci">void display(double **A, int N)</div><div class="ttdoc">Function to display square matrix.</div><div class="ttdef"><b>Definition:</b> lu_decompose.c:66</div></div>
<div class="ttc" id="aproblem__5_2sol2_8c_html_aa7cfa5a28d00d93ec48fab9c3fd5812f"><div class="ttname"><a href="../../d5/d3d/problem__5_2sol2_8c.html#aa7cfa5a28d00d93ec48fab9c3fd5812f">check_number</a></div><div class="ttdeci">static int check_number(unsigned long long n)</div><div class="ttdoc">Checks if a given number is devisable by every number between 1 and 20.</div><div class="ttdef"><b>Definition:</b> sol2.c:30</div></div>
<div class="ttc" id="aproblem__15_2sol1_8c_html_a4650d1d3897633d84253f93433f601d6"><div class="ttname"><a href="../../d7/d91/problem__15_2sol1_8c.html#a4650d1d3897633d84253f93433f601d6">number_of_paths</a></div><div class="ttdeci">unsigned long long number_of_paths(int N)</div><div class="ttdoc">At every node, there are 2 possible ways to move -&gt; down or right.</div><div class="ttdef"><b>Definition:</b> sol1.c:17</div></div>
<div class="ttc" id="aproblem__23_2sol2_8c_html_a3ab61b5a1c4f2288625d160aa0ea8478"><div class="ttname"><a href="../../d4/dbd/problem__23_2sol2_8c.html#a3ab61b5a1c4f2288625d160aa0ea8478">is_sum_of_abundant</a></div><div class="ttdeci">char is_sum_of_abundant(unsigned long N)</div><div class="ttdoc">check if a given number can be represented as a sum of two abundant numbers.</div><div class="ttdef"><b>Definition:</b> sol2.c:87</div></div>
<div class="ttc" id="aproblem__13_2sol1_8c_html_ac260f58785fb20eb09bb35385a7d47f8"><div class="ttname"><a href="../../db/d01/problem__13_2sol1_8c.html#ac260f58785fb20eb09bb35385a7d47f8">get_number</a></div><div class="ttdeci">int get_number(FILE *fp, char *buffer, uint8_t *out_int)</div><div class="ttdoc">Function to read the number from a file and store it in array.</div><div class="ttdef"><b>Definition:</b> sol1.c:16</div></div>
<div class="ttc" id="agroup__sorting_html_gaeccaf61ff47279384d1dba8d869d5c2f"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#gaeccaf61ff47279384d1dba8d869d5c2f">show_data</a></div><div class="ttdeci">void show_data(int *arr, long len)</div><div class="ttdoc">Helper function to print array values.</div><div class="ttdef"><b>Definition:</b> shell_sort2.c:16</div></div>
<div class="ttc" id="abubble__sort_8c_html_ac0f2228420376f4db7e1274f2b41667c"><div class="ttname"><a href="../../dd/de4/bubble__sort_8c.html#ac0f2228420376f4db7e1274f2b41667c">main</a></div><div class="ttdeci">int main(int argc, const char *argv[])</div><div class="ttdoc">Driver Code.</div><div class="ttdef"><b>Definition:</b> bubble_sort.c:89</div></div>
<div class="ttc" id="astructsudoku_html_a507f788b793d4d3d6f6a70415be84ded"><div class="ttname"><a href="../../dc/d18/structsudoku.html#a507f788b793d4d3d6f6a70415be84ded">sudoku::a</a></div><div class="ttdeci">uint8_t * a</div><div class="ttdoc">matrix as a flattened 1D row-major array</div><div class="ttdef"><b>Definition:</b> sudoku_solver.c:34</div></div>
<div class="ttc" id="aproblem__14_2sol1_8c_html_a81c1df5c17cb16bcc16e346fcff6fa80"><div class="ttname"><a href="../../d4/dea/problem__14_2sol1_8c.html#a81c1df5c17cb16bcc16e346fcff6fa80">collatz</a></div><div class="ttdeci">long long collatz(long long start_num)</div><div class="ttdoc">Computes the length of collatz sequence for a given starting number.</div><div class="ttdef"><b>Definition:</b> sol1.c:27</div></div>
<div class="ttc" id="abubble__sort__recursion_8c_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="../../d5/d38/bubble__sort__recursion_8c.html#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdoc">Test function.</div><div class="ttdef"><b>Definition:</b> bubble_sort_recursion.c:53</div></div>
<div class="ttc" id="abead__sort_8c_html_ac0f2228420376f4db7e1274f2b41667c"><div class="ttname"><a href="../../d2/da8/bead__sort_8c.html#ac0f2228420376f4db7e1274f2b41667c">main</a></div><div class="ttdeci">int main(int argc, const char *argv[])</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> bead_sort.c:75</div></div>
<div class="ttc" id="ashell__sort2_8c_html_a0ddf1224851353fc92bfbff6f499fa97"><div class="ttname"><a href="../../d6/ded/shell__sort2_8c.html#a0ddf1224851353fc92bfbff6f499fa97">main</a></div><div class="ttdeci">int main(int argc, char *argv[])</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> shell_sort2.c:66</div></div>
<div class="ttc" id="abinary__search_8c_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="../../df/d3b/binary__search_8c.html#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdoc">Test implementations.</div><div class="ttdef"><b>Definition:</b> binary_search.c:75</div></div>
<div class="ttc" id="asol4_8c_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d6/d1b/sol4_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> sol4.c:12</div></div>
<div class="ttc" id="abinary__search__tree_8c_html_af4aeda155dbe167f1c1cf38cb65bf324"><div class="ttname"><a href="../../da/d02/binary__search__tree_8c.html#af4aeda155dbe167f1c1cf38cb65bf324">node</a></div><div class="ttdeci">struct node node</div><div class="ttdoc">Node, the basic data structure in the tree.</div></div>
<div class="ttc" id="aproblem__5_2sol3_8c_html_a59347107cbfdf48d51108e50280e760d"><div class="ttname"><a href="../../d5/d7c/problem__5_2sol3_8c.html#a59347107cbfdf48d51108e50280e760d">gcd</a></div><div class="ttdeci">unsigned long gcd(unsigned long a, unsigned long b)</div><div class="ttdoc">Compute Greatest Common Divisor (GCD) of two numbers using Euclids algorithm.</div><div class="ttdef"><b>Definition:</b> sol3.c:18</div></div>
<div class="ttc" id="amodified__binary__search_8c_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d3/d47/modified__binary__search_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> modified_binary_search.c:97</div></div>
<div class="ttc" id="aproblem__20_2sol1_8c_html_afc373c28da6b17636528edcc97fb5f86"><div class="ttname"><a href="../../db/d80/problem__20_2sol1_8c.html#afc373c28da6b17636528edcc97fb5f86">add_digit</a></div><div class="ttdeci">big_int * add_digit(big_int *digit, char value)</div><div class="ttdoc">Function that allocates memory to add another digit at the MSB.</div><div class="ttdef"><b>Definition:</b> sol1.c:37</div></div>
<div class="ttc" id="agroup__sorting_html_gab99b8a397bdd0bf2903d66c22ba4ba43"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#gab99b8a397bdd0bf2903d66c22ba4ba43">merge_sort</a></div><div class="ttdeci">void merge_sort(int *a, int n, int l, int r)</div><div class="ttdoc">Merge sort algorithm implementation.</div><div class="ttdef"><b>Definition:</b> merge_sort.c:82</div></div>
<div class="ttc" id="aqr__eigen__values_8c_html_aee57a411f07599034f5ceb8cc7d65b40"><div class="ttname"><a href="../../d7/d50/qr__eigen__values_8c.html#aee57a411f07599034f5ceb8cc7d65b40">LIMS</a></div><div class="ttdeci">#define LIMS</div><div class="ttdoc">limit of range of matrix values</div><div class="ttdef"><b>Definition:</b> qr_eigen_values.c:19</div></div>
<div class="ttc" id="abinary__search_8c_html_a908fd6d2ad0bba33f63f8454888a0032"><div class="ttname"><a href="../../df/d3b/binary__search_8c.html#a908fd6d2ad0bba33f63f8454888a0032">binarysearch2</a></div><div class="ttdeci">int binarysearch2(const int *arr, int l, int r, int x)</div><div class="ttdoc">Iterative implementation.</div><div class="ttdef"><b>Definition:</b> binary_search.c:51</div></div>
<div class="ttc" id="aqr__eigen__values_8c_html_a0d8ed79786d17df48396b333c09d05bb"><div class="ttname"><a href="../../d7/d50/qr__eigen__values_8c.html#a0d8ed79786d17df48396b333c09d05bb">eigen_values</a></div><div class="ttdeci">double eigen_values(double **A, double *eigen_vals, int mat_size, char debug_print)</div><div class="ttdoc">Compute eigen values using iterative shifted QR decomposition algorithm as follows:</div><div class="ttdef"><b>Definition:</b> qr_eigen_values.c:106</div></div>
<div class="ttc" id="agroup__sorting_html_ga4fdb8af29a07ac8f496e49a11bf9f1bd"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#ga4fdb8af29a07ac8f496e49a11bf9f1bd">BEAD</a></div><div class="ttdeci">#define BEAD(i, j)</div><div class="ttdoc">Create easy access of elements from a 2D matrix stored in memory as a 1D array.</div><div class="ttdef"><b>Definition:</b> bead_sort.c:16</div></div>
<div class="ttc" id="agroup__sorting_html_ga5bc16eaf3ffe6a6ab66780dd445904c0"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#ga5bc16eaf3ffe6a6ab66780dd445904c0">shell_sort</a></div><div class="ttdeci">void shell_sort(int *array, long LEN)</div><div class="ttdoc">Shell sort algorithm.</div><div class="ttdef"><b>Definition:</b> shell_sort2.c:41</div></div>
<div class="ttc" id="abubble__sort__recursion_8c_html_ad126fa7239be97373c96861adc70b1d3"><div class="ttname"><a href="../../d5/d38/bubble__sort__recursion_8c.html#ad126fa7239be97373c96861adc70b1d3">swap</a></div><div class="ttdeci">void swap(int *first, int *second)</div><div class="ttdoc">Swapped two numbers using pointer.</div><div class="ttdef"><b>Definition:</b> bubble_sort_recursion.c:17</div></div>
<div class="ttc" id="aproblem__19_2sol1_8c_html_a6561b1adc8a19c092679b9874da24e2e"><div class="ttname"><a href="../../dd/df0/problem__19_2sol1_8c.html#a6561b1adc8a19c092679b9874da24e2e">is_leap_year</a></div><div class="ttdeci">char is_leap_year(short year)</div><div class="ttdoc">Check if input year is a leap year.</div><div class="ttdef"><b>Definition:</b> sol1.c:41</div></div>
<div class="ttc" id="aproblem__23_2sol1_8c_html_a1aca7f530f82b27100262adba9e7556b"><div class="ttname"><a href="../../d7/ddb/problem__23_2sol1_8c.html#a1aca7f530f82b27100262adba9e7556b">get_perfect_number</a></div><div class="ttdeci">char get_perfect_number(unsigned long N)</div><div class="ttdoc">Returns: -1 if N is deficient 1 if N is abundant 0 if N is perfect.</div><div class="ttdef"><b>Definition:</b> sol1.c:19</div></div>
<div class="ttc" id="astructtnode_html"><div class="ttname"><a href="../../d8/d7a/structtnode.html">tnode</a></div><div class="ttdef"><b>Definition:</b> multikey_quick_sort.c:205</div></div>
<div class="ttc" id="abubble__sort_8c_html_aa8989f6c9bfd1f040854fa18b180114f"><div class="ttname"><a href="../../dd/de4/bubble__sort_8c.html#aa8989f6c9bfd1f040854fa18b180114f">bubbleSort</a></div><div class="ttdeci">void bubbleSort(int *arr, int size)</div><div class="ttdoc">Bubble sort algorithm implementation.</div><div class="ttdef"><b>Definition:</b> bubble_sort.c:43</div></div>
<div class="ttc" id="aproblem__23_2sol1_8c_html_a3ab61b5a1c4f2288625d160aa0ea8478"><div class="ttname"><a href="../../d7/ddb/problem__23_2sol1_8c.html#a3ab61b5a1c4f2288625d160aa0ea8478">is_sum_of_abundant</a></div><div class="ttdeci">char is_sum_of_abundant(unsigned long N)</div><div class="ttdoc">check if a given number can be represented as a sum of two abundant numbers.</div><div class="ttdef"><b>Definition:</b> sol1.c:71</div></div>
<div class="ttc" id="aqr__eigen__values_8c_html_a7d96c5e4ae1bd6d29791bcc23a4cb2b0"><div class="ttname"><a href="../../d7/d50/qr__eigen__values_8c.html#a7d96c5e4ae1bd6d29791bcc23a4cb2b0">create_matrix</a></div><div class="ttdeci">void create_matrix(double **A, int N)</div><div class="ttdoc">create a square matrix of given size with random elements</div><div class="ttdef"><b>Definition:</b> qr_eigen_values.c:27</div></div>
<div class="ttc" id="acantor__set_8c_html_a75ee530cd7148a63249784ad3dda8fab"><div class="ttname"><a href="../../dc/d80/cantor__set_8c.html#a75ee530cd7148a63249784ad3dda8fab">print</a></div><div class="ttdeci">void print(CantorSet *head)</div><div class="ttdoc">Print sets in the current range to stdout</div><div class="ttdef"><b>Definition:</b> cantor_set.c:55</div></div>
<div class="ttc" id="aselection__sort_8c_html_aeafe7419cfceaeccaf49f22842d9a617"><div class="ttname"><a href="../../df/d83/selection__sort_8c.html#aeafe7419cfceaeccaf49f22842d9a617">selectionSort</a></div><div class="ttdeci">void selectionSort(int *arr, int size)</div><div class="ttdoc">Selection sort algorithm implements.</div><div class="ttdef"><b>Definition:</b> selection_sort.c:28</div></div>
<div class="ttc" id="aproblem__23_2sol2_8c_html_af920a16d6ef69dd604b283f427892e06"><div class="ttname"><a href="../../d4/dbd/problem__23_2sol2_8c.html#af920a16d6ef69dd604b283f427892e06">abundant_flags</a></div><div class="ttdeci">char * abundant_flags</div><div class="ttdoc">This is the global array to be used to store a flag to identify if a particular number is abundant (1...</div><div class="ttdef"><b>Definition:</b> sol2.c:24</div></div>
<div class="ttc" id="abinary__search_8c_html_a40855c608ca64048d04cff6526f0a582"><div class="ttname"><a href="../../df/d3b/binary__search_8c.html#a40855c608ca64048d04cff6526f0a582">binarysearch1</a></div><div class="ttdeci">int binarysearch1(const int *arr, int l, int r, int x)</div><div class="ttdoc">Recursive implementation.</div><div class="ttdef"><b>Definition:</b> binary_search.c:21</div></div>
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_d20ad0b8de644c123692ba5582cc7a7b.html">client_server</a></li><li class="navelem"><a class="el" href="../../dd/d93/client_8c.html">client.c</a></li>
<li class="footer">Generated by <a href="http://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.8.20 </li>
</ul>
</div>
</body>
</html>
Reference in New Issue View Git Blame Copy Permalink