<divclass="center"><iframescrolling="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>
<trclass="memdesc:ac17020a38607ab29ce18939d5194a32a"><tdclass="mdescLeft"> </td><tdclass="mdescRight">Continuous loop to send and receive over the socket. <ahref="../../dd/d93/client_8c.html#ac17020a38607ab29ce18939d5194a32a">More...</a><br/></td></tr>
<dlclass="section see"><dt>See also</dt><dd><aclass="el"href="../../d1/d20/server_8c.html"title="Server side implementation of Server-Client system.">client_server/server.c</a></dd></dl>
<divclass="ttc"id="aproblem__23_2sol1_8c_html_ac5d600bf3077f4188afc4c5cd2c40eaf"><divclass="ttname"><ahref="../../d7/ddb/problem__23_2sol1_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf">get_next_abundant</a></div><divclass="ttdeci">unsigned long get_next_abundant(unsigned long N)</div><divclass="ttdoc">Find the next abundant number after N and not including N.</div><divclass="ttdef"><b>Definition:</b> sol1.c:55</div></div>
<divclass="ttc"id="aproblem__10_2sol1_8c_html_acc871ab6bfead702e983a7f9c412915f"><divclass="ttname"><ahref="../../d0/d6d/problem__10_2sol1_8c.html#acc871ab6bfead702e983a7f9c412915f">is_prime</a></div><divclass="ttdeci">char is_prime(unsigned long n)</div><divclass="ttdoc">Function to check if a number is prime.</div><divclass="ttdef"><b>Definition:</b> sol1.c:11</div></div>
<divclass="ttc"id="agroup__sorting_html_ga4b9708d87be7a409eff20e5e7e8b43c8"><divclass="ttname"><ahref="../../d5/d4c/group__sorting.html#ga4b9708d87be7a409eff20e5e7e8b43c8">swap</a></div><divclass="ttdeci">void swap(int *a, int *b)</div><divclass="ttdoc">Swap two integer variables.</div><divclass="ttdef"><b>Definition:</b> merge_sort.c:17</div></div>
<divclass="ttc"id="aproblem__4_2sol_8c_html_adf9bea8d35848959bde5b3f277edf0c4"><divclass="ttname"><ahref="../../d0/d6c/problem__4_2sol_8c.html#adf9bea8d35848959bde5b3f277edf0c4">is_palindromic</a></div><divclass="ttdeci">int is_palindromic(unsigned int n)</div><divclass="ttdoc">Check if number is palindromic.</div><divclass="ttdef"><b>Definition:</b> sol.c:12</div></div>
<divclass="ttc"id="aproblem__401_2sol1_8c_html_a236548478af932f1115a71f601a68788"><divclass="ttname"><ahref="../../d4/d83/problem__401_2sol1_8c.html#a236548478af932f1115a71f601a68788">sigma2</a></div><divclass="ttdeci">uint64_t sigma2(uint64_t N)</div><divclass="ttdoc">compute sum of squares of all integer factors of a number</div><divclass="ttdef"><b>Definition:</b> sol1.c:93</div></div>
<divclass="ttc"id="astructsudoku_html_a0f01e2782e82306e6fab9a8578006f56"><divclass="ttname"><ahref="../../dc/d18/structsudoku.html#a0f01e2782e82306e6fab9a8578006f56">sudoku::N2</a></div><divclass="ttdeci">uint8_t N2</div><divclass="ttdoc">block of elements</div><divclass="ttdef"><b>Definition:</b> sudoku_solver.c:36</div></div>
<divclass="ttc"id="aproblem__401_2sol1_8c_html_a7380e14d595d560007b02ce516b6b215"><divclass="ttname"><ahref="../../d4/d83/problem__401_2sol1_8c.html#a7380e14d595d560007b02ce516b6b215">get_divisors</a></div><divclass="ttdeci">uint64_t get_divisors(uint64_t N, uint64_t *D)</div><divclass="ttdoc">Get all integer divisors of a number.</div><divclass="ttdef"><b>Definition:</b> sol1.c:47</div></div>
<divclass="ttc"id="aproblem__26_2sol1_8c_html_ac70138609ef6aa6fabca57aca8681e83"><divclass="ttname"><ahref="../../d1/df9/problem__26_2sol1_8c.html#ac70138609ef6aa6fabca57aca8681e83">compare</a></div><divclass="ttdeci">int compare(const void *a, const void *b)</div><divclass="ttdoc">comparison function for use with internal qsort algorithm</div><divclass="ttdef"><b>Definition:</b> sol1.c:19</div></div>
<divclass="ttc"id="ajump__search_8c_html_aff36d719e6fca6aea4377a089580c603"><divclass="ttname"><ahref="../../d6/d7b/jump__search_8c.html#aff36d719e6fca6aea4377a089580c603">jump_search</a></div><divclass="ttdeci">int jump_search(const int *arr, int x, size_t n)</div><divclass="ttdoc">Implement Jump-search algorithm.</div><divclass="ttdef"><b>Definition:</b> jump_search.c:24</div></div>
<divclass="ttc"id="aproblem__22_2sol1_8c_html_a5bc3659aa0949ea33118c95b1dee5f63"><divclass="ttname"><ahref="../../dd/d8b/problem__22_2sol1_8c.html#a5bc3659aa0949ea33118c95b1dee5f63">shell_sort</a></div><divclass="ttdeci">void shell_sort(char data[][MAX_NAME_LEN], int LEN)</div><divclass="ttdoc">Alphabetical sorting using 'shell sort' algorithm.</div><divclass="ttdef"><b>Definition:</b> sol1.c:20</div></div>
<divclass="ttc"id="aproblem__8_2sol1_8c_html_a9ffc8845f17b01a353767a40a3adf7bd"><divclass="ttname"><ahref="../../dc/d63/problem__8_2sol1_8c.html#a9ffc8845f17b01a353767a40a3adf7bd">get_product</a></div><divclass="ttdeci">long long int get_product(FILE *fp, long start_pos, int num_digits)</div><divclass="ttdoc">Compute the product of two numbers in a file.</div><divclass="ttdef"><b>Definition:</b> sol1.c:16</div></div>
<divclass="ttc"id="amodified__binary__search_8c_html_a7df9a198e30cded6229d79bef7591f8f"><divclass="ttname"><ahref="../../d3/d47/modified__binary__search_8c.html#a7df9a198e30cded6229d79bef7591f8f">modifiedBinarySearch</a></div><divclass="ttdeci">void modifiedBinarySearch(const int **mat, int n, int m, int x)</div><divclass="ttdoc">Function to perform binary search on the mid values of row to get the desired pair of rows where the ...</div><divclass="ttdef"><b>Definition:</b> modified_binary_search.c:48</div></div>
<divclass="ttc"id="ajump__search_8c_html_ae1a3968e7947464bee7714f6d43b7002"><divclass="ttname"><ahref="../../d6/d7b/jump__search_8c.html#ae1a3968e7947464bee7714f6d43b7002">test</a></div><divclass="ttdeci">void test()</div><divclass="ttdoc">Test implementation of the function.</div><divclass="ttdef"><b>Definition:</b> jump_search.c:58</div></div>
<divclass="ttc"id="abubble__sort_8c_html_ad7ed8cc4603f500d610054680d28b971"><divclass="ttname"><ahref="../../dd/de4/bubble__sort_8c.html#ad7ed8cc4603f500d610054680d28b971">display</a></div><divclass="ttdeci">void display(const int *arr, int n)</div><divclass="ttdoc">Display elements of array.</div><divclass="ttdef"><b>Definition:</b> bubble_sort.c:17</div></div>
<divclass="ttc"id="aproblem__23_2sol2_8c_html_a1aca7f530f82b27100262adba9e7556b"><divclass="ttname"><ahref="../../d4/dbd/problem__23_2sol2_8c.html#a1aca7f530f82b27100262adba9e7556b">get_perfect_number</a></div><divclass="ttdeci">char get_perfect_number(unsigned long N)</div><divclass="ttdef"><b>Definition:</b> sol2.c:31</div></div>
<divclass="ttc"id="aproblem__22_2sol1_8c_html_ae359b8a4656b164c91ef91a084c15c9d"><divclass="ttname"><ahref="../../dd/d8b/problem__22_2sol1_8c.html#ae359b8a4656b164c91ef91a084c15c9d">lazy_sort</a></div><divclass="ttdeci">void lazy_sort(char data[][MAX_NAME_LEN], int LEN)</div><divclass="ttdoc">Alphabetical sorting using 'lazy sort' algorithm.</div><divclass="ttdef"><b>Definition:</b> sol1.c:48</div></div>
<divclass="ttc"id="astructnode_html"><divclass="ttname"><ahref="../../d5/da1/structnode.html">node</a></div><divclass="ttdoc">Node, the basic data structure in the tree.</div><divclass="ttdef"><b>Definition:</b> binary_search_tree.c:15</div></div>
<divclass="ttc"id="aproblem__22_2sol1_8c_html_afd709f201d7643c3909621f620ea648a"><divclass="ttname"><ahref="../../dd/d8b/problem__22_2sol1_8c.html#afd709f201d7643c3909621f620ea648a">MAX_NAME_LEN</a></div><divclass="ttdeci">#define MAX_NAME_LEN</div><divclass="ttdoc">Maximum length of each name.</div><divclass="ttdef"><b>Definition:</b> sol1.c:15</div></div>
<divclass="ttc"id="ajump__search_8c_html_a8195a86b6d75b9a3939505e8bb50021e"><divclass="ttname"><ahref="../../d6/d7b/jump__search_8c.html#a8195a86b6d75b9a3939505e8bb50021e">min</a></div><divclass="ttdeci">#define min(X, Y)</div><divclass="ttdoc">Macro to return the minimum of two values.</div><divclass="ttdef"><b>Definition:</b> jump_search.c:13</div></div>
<divclass="ttc"id="agroup__sorting_html_ga2fb01e00dedb437a42010f6309e7eba8"><divclass="ttname"><ahref="../../d5/d4c/group__sorting.html#ga2fb01e00dedb437a42010f6309e7eba8">bead_sort</a></div><divclass="ttdeci">void bead_sort(int *a, size_t len)</div><divclass="ttdoc">This is where the sorting of the array takes place.</div><divclass="ttdef"><b>Definition:</b> bead_sort.c:37</div></div>
<divclass="ttc"id="arealtime__stats_8c_html_a63ddcdaab24f722f0963fa2fbe0ae628"><divclass="ttname"><ahref="../../dc/d47/realtime__stats_8c.html#a63ddcdaab24f722f0963fa2fbe0ae628">stats_computer1</a></div><divclass="ttdeci">void stats_computer1(float x, float *mean, float *variance, float *std)</div><divclass="ttdoc">continuous mean and variance computance using first value as an approximation for the mean.</div><divclass="ttdef"><b>Definition:</b> realtime_stats.c:24</div></div>
<divclass="ttc"id="aqr__eigen__values_8c_html_a0283886819c7c140a023582b7269e2d0"><divclass="ttname"><ahref="../../d7/d50/qr__eigen__values_8c.html#a0283886819c7c140a023582b7269e2d0">test2</a></div><divclass="ttdeci">void test2()</div><divclass="ttdoc">test function to compute eigen values of a 2x2 matrix</div><divclass="ttdef"><b>Definition:</b> qr_eigen_values.c:271</div></div>
<divclass="ttc"id="aproblem__20_2sol1_8c_html_a54a02c4b963fdb16f24959e0137763f1"><divclass="ttname"><ahref="../../db/d80/problem__20_2sol1_8c.html#a54a02c4b963fdb16f24959e0137763f1">remove_digits</a></div><divclass="ttdeci">char remove_digits(big_int *digit, int N)</div><divclass="ttdoc">Function to remove digits preceeding the current digit.</div><divclass="ttdef"><b>Definition:</b> sol1.c:76</div></div>
<divclass="ttc"id="astructsudoku_html_a160365012280c3e10f1b31e914e8f129"><divclass="ttname"><ahref="../../dc/d18/structsudoku.html#a160365012280c3e10f1b31e914e8f129">sudoku::N</a></div><divclass="ttdeci">uint8_t N</div><divclass="ttdoc">number of elements</div><divclass="ttdef"><b>Definition:</b> sudoku_solver.c:35</div></div>
<divclass="ttc"id="astruct__big__int_html_a273ee73fd755f2a99512cca5f0e09008"><divclass="ttname"><ahref="../../dc/d77/struct__big__int.html#a273ee73fd755f2a99512cca5f0e09008">_big_int::value</a></div><divclass="ttdeci">char value</div><divclass="ttdoc">tens place (single digit)</div><divclass="ttdef"><b>Definition:</b> sol1.c:19</div></div>
<divclass="ttc"id="aqr__decompose_8h_html_a45c7640d9d22c89c11beb1f567843c56"><divclass="ttname"><ahref="../../d4/d68/qr__decompose_8h.html#a45c7640d9d22c89c11beb1f567843c56">qr_decompose</a></div><divclass="ttdeci">void qr_decompose(double **A, double **Q, double **R, int M, int N)</div><divclass="ttdoc">Decompose matrix using Gram-Schmidt process.</div><divclass="ttdef"><b>Definition:</b> qr_decompose.h:142</div></div>
<divclass="ttc"id="aproblem__13_2sol1_8c_html_ad51742ca5a5c99e860bdf30299163bf2"><divclass="ttname"><ahref="../../db/d01/problem__13_2sol1_8c.html#ad51742ca5a5c99e860bdf30299163bf2">add_numbers</a></div><divclass="ttdeci">int add_numbers(uint8_t *a, uint8_t *b, uint8_t N)</div><divclass="ttdoc">Function to add arbitrary length decimal integers stored in an array.</div><divclass="ttdef"><b>Definition:</b> sol1.c:48</div></div>
<divclass="ttc"id="aproblem__19_2sol1_8c_html_ab7f9ad087f124b8e0615aa535b4c8a75"><divclass="ttname"><ahref="../../dd/df0/problem__19_2sol1_8c.html#ab7f9ad087f124b8e0615aa535b4c8a75">get_month_days</a></div><divclass="ttdeci">char get_month_days(short month)</div><divclass="ttdoc">Function to get the number of days in a month.</div><divclass="ttdef"><b>Definition:</b> sol1.c:15</div></div>
<divclass="ttc"id="astructnode_html_a2d890bb9f6af0ffd73fe79b21124c2a2"><divclass="ttname"><ahref="../../d5/da1/structnode.html#a2d890bb9f6af0ffd73fe79b21124c2a2">node::data</a></div><divclass="ttdeci">int data</div><divclass="ttdoc">data of the node</div><divclass="ttdef"><b>Definition:</b> binary_search_tree.c:18</div></div>
<divclass="ttc"id="aproblem__22_2sol1_8c_html_a6cb9b08aacb61416795ee78bfceacd38"><divclass="ttname"><ahref="../../dd/d8b/problem__22_2sol1_8c.html#a6cb9b08aacb61416795ee78bfceacd38">MAX_NAMES</a></div><divclass="ttdeci">#define MAX_NAMES</div><divclass="ttdoc">Maximum number of names to store.</div><divclass="ttdef"><b>Definition:</b> sol1.c:14</div></div>
<divclass="ttc"id="aproblem__401_2sol1_8c_html_a4441a6d27134cf3aed05727800d99456"><divclass="ttname"><ahref="../../d4/d83/problem__401_2sol1_8c.html#a4441a6d27134cf3aed05727800d99456">is_in</a></div><divclass="ttdeci">char is_in(uint64_t N, uint64_t *D, uint64_t L)</div><divclass="ttdoc">Check if a number is present in given array.</div><divclass="ttdef"><b>Definition:</b> sol1.c:28</div></div>
<divclass="ttc"id="astruct_node_html_a87c003c9f600e3fc58e6e90835f0b605"><divclass="ttname"><ahref="../../db/d8b/struct_node.html#a87c003c9f600e3fc58e6e90835f0b605">Node::data</a></div><divclass="ttdeci">int data</div><divclass="ttdoc">stores the number</div><divclass="ttdef"><b>Definition:</b> threaded_binary_trees.c:28</div></div>
<divclass="ttc"id="aproblem__23_2sol2_8c_html_ac5d600bf3077f4188afc4c5cd2c40eaf"><divclass="ttname"><ahref="../../d4/dbd/problem__23_2sol2_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf">get_next_abundant</a></div><divclass="ttdeci">unsigned long get_next_abundant(unsigned long N)</div><divclass="ttdoc">Find the next abundant number after N and not including N.</div><divclass="ttdef"><b>Definition:</b> sol2.c:70</div></div>
<divclass="ttc"id="astruct_node_html"><divclass="ttname"><ahref="../../db/d8b/struct_node.html">Node</a></div><divclass="ttdoc">Node, the basic data structure of the tree.</div><divclass="ttdef"><b>Definition:</b> threaded_binary_trees.c:27</div></div>
<divclass="ttc"id="aqr__eigen__values_8c_html_a1440a7779ac56f47a3f355ce4a8c7da0"><divclass="ttname"><ahref="../../d7/d50/qr__eigen__values_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><divclass="ttdeci">void test1()</div><divclass="ttdoc">test function to compute eigen values of a 2x2 matrix</div><divclass="ttdef"><b>Definition:</b> qr_eigen_values.c:224</div></div>
<divclass="ttc"id="aselection__sort_8c_html_ad126fa7239be97373c96861adc70b1d3"><divclass="ttname"><ahref="../../df/d83/selection__sort_8c.html#ad126fa7239be97373c96861adc70b1d3">swap</a></div><divclass="ttdeci">void swap(int *first, int *second)</div><divclass="ttdoc">Swapped two numbers using pointer.</div><divclass="ttdef"><b>Definition:</b> selection_sort.c:16</div></div>
<divclass="ttc"id="arealtime__stats_8c_html_aa54c915581fcc495489175a4386d59fd"><divclass="ttname"><ahref="../../dc/d47/realtime__stats_8c.html#aa54c915581fcc495489175a4386d59fd">test_function</a></div><divclass="ttdeci">void test_function(const float *test_data, const int number_of_samples)</div><divclass="ttdoc">Test the algorithm implementation.</div><divclass="ttdef"><b>Definition:</b> realtime_stats.c:92</div></div>
<divclass="ttc"id="aproblem__25_2sol1_8c_html_a001791a21d538b8b9176287ae60d9b61"><divclass="ttname"><ahref="../../d8/d32/problem__25_2sol1_8c.html#a001791a21d538b8b9176287ae60d9b61">MAX_DIGITS</a></div><divclass="ttdeci">#define MAX_DIGITS</div><divclass="ttdoc">maximum number of digits</div><divclass="ttdef"><b>Definition:</b> sol1.c:13</div></div>
<divclass="ttc"id="aproblem__10_2sol1_8c_html_ae3d987cb2ad0ddb0c3caa4c2506a20e5"><divclass="ttname"><ahref="../../d0/d6d/problem__10_2sol1_8c.html#ae3d987cb2ad0ddb0c3caa4c2506a20e5">sum_of_primes</a></div><divclass="ttdeci">unsigned long long sum_of_primes(unsigned long N)</div><divclass="ttdoc">Computes sum of prime numbers less than N.</div><divclass="ttdef"><b>Definition:</b> sol1.c:21</div></div>
<divclass="ttc"id="abubble__sort__recursion_8c_html_aa8989f6c9bfd1f040854fa18b180114f"><divclass="ttname"><ahref="../../d5/d38/bubble__sort__recursion_8c.html#aa8989f6c9bfd1f040854fa18b180114f">bubbleSort</a></div><divclass="ttdeci">void bubbleSort(int *arr, int size)</div><divclass="ttdoc">Bubble sort algorithm implements using recursion.</div><divclass="ttdef"><b>Definition:</b> bubble_sort_recursion.c:29</div></div>
<divclass="ttc"id="agroup__sorting_html_ga8dc3ec66cb3350313fdb34bfd1674729"><divclass="ttname"><ahref="../../d5/d4c/group__sorting.html#ga8dc3ec66cb3350313fdb34bfd1674729">merge</a></div><divclass="ttdeci">void merge(int *a, int l, int r, int n)</div><divclass="ttdoc">Perform merge of segments.</div><divclass="ttdef"><b>Definition:</b> merge_sort.c:33</div></div>
<divclass="ttc"id="aproblem__5_2sol_8c_html_ae9606f1867e9921867d6572f51377b4c"><divclass="ttname"><ahref="../../df/de7/problem__5_2sol_8c.html#ae9606f1867e9921867d6572f51377b4c">lcm</a></div><divclass="ttdeci">unsigned long lcm(unsigned long a, unsigned long b)</div><divclass="ttdoc">Compute Least Common Multiple (LCM) of two numbers.</div><divclass="ttdef"><b>Definition:</b> sol.c:31</div></div>
<divclass="ttc"id="aqr__decompose_8h_html"><divclass="ttname"><ahref="../../d4/d68/qr__decompose_8h.html">qr_decompose.h</a></div><divclass="ttdoc">Library functions to compute QR decomposition of a given matrix.</div></div>
<divclass="ttc"id="abubble__sort_8c_html_ad126fa7239be97373c96861adc70b1d3"><divclass="ttname"><ahref="../../dd/de4/bubble__sort_8c.html#ad126fa7239be97373c96861adc70b1d3">swap</a></div><divclass="ttdeci">void swap(int *first, int *second)</div><divclass="ttdoc">Swap two values by using pointer.</div><divclass="ttdef"><b>Definition:</b> bubble_sort.c:31</div></div>
<divclass="ttc"id="aproblem__25_2sol1_8c_html_a2b90df6bfbf0d18cd9a19c1a71453783"><divclass="ttname"><ahref="../../d8/d32/problem__25_2sol1_8c.html#a2b90df6bfbf0d18cd9a19c1a71453783">get_digits</a></div><divclass="ttdeci">unsigned int get_digits(unsigned char *number)</div><divclass="ttdoc">Get number of digits in a large number.</div><divclass="ttdef"><b>Definition:</b> sol1.c:75</div></div>
<divclass="ttc"id="aproblem__23_2sol1_8c_html_a4f128410e6582fe26488e2316cc96e17"><divclass="ttname"><ahref="../../d7/ddb/problem__23_2sol1_8c.html#a4f128410e6582fe26488e2316cc96e17">is_abundant</a></div><divclass="ttdeci">unsigned long is_abundant(unsigned long N)</div><divclass="ttdoc">Is the given number an abundant number (1) or not (0)</div><divclass="ttdef"><b>Definition:</b> sol1.c:47</div></div>
<divclass="ttc"id="aqr__decompose_8h_html_a90562ce8c3707401e9c5809dece68d6a"><divclass="ttname"><ahref="../../d4/d68/qr__decompose_8h.html#a90562ce8c3707401e9c5809dece68d6a">print_matrix</a></div><divclass="ttdeci">void print_matrix(double **A, int M, int N)</div><divclass="ttdoc">function to display matrix on stdout</div><divclass="ttdef"><b>Definition:</b> qr_decompose.h:22</div></div>
<divclass="ttc"id="aproblem__13_2sol1_8c_html_a248adc917818cc6666d8bc679a660319"><divclass="ttname"><ahref="../../db/d01/problem__13_2sol1_8c.html#a248adc917818cc6666d8bc679a660319">print_number</a></div><divclass="ttdeci">int print_number(uint8_t *number, uint8_t N, int8_t num_digits_to_print)</div><divclass="ttdoc">Function to print a long number.</div><divclass="ttdef"><b>Definition:</b> sol1.c:92</div></div>
<divclass="ttc"id="aproblem__21_2sol1_8c_html_aacf4b7e708651d2164e86958f2c29c93"><divclass="ttname"><ahref="../../df/d1a/problem__21_2sol1_8c.html#aacf4b7e708651d2164e86958f2c29c93">sum_of_divisors</a></div><divclass="ttdeci">unsigned long sum_of_divisors(unsigned int N)</div><divclass="ttdoc">function to return the sum of proper divisors of N</div><divclass="ttdef"><b>Definition:</b> sol1.c:13</div></div>
<divclass="ttc"id="amodified__binary__search_8c_html_a0cfaa56aacf960e4628a0fb27add8890"><divclass="ttname"><ahref="../../d3/d47/modified__binary__search_8c.html#a0cfaa56aacf960e4628a0fb27add8890">binarySearch</a></div><divclass="ttdeci">int binarySearch(const int **mat, int i, int j_low, int j_high, int x)</div><divclass="ttdoc">This function does Binary search for x in i-th row from j_low to j_high.</div><divclass="ttdef"><b>Definition:</b> modified_binary_search.c:18</div></div>
<divclass="ttc"id="aproblem__401_2sol1_8c_html_aaf964739be92adc2f500e7da11e3f6be"><divclass="ttname"><ahref="../../d4/d83/problem__401_2sol1_8c.html#aaf964739be92adc2f500e7da11e3f6be">sigma</a></div><divclass="ttdeci">uint64_t sigma(uint64_t N)</div><divclass="ttdoc">sum of squares of factors of numbers from 1 thru N</div><divclass="ttdef"><b>Definition:</b> sol1.c:114</div></div>
<divclass="ttc"id="aproblem__3_2sol1_8c_html_aa0f4796aa2e89c327f827bd55f5cb305"><divclass="ttname"><ahref="../../d7/dd3/problem__3_2sol1_8c.html#aa0f4796aa2e89c327f827bd55f5cb305">isprime</a></div><divclass="ttdeci">char isprime(int no)</div><divclass="ttdoc">Check if the given number is prime.</div><divclass="ttdef"><b>Definition:</b> sol1.c:15</div></div>
<divclass="ttc"id="aproblem__20_2sol1_8c_html_a62cbbd106aad52daadb9403a07d0da32"><divclass="ttname"><ahref="../../db/d80/problem__20_2sol1_8c.html#a62cbbd106aad52daadb9403a07d0da32">big_int</a></div><divclass="ttdeci">struct _big_int big_int</div><divclass="ttdoc">store arbitratily large integer values as a linked list of digits.</div></div>
<divclass="ttc"id="aqr__eigen__values_8c_html_a741477692f001a805b0fea942c9dc2b9"><divclass="ttname"><ahref="../../d7/d50/qr__eigen__values_8c.html#a741477692f001a805b0fea942c9dc2b9">mat_mul</a></div><divclass="ttdeci">double ** mat_mul(double **A, double **B, double **OUT, int R1, int C1, int R2, int C2)</div><divclass="ttdoc">Perform multiplication of two matrices.</div><divclass="ttdef"><b>Definition:</b> qr_eigen_values.c:59</div></div>
<divclass="ttc"id="aproblem__26_2sol1_8c_html_aabf4f709c8199e41cf279c77112345fe"><divclass="ttname"><ahref="../../d1/df9/problem__26_2sol1_8c.html#aabf4f709c8199e41cf279c77112345fe">MAX_LEN</a></div><divclass="ttdeci">#define MAX_LEN</div><divclass="ttdoc">length of resulting recurring fraction number</div><divclass="ttdef"><b>Definition:</b> sol1.c:15</div></div>
<divclass="ttc"id="agroup__sorting_html_gad7ed8cc4603f500d610054680d28b971"><divclass="ttname"><ahref="../../d5/d4c/group__sorting.html#gad7ed8cc4603f500d610054680d28b971">display</a></div><divclass="ttdeci">void display(const int *arr, int n)</div><divclass="ttdoc">Displays the array, passed to this method.</div><divclass="ttdef"><b>Definition:</b> bead_sort.c:23</div></div>
<divclass="ttc"id="aproblem__5_2sol_8c_html_a59347107cbfdf48d51108e50280e760d"><divclass="ttname"><ahref="../../df/de7/problem__5_2sol_8c.html#a59347107cbfdf48d51108e50280e760d">gcd</a></div><divclass="ttdeci">unsigned long gcd(unsigned long a, unsigned long b)</div><divclass="ttdoc">Compute Greatest Common Divisor (GCD) of two numbers using Euclids algorithm.</div><divclass="ttdef"><b>Definition:</b> sol.c:11</div></div>
<divclass="ttc"id="astruct__big__int_html"><divclass="ttname"><ahref="../../dc/d77/struct__big__int.html">_big_int</a></div><divclass="ttdoc">store arbitratily large integer values as a linked list of digits.</div><divclass="ttdef"><b>Definition:</b> sol1.c:18</div></div>
<divclass="ttc"id="aproblem__12_2sol1_8c_html_aa6ce6271f6156e219f9b290717f5a222"><divclass="ttname"><ahref="../../d7/d1f/problem__12_2sol1_8c.html#aa6ce6271f6156e219f9b290717f5a222">count_divisors</a></div><divclass="ttdeci">long count_divisors(long long n)</div><divclass="ttdoc">Get number of divisors of a given number.</div><divclass="ttdef"><b>Definition:</b> sol1.c:19</div></div>
<divclass="ttc"id="agroup__kohonen__2d_html_gaffe776513b24d84b39af8ab0930fef7f"><divclass="ttname"><ahref="../../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a></div><divclass="ttdeci">#define max(a, b)</div><divclass="ttdoc">shorthand for maximum value</div><divclass="ttdef"><b>Definition:</b> kohonen_som_topology.c:39</div></div>
<divclass="ttc"id="aproblem__26_2sol1_8c_html_a619eec3220cebd7c5e455edbb14e9b12"><divclass="ttname"><ahref="../../d1/df9/problem__26_2sol1_8c.html#a619eec3220cebd7c5e455edbb14e9b12">MAX_DENO</a></div><divclass="ttdeci">#define MAX_DENO</div><divclass="ttdoc">limit of unit fractions</div><divclass="ttdef"><b>Definition:</b> sol1.c:14</div></div>
<divclass="ttc"id="arealtime__stats_8c_html_a34be233a9200ee2065f6b7b27e2d9a96"><divclass="ttname"><ahref="../../dc/d47/realtime__stats_8c.html#a34be233a9200ee2065f6b7b27e2d9a96">stats_computer2</a></div><divclass="ttdeci">void stats_computer2(float x, float *mean, float *variance, float *std)</div><divclass="ttdoc">continuous mean and variance computance using Welford's algorithm (very accurate)</div><divclass="ttdef"><b>Definition:</b> realtime_stats.c:61</div></div>
<divclass="ttc"id="aproblem__23_2sol2_8c_html_a34f4ad85151e3a43368ae67f42347f56"><divclass="ttname"><ahref="../../d4/dbd/problem__23_2sol2_8c.html#a34f4ad85151e3a43368ae67f42347f56">is_abundant</a></div><divclass="ttdeci">char is_abundant(unsigned long N)</div><divclass="ttdoc">Is the given number an abundant number (1) or not (0)</div><divclass="ttdef"><b>Definition:</b> sol2.c:59</div></div>
<divclass="ttc"id="alu__decompose_8c_html_a0789beb8d3396582d77b7aedf5e5554a"><divclass="ttname"><ahref="../../dc/d2e/lu__decompose_8c.html#a0789beb8d3396582d77b7aedf5e5554a">display</a></div><divclass="ttdeci">void display(double **A, int N)</div><divclass="ttdoc">Function to display square matrix.</div><divclass="ttdef"><b>Definition:</b> lu_decompose.c:66</div></div>
<divclass="ttc"id="aproblem__15_2sol1_8c_html_a4650d1d3897633d84253f93433f601d6"><divclass="ttname"><ahref="../../d7/d91/problem__15_2sol1_8c.html#a4650d1d3897633d84253f93433f601d6">number_of_paths</a></div><divclass="ttdeci">unsigned long long number_of_paths(int N)</div><divclass="ttdoc">At every node, there are 2 possible ways to move -> down or right.</div><divclass="ttdef"><b>Definition:</b> sol1.c:17</div></div>
<divclass="ttc"id="aproblem__23_2sol2_8c_html_a3ab61b5a1c4f2288625d160aa0ea8478"><divclass="ttname"><ahref="../../d4/dbd/problem__23_2sol2_8c.html#a3ab61b5a1c4f2288625d160aa0ea8478">is_sum_of_abundant</a></div><divclass="ttdeci">char is_sum_of_abundant(unsigned long N)</div><divclass="ttdoc">check if a given number can be represented as a sum of two abundant numbers.</div><divclass="ttdef"><b>Definition:</b> sol2.c:87</div></div>
<divclass="ttc"id="aproblem__13_2sol1_8c_html_ac260f58785fb20eb09bb35385a7d47f8"><divclass="ttname"><ahref="../../db/d01/problem__13_2sol1_8c.html#ac260f58785fb20eb09bb35385a7d47f8">get_number</a></div><divclass="ttdeci">int get_number(FILE *fp, char *buffer, uint8_t *out_int)</div><divclass="ttdoc">Function to read the number from a file and store it in array.</div><divclass="ttdef"><b>Definition:</b> sol1.c:16</div></div>
<divclass="ttc"id="agroup__sorting_html_gaeccaf61ff47279384d1dba8d869d5c2f"><divclass="ttname"><ahref="../../d5/d4c/group__sorting.html#gaeccaf61ff47279384d1dba8d869d5c2f">show_data</a></div><divclass="ttdeci">void show_data(int *arr, long len)</div><divclass="ttdoc">Helper function to print array values.</div><divclass="ttdef"><b>Definition:</b> shell_sort2.c:16</div></div>
<divclass="ttc"id="astructsudoku_html_a507f788b793d4d3d6f6a70415be84ded"><divclass="ttname"><ahref="../../dc/d18/structsudoku.html#a507f788b793d4d3d6f6a70415be84ded">sudoku::a</a></div><divclass="ttdeci">uint8_t * a</div><divclass="ttdoc">matrix as a flattened 1D row-major array</div><divclass="ttdef"><b>Definition:</b> sudoku_solver.c:34</div></div>
<divclass="ttc"id="aproblem__14_2sol1_8c_html_a81c1df5c17cb16bcc16e346fcff6fa80"><divclass="ttname"><ahref="../../d4/dea/problem__14_2sol1_8c.html#a81c1df5c17cb16bcc16e346fcff6fa80">collatz</a></div><divclass="ttdeci">long long collatz(long long start_num)</div><divclass="ttdoc">Computes the length of collatz sequence for a given starting number.</div><divclass="ttdef"><b>Definition:</b> sol1.c:27</div></div>
<divclass="ttc"id="abinary__search__tree_8c_html_af4aeda155dbe167f1c1cf38cb65bf324"><divclass="ttname"><ahref="../../da/d02/binary__search__tree_8c.html#af4aeda155dbe167f1c1cf38cb65bf324">node</a></div><divclass="ttdeci">struct node node</div><divclass="ttdoc">Node, the basic data structure in the tree.</div></div>
<divclass="ttc"id="aproblem__20_2sol1_8c_html_afc373c28da6b17636528edcc97fb5f86"><divclass="ttname"><ahref="../../db/d80/problem__20_2sol1_8c.html#afc373c28da6b17636528edcc97fb5f86">add_digit</a></div><divclass="ttdeci">big_int * add_digit(big_int *digit, char value)</div><divclass="ttdoc">Function that allocates memory to add another digit at the MSB.</div><divclass="ttdef"><b>Definition:</b> sol1.c:37</div></div>
<divclass="ttc"id="agroup__sorting_html_gab99b8a397bdd0bf2903d66c22ba4ba43"><divclass="ttname"><ahref="../../d5/d4c/group__sorting.html#gab99b8a397bdd0bf2903d66c22ba4ba43">merge_sort</a></div><divclass="ttdeci">void merge_sort(int *a, int n, int l, int r)</div><divclass="ttdoc">Merge sort algorithm implementation.</div><divclass="ttdef"><b>Definition:</b> merge_sort.c:82</div></div>
<divclass="ttc"id="aqr__eigen__values_8c_html_aee57a411f07599034f5ceb8cc7d65b40"><divclass="ttname"><ahref="../../d7/d50/qr__eigen__values_8c.html#aee57a411f07599034f5ceb8cc7d65b40">LIMS</a></div><divclass="ttdeci">#define LIMS</div><divclass="ttdoc">limit of range of matrix values</div><divclass="ttdef"><b>Definition:</b> qr_eigen_values.c:19</div></div>
<divclass="ttc"id="abinary__search_8c_html_a908fd6d2ad0bba33f63f8454888a0032"><divclass="ttname"><ahref="../../df/d3b/binary__search_8c.html#a908fd6d2ad0bba33f63f8454888a0032">binarysearch2</a></div><divclass="ttdeci">int binarysearch2(const int *arr, int l, int r, int x)</div><divclass="ttdoc">Iterative implementation.</div><divclass="ttdef"><b>Definition:</b> binary_search.c:51</div></div>
<divclass="ttc"id="aqr__eigen__values_8c_html_a0d8ed79786d17df48396b333c09d05bb"><divclass="ttname"><ahref="../../d7/d50/qr__eigen__values_8c.html#a0d8ed79786d17df48396b333c09d05bb">eigen_values</a></div><divclass="ttdeci">double eigen_values(double **A, double *eigen_vals, int mat_size, char debug_print)</div><divclass="ttdoc">Compute eigen values using iterative shifted QR decomposition algorithm as follows:</div><divclass="ttdef"><b>Definition:</b> qr_eigen_values.c:106</div></div>
<divclass="ttc"id="agroup__sorting_html_ga4fdb8af29a07ac8f496e49a11bf9f1bd"><divclass="ttname"><ahref="../../d5/d4c/group__sorting.html#ga4fdb8af29a07ac8f496e49a11bf9f1bd">BEAD</a></div><divclass="ttdeci">#define BEAD(i, j)</div><divclass="ttdoc">Create easy access of elements from a 2D matrix stored in memory as a 1D array.</div><divclass="ttdef"><b>Definition:</b> bead_sort.c:16</div></div>
<divclass="ttc"id="agroup__sorting_html_ga5bc16eaf3ffe6a6ab66780dd445904c0"><divclass="ttname"><ahref="../../d5/d4c/group__sorting.html#ga5bc16eaf3ffe6a6ab66780dd445904c0">shell_sort</a></div><divclass="ttdeci">void shell_sort(int *array, long LEN)</div><divclass="ttdoc">Shell sort algorithm.</div><divclass="ttdef"><b>Definition:</b> shell_sort2.c:41</div></div>
<divclass="ttc"id="abubble__sort__recursion_8c_html_ad126fa7239be97373c96861adc70b1d3"><divclass="ttname"><ahref="../../d5/d38/bubble__sort__recursion_8c.html#ad126fa7239be97373c96861adc70b1d3">swap</a></div><divclass="ttdeci">void swap(int *first, int *second)</div><divclass="ttdoc">Swapped two numbers using pointer.</div><divclass="ttdef"><b>Definition:</b> bubble_sort_recursion.c:17</div></div>
<divclass="ttc"id="aproblem__19_2sol1_8c_html_a6561b1adc8a19c092679b9874da24e2e"><divclass="ttname"><ahref="../../dd/df0/problem__19_2sol1_8c.html#a6561b1adc8a19c092679b9874da24e2e">is_leap_year</a></div><divclass="ttdeci">char is_leap_year(short year)</div><divclass="ttdoc">Check if input year is a leap year.</div><divclass="ttdef"><b>Definition:</b> sol1.c:41</div></div>
<divclass="ttc"id="aproblem__23_2sol1_8c_html_a1aca7f530f82b27100262adba9e7556b"><divclass="ttname"><ahref="../../d7/ddb/problem__23_2sol1_8c.html#a1aca7f530f82b27100262adba9e7556b">get_perfect_number</a></div><divclass="ttdeci">char get_perfect_number(unsigned long N)</div><divclass="ttdoc">Returns: -1 if N is deficient 1 if N is abundant 0 if N is perfect.</div><divclass="ttdef"><b>Definition:</b> sol1.c:19</div></div>
<divclass="ttc"id="abubble__sort_8c_html_aa8989f6c9bfd1f040854fa18b180114f"><divclass="ttname"><ahref="../../dd/de4/bubble__sort_8c.html#aa8989f6c9bfd1f040854fa18b180114f">bubbleSort</a></div><divclass="ttdeci">void bubbleSort(int *arr, int size)</div><divclass="ttdoc">Bubble sort algorithm implementation.</div><divclass="ttdef"><b>Definition:</b> bubble_sort.c:43</div></div>
<divclass="ttc"id="aproblem__23_2sol1_8c_html_a3ab61b5a1c4f2288625d160aa0ea8478"><divclass="ttname"><ahref="../../d7/ddb/problem__23_2sol1_8c.html#a3ab61b5a1c4f2288625d160aa0ea8478">is_sum_of_abundant</a></div><divclass="ttdeci">char is_sum_of_abundant(unsigned long N)</div><divclass="ttdoc">check if a given number can be represented as a sum of two abundant numbers.</div><divclass="ttdef"><b>Definition:</b> sol1.c:71</div></div>
<divclass="ttc"id="aqr__eigen__values_8c_html_a7d96c5e4ae1bd6d29791bcc23a4cb2b0"><divclass="ttname"><ahref="../../d7/d50/qr__eigen__values_8c.html#a7d96c5e4ae1bd6d29791bcc23a4cb2b0">create_matrix</a></div><divclass="ttdeci">void create_matrix(double **A, int N)</div><divclass="ttdoc">create a square matrix of given size with random elements</div><divclass="ttdef"><b>Definition:</b> qr_eigen_values.c:27</div></div>
<divclass="ttc"id="acantor__set_8c_html_a75ee530cd7148a63249784ad3dda8fab"><divclass="ttname"><ahref="../../dc/d80/cantor__set_8c.html#a75ee530cd7148a63249784ad3dda8fab">print</a></div><divclass="ttdeci">void print(CantorSet *head)</div><divclass="ttdoc">Print sets in the current range to stdout</div><divclass="ttdef"><b>Definition:</b> cantor_set.c:55</div></div>
<divclass="ttc"id="aproblem__23_2sol2_8c_html_af920a16d6ef69dd604b283f427892e06"><divclass="ttname"><ahref="../../d4/dbd/problem__23_2sol2_8c.html#af920a16d6ef69dd604b283f427892e06">abundant_flags</a></div><divclass="ttdeci">char * abundant_flags</div><divclass="ttdoc">This is the global array to be used to store a flag to identify if a particular number is abundant (1...</div><divclass="ttdef"><b>Definition:</b> sol2.c:24</div></div>
<divclass="ttc"id="abinary__search_8c_html_a40855c608ca64048d04cff6526f0a582"><divclass="ttname"><ahref="../../df/d3b/binary__search_8c.html#a40855c608ca64048d04cff6526f0a582">binarysearch1</a></div><divclass="ttdeci">int binarysearch1(const int *arr, int l, int r, int x)</div><divclass="ttdoc">Recursive implementation.</div><divclass="ttdef"><b>Definition:</b> binary_search.c:21</div></div>
<!-- start footer part -->
<divid="nav-path"class="navpath"><!-- id is needed for treeview function! -->
<liclass="footer">Generated by <ahref="http://www.doxygen.org/index.html"><imgclass="footer"src="../../doxygen.svg"width="104"height="31"alt="doxygen"/></a> 1.8.19 </li>
