<trid="row_0_0_"class="odd"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="df/d27/alaw_8c.html"target="_self">alaw.c</a></td><tdclass="desc">A-law algorithm for encoding and decoding (16bit pcm <=> a-law). This is the implementation of <ahref="https://en.wikipedia.org/wiki/G.711"target="_blank">G.711</a> in C </td></tr>
<trid="row_1_0_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="d8/daf/affine_8c.html"target="_self">affine.c</a></td><tdclass="desc">An <ahref="https://en.wikipedia.org/wiki/Affine_cipher"target="_blank">affine cipher</a> is a letter substitution cipher that uses a linear transformation to substitute letters in a message </td></tr>
<trid="row_1_1_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="de/dcf/rot13_8c.html"target="_self">rot13.c</a></td><tdclass="desc"><ahref="https://en.wikipedia.org/wiki/ROT13"target="_blank">ROT13</a> is a simple letter substitution cipher that replaces a letter with the 13th letter after it in the alphabet </td></tr>
<trid="row_2_0_"class="odd"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="dd/d93/client_8c.html"target="_self">client.c</a></td><tdclass="desc">Client side implementation of Server-Client system </td></tr>
<trid="row_2_1_"class="odd"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="d9/ddd/remote__command__exec__udp__client_8c.html"target="_self">remote_command_exec_udp_client.c</a></td><tdclass="desc">Client-side implementation of [Remote Command Execution Using UDP](<ahref="https://www.imperva.com/learn/ddos/udp-user-datagram-protocol/">https://www.imperva.com/learn/ddos/udp-user-datagram-protocol/</a>) </td></tr>
<trid="row_2_2_"class="odd"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="dd/d79/remote__command__exec__udp__server_8c.html"target="_self">remote_command_exec_udp_server.c</a></td><tdclass="desc">Server-side implementation of [Remote Command Execution Using UDP](<ahref="https://www.imperva.com/learn/ddos/udp-user-datagram-protocol/">https://www.imperva.com/learn/ddos/udp-user-datagram-protocol/</a>) </td></tr>
<trid="row_2_3_"class="odd"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="d1/d20/server_8c.html"target="_self">server.c</a></td><tdclass="desc">Server side implementation of Server-Client system </td></tr>
<trid="row_2_4_"class="odd"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="d1/d98/tcp__full__duplex__client_8c.html"target="_self">tcp_full_duplex_client.c</a></td><tdclass="desc">Client-side implementation of <ahref="http://www.tcpipguide.com/free/t_SimplexFullDuplexandHalfDuplexOperation.htm"target="_blank">TCP Full Duplex Communication</a></td></tr>
<trid="row_2_5_"class="odd"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="d1/d6b/tcp__full__duplex__server_8c.html"target="_self">tcp_full_duplex_server.c</a></td><tdclass="desc">Server-side implementation of <ahref="http://www.tcpipguide.com/free/t_SimplexFullDuplexandHalfDuplexOperation.htm"target="_blank">TCP Full Duplex Communication</a></td></tr>
<trid="row_2_6_"class="odd"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="da/d07/tcp__half__duplex__client_8c.html"target="_self">tcp_half_duplex_client.c</a></td><tdclass="desc">Client-side implementation of <ahref="http://www.tcpipguide.com/free/t_SimplexFullDuplexandHalfDuplexOperation.htm"target="_blank">TCP Half Duplex Communication</a></td></tr>
<trid="row_2_7_"class="odd"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="d6/d2b/tcp__half__duplex__server_8c.html"target="_self">tcp_half_duplex_server.c</a></td><tdclass="desc">Server-side implementation of <ahref="http://www.tcpipguide.com/free/t_SimplexFullDuplexandHalfDuplexOperation.htm"target="_blank">TCP Half Duplex Communication</a></td></tr>
<trid="row_2_8_"class="odd"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="da/de6/udp__client_8c.html"target="_self">udp_client.c</a></td><tdclass="desc">Client side implementation of UDP client-server model </td></tr>
<trid="row_2_9_"class="odd"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="d8/dca/udp__server_8c.html"target="_self">udp_server.c</a></td><tdclass="desc">Server side implementation of UDP client-server model </td></tr>
<trid="row_3_0_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="d7/dd8/c__atoi__str__to__integer_8c.html"target="_self">c_atoi_str_to_integer.c</a></td><tdclass="desc">Recoding the original atoi function in stdlib.h </td></tr>
<trid="row_3_1_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="d0/d51/celsius__to__fahrenheit_8c.html"target="_self">celsius_to_fahrenheit.c</a></td><tdclass="desc">Conversion of temperature in degrees from <ahref="https://en.wikipedia.org/wiki/Celsius"target="_blank">Celsius</a> to <ahref="https://en.wikipedia.org/wiki/Fahrenheit"target="_blank">Fahrenheit</a></td></tr>
<trid="row_3_2_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="d1/dba/decimal__to__any__base_8c.html"target="_self">decimal_to_any_base.c</a></td><tdclass="desc"><ahref="http://codeofthedamned.com/index.php/number-base-conversion"target="_blank">Decimal to any-base</a> is a C function wich convert positive decimal integer to any positive ascii base with the base's alphabet given in input and return it in a dynamically allocated string(recursive way) </td></tr>
<trid="row_3_3_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="d8/d30/decimal__to__binary__recursion_8c.html"target="_self">decimal_to_binary_recursion.c</a></td><tdclass="desc">Convert decimal to binary using recursion algorithm </td></tr>
<trid="row_3_4_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="d0/dd9/hexadecimal__to__octal2_8c.html"target="_self">hexadecimal_to_octal2.c</a></td><tdclass="desc">Convert hexadecimal number to octal number (with decimal intermediary) </td></tr>
<trid="row_3_5_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="db/d0c/infix__to__postfix_8c.html"target="_self">infix_to_postfix.c</a></td><tdclass="desc"><ahref="https://condor.depaul.edu/ichu/csc415/notes/notes9/Infix.htm"target="_blank">Infix to Postfix</a> Expression Conversion </td></tr>
<trid="row_3_6_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="da/d96/infix__to__postfix2_8c.html"target="_self">infix_to_postfix2.c</a></td><tdclass="desc"><ahref="https://www.includehelp.com/c/infix-to-postfix-conversion-using-stack-with-c-program.aspx"target="_blank">Infix to Postfix converter</a> implementation </td></tr>
<trid="row_3_7_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="dd/d53/int__to__string_8c.html"target="_self">int_to_string.c</a></td><tdclass="desc">Convert a positive integer to string (non-standard function) representation </td></tr>
<trid="row_3_8_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="d0/d8a/octal__to__hexadecimal_8c.html"target="_self">octal_to_hexadecimal.c</a></td><tdclass="desc">Octal to hexadecimal conversion by scanning user input </td></tr>
<trid="row_3_9_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="dd/de6/roman__numerals__to__decimal_8c.html"target="_self">roman_numerals_to_decimal.c</a></td><tdclass="desc">Conversion of <ahref="https://en.wikipedia.org/wiki/Roman_numerals"target="_blank">roman numerals</a> to decimal </td></tr>
<trid="row_4_1_0_"class="odd"style="display:none;"><tdclass="entry"><spanstyle="width:48px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="da/d02/binary__search__tree_8c.html"target="_self">binary_search_tree.c</a></td><tdclass="desc">A basic unbalanced binary search tree implementation in C </td></tr>
<trid="row_4_1_1_"class="odd"style="display:none;"><tdclass="entry"><spanstyle="width:48px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="da/da0/segment__tree_8c.html"target="_self">segment_tree.c</a></td><tdclass="desc">Segment trees with only point updates </td></tr>
<trid="row_4_1_2_"class="odd"style="display:none;"><tdclass="entry"><spanstyle="width:48px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="df/d3c/threaded__binary__trees_8c.html"target="_self">threaded_binary_trees.c</a></td><tdclass="desc">This file is a simple implementation of a Threaded Binary Tree </td></tr>
<trid="row_4_1_3_"class="odd"style="display:none;"><tdclass="entry"><spanstyle="width:48px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="d3/d78/words__alphabetical_8c.html"target="_self">words_alphabetical.c</a></td><tdclass="desc">Printing the <ahref="http://www.dailyfreecode.com/Code/word-list-reads-text-file-makes-2050.aspx"target="_blank">words contained in a file</a> named <code>file.txt</code> in alphabetical order and also their frequencies in to another file "wordcount.txt" </td></tr>
<trid="row_4_6_1_"class="odd"style="display:none;"><tdclass="entry"><spanstyle="width:48px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="dd/d29/doubly__linked__list_8c.html"target="_self">doubly_linked_list.c</a></td><tdclass="desc">Implementation of <ahref="https://en.wikipedia.org/wiki/Doubly_linked_list"target="_blank">Doubly linked list</a></td></tr>
<trid="row_4_9_1_"class="odd"style="display:none;"><tdclass="entry"><spanstyle="width:48px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="d5/d24/dynamic__stack_8c.html"target="_self">dynamic_stack.c</a></td><tdclass="desc">Dynamic <ahref="https://en.wikipedia.org/wiki/Stack_(abstract_data_type)"target="_blank">Stack</a>, just like Dynamic Array, is a stack data structure whose the length or capacity (maximum number of elements that can be stored) increases or decreases in real time based on the operations (like insertion or deletion) performed on it </td></tr>
<trid="row_4_10_"class="odd"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="df/dfa/vector_8c.html"target="_self">vector.c</a></td><tdclass="desc">This is a vector implemenation in C </td></tr>
<trid="row_5_0_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="db/d84/malloc__dbg_8c.html"target="_self">malloc_dbg.c</a></td><tdclass="desc">This file contains malloc_dbg, calloc_dbg, free_dbg and printLeaks implementations </td></tr>
<trid="row_5_1_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><ahref="d2/ddd/malloc__dbg_8h_source.html"><spanclass="icondoc"></span></a><aclass="el"href="d2/ddd/malloc__dbg_8h.html"target="_self">malloc_dbg.h</a></td><tdclass="desc">Header file that contains macros used to replace malloc/calloc and free </td></tr>
<trid="row_5_2_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><ahref="d9/deb/min__printf_8h_source.html"><spanclass="icondoc"></span></a><aclass="el"href="d9/deb/min__printf_8h.html"target="_self">min_printf.h</a></td><tdclass="desc">Implementation of a <ahref="https://www.geeksforgeeks.org/variable-length-argument-c"target="_blank">function</a> similar to <code>printf</code></td></tr>
<trid="row_5_3_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="dd/d11/test__malloc__dbg_8c.html"target="_self">test_malloc_dbg.c</a></td><tdclass="desc">File used to test the malloc_dbg, calloc_dbg and free_dbg functions </td></tr>
<trid="row_5_4_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="d5/d5c/test__min__printf_8c.html"target="_self">test_min_printf.c</a></td><tdclass="desc">File used to test min_printf function </td></tr>
<trid="row_6_0_"class="odd"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="db/de1/lcs_8c.html"target="_self">lcs.c</a></td><tdclass="desc"><ahref="https://en.wikipedia.org/wiki/Longest_common_subsequence_problem"target="_blank">Longest Common Subsequence</a> algorithm </td></tr>
<trid="row_8_0_"class="odd"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="dc/dc5/hangman_8c.html"target="_self">hangman.c</a></td><tdclass="desc">C implementation of <ahref="https://en.wikipedia.org/wiki/Hangman_(game)"target="_blank">Hangman Game</a></td></tr>
<trid="row_8_1_"class="odd"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="db/de2/naval__battle_8c.html"target="_self">naval_battle.c</a></td><tdclass="desc"><ahref="https://en.wikipedia.org/wiki/Battleship_(game)"target="_blank">naval_battle</a> implementation in C using only the stdio.h for Standard Input and Output </td></tr>
<trid="row_9_0_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><ahref="d0/dc7/geometry__datatypes_8h_source.html"><spanclass="icondoc"></span></a><aclass="el"href="d0/dc7/geometry__datatypes_8h.html"target="_self">geometry_datatypes.h</a></td><tdclass="desc">Generic header that provides data types for 3D vectors and quaternions </td></tr>
<trid="row_9_1_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="df/d98/quaternions_8c.html"target="_self">quaternions.c</a></td><tdclass="desc">Functions related to 3D quaternions and Euler angles </td></tr>
<trid="row_9_2_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="d5/db8/vectors__3d_8c.html"target="_self">vectors_3d.c</a></td><tdclass="desc">Functions related to 3D vector operations </td></tr>
<trid="row_10_0_"class="odd"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="d7/d98/spirograph_8c.html"target="_self">spirograph.c</a></td><tdclass="desc">Implementation of <ahref="https://en.wikipedia.org/wiki/Spirograph"target="_blank">Spirograph</a></td></tr>
<trid="row_11_0_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="d9/dcc/prim_8c.html"target="_self">prim.c</a></td><tdclass="desc"><ahref="https://en.wikipedia.org/wiki/Prim%27s_algorithm"target="_blank">Prim's algorithm</a> implementation in C to find the MST of a weighted, connected graph </td></tr>
<trid="row_13_0_0_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:48px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="d0/df3/6_8c.html"target="_self">6.c</a></td><tdclass="desc">Implementation of the <ahref="https://leetcode.com/problems/zigzag-conversion/"target="_blank">ZigZag Conversion</a> Leetcode problem </td></tr>
<trid="row_15_0_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="dc/d80/cantor__set_8c.html"target="_self">cantor_set.c</a></td><tdclass="desc">Program to generate <ahref="https://en.wikipedia.org/wiki/Cantor_set"target="_blank">Cantor ternary set</a></td></tr>
<trid="row_15_1_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="d6/d2e/cartesian__to__polar_8c.html"target="_self">cartesian_to_polar.c</a></td><tdclass="desc">Function to convert a Cartesian co-ordinate to polar form </td></tr>
<trid="row_15_2_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="dc/d80/collatz_8c.html"target="_self">collatz.c</a></td><tdclass="desc">Implementation of <ahref="https://en.wikipedia.org/wiki/Collatz_conjecture"target="_blank">Collatz' conjecture</a></td></tr>
<trid="row_15_3_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="d5/df9/euclidean__algorithm__extended_8c.html"target="_self">euclidean_algorithm_extended.c</a></td><tdclass="desc">Program to perform the <ahref="https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm"target="_blank">extended Euclidean algorithm</a></td></tr>
<trid="row_15_4_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="d6/d3d/factorial__large__number_8c.html"target="_self">factorial_large_number.c</a></td><tdclass="desc">Compute factorial of arbitrarily large numbers by storing individual digits in a byte </td></tr>
<trid="row_15_5_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="d0/d6f/fibonacci_8c.html"target="_self">fibonacci.c</a></td><tdclass="desc">Program to print the nth term of the Fibonacci series </td></tr>
<trid="row_15_6_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="d4/d99/fibonacci__fast_8c.html"target="_self">fibonacci_fast.c</a></td><tdclass="desc">Compute \(m^{mth}\) Fibonacci number using the formulae: </td></tr>
<trid="row_15_7_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="d8/d75/fibonacci__formula_8c.html"target="_self">fibonacci_formula.c</a></td><tdclass="desc">Finding Fibonacci number of any <code>n</code> number using [Binet's closed form formula](<ahref="https://en.wikipedia.org/wiki/Fibonacci_number#Binet's_formula">https://en.wikipedia.org/wiki/Fibonacci_number#Binet's_formula</a>) compute \(f_{nth}\) Fibonacci number using the binet's formula: Fn = 1√5 * (1+√5 / 2)^n+1 − 1√5 * (1−√5 / 2)^n+1 </td></tr>
<trid="row_15_8_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="df/d16/palindrome_8c.html"target="_self">palindrome.c</a></td><tdclass="desc">Program to identify if a number is <ahref="https://en.wikipedia.org/wiki/Palindrome"target="_blank">palindrome number</a> or not </td></tr>
<trid="row_15_9_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="da/d93/prime_8c.html"target="_self">prime.c</a></td><tdclass="desc">Program to identify if a number is <ahref="https://en.wikipedia.org/wiki/Prime_number"target="_blank">prime number</a> or not </td></tr>
<trid="row_15_11_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="d4/dcc/strong__number_8c.html"target="_self">strong_number.c</a></td><tdclass="desc">Strong number is a number whose sum of all digits’ factorial is equal to the number n For example: 145 = 1!(1) + 4!(24) + 5!(120) </td></tr>
<trid="row_16_2_"class="odd"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="d0/dcb/poly__add_8c.html"target="_self">poly_add.c</a></td><tdclass="desc">Implementation of [Addition of two polynomials] (<ahref="https://en.wikipedia.org/wiki/Polynomial#Addition">https://en.wikipedia.org/wiki/Polynomial#Addition</a>) </td></tr>
<trid="row_16_4_"class="odd"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="d1/dc7/run__length__encoding_8c.html"target="_self">run_length_encoding.c</a></td><tdclass="desc">Encode a null terminated string using <ahref="https://en.wikipedia.org/wiki/Run-length_encoding"target="_blank">Run-length encoding</a></td></tr>
<trid="row_16_6_"class="odd"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="de/dac/sudoku__solver_8c.html"target="_self">sudoku_solver.c</a></td><tdclass="desc">Sudoku Solver using recursive implementation of brute-force algorithm </td></tr>
<trid="row_17_0_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="da/d4a/bisection__method_8c.html"target="_self">bisection_method.c</a></td><tdclass="desc">In mathematics, the <ahref="https://en.wikipedia.org/wiki/Bisection_method"target="_blank">Bisection Method</a> is a root-finding method that applies to any continuous function for which one knows two values with opposite signs </td></tr>
<trid="row_17_1_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="da/d38/durand__kerner__roots_8c.html"target="_self">durand_kerner_roots.c</a></td><tdclass="desc">Compute all possible approximate roots of any given polynomial using <ahref="https://en.wikipedia.org/wiki/Durand%E2%80%93Kerner_method"target="_blank">Durand Kerner algorithm</a></td></tr>
<trid="row_17_2_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="dc/d2e/lu__decompose_8c.html"target="_self">lu_decompose.c</a></td><tdclass="desc"><ahref="https://en.wikipedia.org/wiki/LU_decompositon"target="_blank">LU decomposition</a> of a square matrix </td></tr>
<trid="row_17_3_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="dd/d08/newton__raphson__root_8c.html"target="_self">newton_raphson_root.c</a></td><tdclass="desc">Find approximate solution for \(f(x) = 0\) using Newton-Raphson interpolation algorithm </td></tr>
<trid="row_17_4_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="d4/d07/ode__forward__euler_8c.html"target="_self">ode_forward_euler.c</a></td><tdclass="desc">Solve a multivariable first order <ahref="https://en.wikipedia.org/wiki/Ordinary_differential_equation"target="_blank">ordinary differential equation (ODEs)</a> using <ahref="https://en.wikipedia.org/wiki/Numerical_methods_for_ordinary_differential_equations#Euler_method"target="_blank">forward Euler method</a></td></tr>
<trid="row_17_5_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="d1/dc2/ode__midpoint__euler_8c.html"target="_self">ode_midpoint_euler.c</a></td><tdclass="desc">Solve a multivariable first order <ahref="https://en.wikipedia.org/wiki/Ordinary_differential_equation"target="_blank">ordinary differential equation (ODEs)</a> using <ahref="https://en.wikipedia.org/wiki/Midpoint_method"target="_blank">midpoint Euler method</a></td></tr>
<trid="row_17_6_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="d4/d99/ode__semi__implicit__euler_8c.html"target="_self">ode_semi_implicit_euler.c</a></td><tdclass="desc">Solve a multivariable first order <ahref="https://en.wikipedia.org/wiki/Ordinary_differential_equation"target="_blank">ordinary differential equation (ODEs)</a> using <ahref="https://en.wikipedia.org/wiki/Semi-implicit_Euler_method"target="_blank">semi implicit Euler method</a></td></tr>
<trid="row_17_7_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><ahref="d4/d68/qr__decompose_8h_source.html"><spanclass="icondoc"></span></a><aclass="el"href="d4/d68/qr__decompose_8h.html"target="_self">qr_decompose.h</a></td><tdclass="desc">Library functions to compute <ahref="https://en.wikipedia.org/wiki/QR_decomposition"target="_blank">QR decomposition</a> of a given matrix </td></tr>
<trid="row_17_8_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="d5/d23/qr__decomposition_8c.html"target="_self">qr_decomposition.c</a></td><tdclass="desc">Program to compute the <ahref="https://en.wikipedia.org/wiki/QR_decomposition"target="_blank">QR decomposition</a> of a given matrix </td></tr>
<trid="row_17_9_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="d7/d50/qr__eigen__values_8c.html"target="_self">qr_eigen_values.c</a></td><tdclass="desc">Compute real eigen values and eigen vectors of a symmetric matrix using <ahref="https://en.wikipedia.org/wiki/QR_decomposition"target="_blank">QR decomposition</a> method </td></tr>
<trid="row_17_10_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="dc/d47/realtime__stats_8c.html"target="_self">realtime_stats.c</a></td><tdclass="desc">Compute statistics for data entered in rreal-time </td></tr>
<trid="row_18_0_"class="odd"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="d2/d87/non__preemptive__priority__scheduling_8c.html"target="_self">non_preemptive_priority_scheduling.c</a></td><tdclass="desc"><ahref="https://en.wikipedia.org/wiki/Scheduling_(computing)"target="_blank">Non-Preemptive Priority Scheduling</a> is a scheduling algorithm that selects the tasks to execute based on priority </td></tr>
<trid="row_19_13_0_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:48px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="d8/d32/problem__25_2sol1_8c.html"target="_self">sol1.c</a></td><tdclass="desc"><ahref="https://projecteuler.net/problem=25"target="_blank">Problem 25</a> solution implemented using arbitrarily large numbers represented as arrays </td></tr>
<trid="row_19_17_0_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:48px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="d4/d83/problem__401_2sol1_8c.html"target="_self">sol1.c</a></td><tdclass="desc"><ahref="https://projecteuler.net/problem=401"target="_blank">Problem 401</a> solution - Sum of squares of divisors </td></tr>
<trid="row_20_0_"class="odd"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="df/d3b/binary__search_8c.html"target="_self">binary_search.c</a></td><tdclass="desc">Program to perform <ahref="https://en.wikipedia.org/wiki/Binary_search_algorithm"target="_blank">binary search</a> of a target value in a given <em>sorted</em> array </td></tr>
<trid="row_21_0_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="d2/da8/bead__sort_8c.html"target="_self">bead_sort.c</a></td><tdclass="desc">Sorting of array list using <ahref="https://en.wikipedia.org/wiki/Bead_sort"target="_blank">bead sort</a></td></tr>
<trid="row_21_7_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="d2/d83/merge__sort_8c.html"target="_self">merge_sort.c</a></td><tdclass="desc">Implementation of <ahref="https://en.wikipedia.org/wiki/Merge_sort"target="_blank">merge sort</a> algorithm </td></tr>
<trid="row_21_8_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icondoc"></span><aclass="el"href="d1/d94/odd__even__sort_8c.html"target="_self">odd_even_sort.c</a></td><tdclass="desc"><ahref="https://en.wikipedia.org/wiki/Odd%E2%80%93even_sort"target="_blank">Odd Even Sort</a> implementation </td></tr>
<liclass="footer">Generated by <ahref="https://www.doxygen.org/index.html"><imgclass="footer"src="doxygen.svg"width="104"height="31"alt="doxygen"/></a> 1.9.6 </li>
