mirror of
https://github.com/TheAlgorithms/C
synced 2025-01-05 17:44:25 +03:00
Documentation for 5d9bf07851
This commit is contained in:
github-actions
parent
70b7fbcc04
commit
c7c5c5c67b
@ -134,7 +134,7 @@ Functions</h2></td></tr>
|
||||
<tr class="memitem:ga7b84b14e60f47812b581d1f93057c85a"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/dcb/group__kohonen__1d.html#ga7b84b14e60f47812b581d1f93057c85a">save_nd_data</a> (const char *fname, double **X, int num_points, int num_features)</td></tr>
|
||||
<tr class="memdesc:ga7b84b14e60f47812b581d1f93057c85a"><td class="mdescLeft"> </td><td class="mdescRight">Save a given n-dimensional data martix to file. <a href="../../d0/dcb/group__kohonen__1d.html#ga7b84b14e60f47812b581d1f93057c85a">More...</a><br /></td></tr>
|
||||
<tr class="separator:ga7b84b14e60f47812b581d1f93057c85a"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:ga4a57a413a3cef286a7da6d4666575586"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/dcb/group__kohonen__1d.html#ga4a57a413a3cef286a7da6d4666575586">kohonen_get_min_1d</a> (double const *X, int <a class="el" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>, double *val, int *idx)</td></tr>
|
||||
<tr class="memitem:ga4a57a413a3cef286a7da6d4666575586"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/dcb/group__kohonen__1d.html#ga4a57a413a3cef286a7da6d4666575586">kohonen_get_min_1d</a> (double const *X, int N, double *val, int *idx)</td></tr>
|
||||
<tr class="memdesc:ga4a57a413a3cef286a7da6d4666575586"><td class="mdescLeft"> </td><td class="mdescRight">Get minimum value and index of the value in a vector. <a href="../../d0/dcb/group__kohonen__1d.html#ga4a57a413a3cef286a7da6d4666575586">More...</a><br /></td></tr>
|
||||
<tr class="separator:ga4a57a413a3cef286a7da6d4666575586"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:gae334493a0917a24736fe5ba82aa6f81f"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/dcb/group__kohonen__1d.html#gae334493a0917a24736fe5ba82aa6f81f">kohonen_update_weights</a> (double const *x, double *const *W, double *D, int num_out, int num_features, double alpha, int R)</td></tr>
|
||||
@ -143,19 +143,19 @@ Functions</h2></td></tr>
|
||||
<tr class="memitem:gaeaeffbff2be4d5d15b0d4f10f846abde"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/dcb/group__kohonen__1d.html#gaeaeffbff2be4d5d15b0d4f10f846abde">kohonen_som_tracer</a> (double **X, double *const *W, int num_samples, int num_features, int num_out, double alpha_min)</td></tr>
|
||||
<tr class="memdesc:gaeaeffbff2be4d5d15b0d4f10f846abde"><td class="mdescLeft"> </td><td class="mdescRight">Apply incremental algorithm with updating neighborhood and learning rates on all samples in the given datset. <a href="../../d0/dcb/group__kohonen__1d.html#gaeaeffbff2be4d5d15b0d4f10f846abde">More...</a><br /></td></tr>
|
||||
<tr class="separator:gaeaeffbff2be4d5d15b0d4f10f846abde"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a107f00650b8041f77767927073ddddb8"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d46/kohonen__som__trace_8c.html#a107f00650b8041f77767927073ddddb8">test_circle</a> (double *const *<a class="el" href="../../df/dea/structdata.html">data</a>, int <a class="el" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>)</td></tr>
|
||||
<tr class="memitem:a107f00650b8041f77767927073ddddb8"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d46/kohonen__som__trace_8c.html#a107f00650b8041f77767927073ddddb8">test_circle</a> (double *const *<a class="el" href="../../df/dea/structdata.html">data</a>, int N)</td></tr>
|
||||
<tr class="memdesc:a107f00650b8041f77767927073ddddb8"><td class="mdescLeft"> </td><td class="mdescRight">Creates a random set of points distributed <em>near</em> the circumference of a circle and trains an SOM that finds that circular pattern. <a href="../../d0/d46/kohonen__som__trace_8c.html#a107f00650b8041f77767927073ddddb8">More...</a><br /></td></tr>
|
||||
<tr class="separator:a107f00650b8041f77767927073ddddb8"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a1440a7779ac56f47a3f355ce4a8c7da0"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d46/kohonen__som__trace_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a> ()</td></tr>
|
||||
<tr class="memdesc:a1440a7779ac56f47a3f355ce4a8c7da0"><td class="mdescLeft"> </td><td class="mdescRight">Test that creates a random set of points distributed <em>near</em> the circumference of a circle and trains an SOM that finds that circular pattern. <a href="../../d0/d46/kohonen__som__trace_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0">More...</a><br /></td></tr>
|
||||
<tr class="separator:a1440a7779ac56f47a3f355ce4a8c7da0"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:aa2246f940155472084ee461f3685d614"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d46/kohonen__som__trace_8c.html#aa2246f940155472084ee461f3685d614">test_lamniscate</a> (double *const *<a class="el" href="../../df/dea/structdata.html">data</a>, int <a class="el" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>)</td></tr>
|
||||
<tr class="memitem:aa2246f940155472084ee461f3685d614"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d46/kohonen__som__trace_8c.html#aa2246f940155472084ee461f3685d614">test_lamniscate</a> (double *const *<a class="el" href="../../df/dea/structdata.html">data</a>, int N)</td></tr>
|
||||
<tr class="memdesc:aa2246f940155472084ee461f3685d614"><td class="mdescLeft"> </td><td class="mdescRight">Creates a random set of points distributed <em>near</em> the locus of the <a href="https://en.wikipedia.org/wiki/Lemniscate_of_Gerono">Lamniscate of Gerono</a>. <a href="../../d0/d46/kohonen__som__trace_8c.html#aa2246f940155472084ee461f3685d614">More...</a><br /></td></tr>
|
||||
<tr class="separator:aa2246f940155472084ee461f3685d614"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a0283886819c7c140a023582b7269e2d0"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d46/kohonen__som__trace_8c.html#a0283886819c7c140a023582b7269e2d0">test2</a> ()</td></tr>
|
||||
<tr class="memdesc:a0283886819c7c140a023582b7269e2d0"><td class="mdescLeft"> </td><td class="mdescRight">Test that creates a random set of points distributed <em>near</em> the locus of the <a href="https://en.wikipedia.org/wiki/Lemniscate_of_Gerono">Lamniscate of Gerono</a> and trains an SOM that finds that circular pattern. <a href="../../d0/d46/kohonen__som__trace_8c.html#a0283886819c7c140a023582b7269e2d0">More...</a><br /></td></tr>
|
||||
<tr class="separator:a0283886819c7c140a023582b7269e2d0"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a41ae16442e3e5b891a58d2e5932a2cd0"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d46/kohonen__som__trace_8c.html#a41ae16442e3e5b891a58d2e5932a2cd0">test_3d_classes</a> (double *const *<a class="el" href="../../df/dea/structdata.html">data</a>, int <a class="el" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>)</td></tr>
|
||||
<tr class="memitem:a41ae16442e3e5b891a58d2e5932a2cd0"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d46/kohonen__som__trace_8c.html#a41ae16442e3e5b891a58d2e5932a2cd0">test_3d_classes</a> (double *const *<a class="el" href="../../df/dea/structdata.html">data</a>, int N)</td></tr>
|
||||
<tr class="memdesc:a41ae16442e3e5b891a58d2e5932a2cd0"><td class="mdescLeft"> </td><td class="mdescRight">Creates a random set of points distributed in four clusters in 3D space with centroids at the points. <a href="../../d0/d46/kohonen__som__trace_8c.html#a41ae16442e3e5b891a58d2e5932a2cd0">More...</a><br /></td></tr>
|
||||
<tr class="separator:a41ae16442e3e5b891a58d2e5932a2cd0"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a6d0455dd5c30adda100e95f0423c786e"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d46/kohonen__som__trace_8c.html#a6d0455dd5c30adda100e95f0423c786e">test3</a> ()</td></tr>
|
||||
@ -243,19 +243,19 @@ int </td><td class="memItemRight" valign="bottom"><a class="el" href="../..
|
||||
</div><!-- fragment --><p><img src="https://raw.githubusercontent.com/TheAlgorithms/C/docs/images/machine_learning/kohonen/test1.svg" alt="Sample execution
|
||||
output" style="pointer-events: none;" class="inline"/> </p>
|
||||
<div class="fragment"><div class="line"><a name="l00262"></a><span class="lineno"> 262</span> {</div>
|
||||
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="keywordtype">int</span> j, <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> = 500;</div>
|
||||
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="keywordtype">int</span> j, N = 500;</div>
|
||||
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <span class="keywordtype">int</span> features = 2;</div>
|
||||
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="keywordtype">int</span> num_out = 50;</div>
|
||||
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  </div>
|
||||
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <span class="comment">// 2D space, hence size = number of rows * 2</span></div>
|
||||
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="keywordtype">double</span> **X = (<span class="keywordtype">double</span> **)malloc(<a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> * <span class="keyword">sizeof</span>(<span class="keywordtype">double</span> *));</div>
|
||||
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="keywordtype">double</span> **X = (<span class="keywordtype">double</span> **)malloc(N * <span class="keyword">sizeof</span>(<span class="keywordtype">double</span> *));</div>
|
||||
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  </div>
|
||||
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <span class="comment">// number of clusters nodes * 2</span></div>
|
||||
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <span class="keywordtype">double</span> **W = (<span class="keywordtype">double</span> **)malloc(num_out * <span class="keyword">sizeof</span>(<span class="keywordtype">double</span> *));</div>
|
||||
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  </div>
|
||||
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="../../d0/dcb/group__kohonen__1d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a>(num_out, <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>); i++) <span class="comment">// loop till max(N, num_out)</span></div>
|
||||
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="../../d0/dcb/group__kohonen__1d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a>(num_out, N); i++) <span class="comment">// loop till max(N, num_out)</span></div>
|
||||
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  {</div>
|
||||
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="keywordflow">if</span> (i < <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>) <span class="comment">// only add new arrays if i < N</span></div>
|
||||
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="keywordflow">if</span> (i < N) <span class="comment">// only add new arrays if i < N</span></div>
|
||||
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  X[i] = (<span class="keywordtype">double</span> *)malloc(features * <span class="keyword">sizeof</span>(<span class="keywordtype">double</span>));</div>
|
||||
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <span class="keywordflow">if</span> (i < num_out) <span class="comment">// only add new arrays if i < num_out</span></div>
|
||||
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  {</div>
|
||||
@ -268,17 +268,17 @@ output" style="pointer-events: none;" class="inline"/> </p>
|
||||
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  }</div>
|
||||
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  }</div>
|
||||
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  </div>
|
||||
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  <a class="code" href="../../d0/d46/kohonen__som__trace_8c.html#a107f00650b8041f77767927073ddddb8">test_circle</a>(X, <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>); <span class="comment">// create test data around circumference of a circle</span></div>
|
||||
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <a class="code" href="../../d0/dcb/group__kohonen__1d.html#ga7b84b14e60f47812b581d1f93057c85a">save_nd_data</a>(<span class="stringliteral">"test1.csv"</span>, X, <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>, features); <span class="comment">// save test data points</span></div>
|
||||
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  <a class="code" href="../../d0/d46/kohonen__som__trace_8c.html#a107f00650b8041f77767927073ddddb8">test_circle</a>(X, N); <span class="comment">// create test data around circumference of a circle</span></div>
|
||||
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <a class="code" href="../../d0/dcb/group__kohonen__1d.html#ga7b84b14e60f47812b581d1f93057c85a">save_nd_data</a>(<span class="stringliteral">"test1.csv"</span>, X, N, features); <span class="comment">// save test data points</span></div>
|
||||
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  <a class="code" href="../../d0/dcb/group__kohonen__1d.html#ga7b84b14e60f47812b581d1f93057c85a">save_nd_data</a>(<span class="stringliteral">"w11.csv"</span>, W, num_out,</div>
|
||||
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  features); <span class="comment">// save initial random weights</span></div>
|
||||
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  <a class="code" href="../../d0/dcb/group__kohonen__1d.html#gaeaeffbff2be4d5d15b0d4f10f846abde">kohonen_som_tracer</a>(X, W, <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>, features, num_out, 0.1); <span class="comment">// train the SOM</span></div>
|
||||
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  <a class="code" href="../../d0/dcb/group__kohonen__1d.html#gaeaeffbff2be4d5d15b0d4f10f846abde">kohonen_som_tracer</a>(X, W, N, features, num_out, 0.1); <span class="comment">// train the SOM</span></div>
|
||||
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <a class="code" href="../../d0/dcb/group__kohonen__1d.html#ga7b84b14e60f47812b581d1f93057c85a">save_nd_data</a>(<span class="stringliteral">"w12.csv"</span>, W, num_out,</div>
|
||||
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  features); <span class="comment">// save the resultant weights</span></div>
|
||||
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  </div>
|
||||
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="../../d0/dcb/group__kohonen__1d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a>(num_out, <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>); i++)</div>
|
||||
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="../../d0/dcb/group__kohonen__1d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a>(num_out, N); i++)</div>
|
||||
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  {</div>
|
||||
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <span class="keywordflow">if</span> (i < <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>)</div>
|
||||
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <span class="keywordflow">if</span> (i < N)</div>
|
||||
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  free(X[i]);</div>
|
||||
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <span class="keywordflow">if</span> (i < num_out)</div>
|
||||
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  free(W[i]);</div>
|
||||
@ -321,14 +321,14 @@ Here is the call graph for this function:</div>
|
||||
</div><!-- fragment --><p><img src="https://raw.githubusercontent.com/TheAlgorithms/C/docs/images/machine_learning/kohonen/test2.svg" alt="Sample execution
|
||||
output" style="pointer-events: none;" class="inline"/> </p>
|
||||
<div class="fragment"><div class="line"><a name="l00359"></a><span class="lineno"> 359</span> {</div>
|
||||
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  <span class="keywordtype">int</span> j, <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> = 500;</div>
|
||||
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  <span class="keywordtype">int</span> j, N = 500;</div>
|
||||
<div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  <span class="keywordtype">int</span> features = 2;</div>
|
||||
<div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  <span class="keywordtype">int</span> num_out = 20;</div>
|
||||
<div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  <span class="keywordtype">double</span> **X = (<span class="keywordtype">double</span> **)malloc(<a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> * <span class="keyword">sizeof</span>(<span class="keywordtype">double</span> *));</div>
|
||||
<div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  <span class="keywordtype">double</span> **X = (<span class="keywordtype">double</span> **)malloc(N * <span class="keyword">sizeof</span>(<span class="keywordtype">double</span> *));</div>
|
||||
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  <span class="keywordtype">double</span> **W = (<span class="keywordtype">double</span> **)malloc(num_out * <span class="keyword">sizeof</span>(<span class="keywordtype">double</span> *));</div>
|
||||
<div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="../../d0/dcb/group__kohonen__1d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a>(num_out, <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>); i++)</div>
|
||||
<div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="../../d0/dcb/group__kohonen__1d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a>(num_out, N); i++)</div>
|
||||
<div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  {</div>
|
||||
<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  <span class="keywordflow">if</span> (i < <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>) <span class="comment">// only add new arrays if i < N</span></div>
|
||||
<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  <span class="keywordflow">if</span> (i < N) <span class="comment">// only add new arrays if i < N</span></div>
|
||||
<div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  X[i] = (<span class="keywordtype">double</span> *)malloc(features * <span class="keyword">sizeof</span>(<span class="keywordtype">double</span>));</div>
|
||||
<div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  <span class="keywordflow">if</span> (i < num_out) <span class="comment">// only add new arrays if i < num_out</span></div>
|
||||
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  {</div>
|
||||
@ -342,17 +342,17 @@ output" style="pointer-events: none;" class="inline"/> </p>
|
||||
<div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  }</div>
|
||||
<div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  }</div>
|
||||
<div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  </div>
|
||||
<div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  <a class="code" href="../../d0/d46/kohonen__som__trace_8c.html#aa2246f940155472084ee461f3685d614">test_lamniscate</a>(X, <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>); <span class="comment">// create test data around the lamniscate</span></div>
|
||||
<div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  <a class="code" href="../../d0/dcb/group__kohonen__1d.html#ga7b84b14e60f47812b581d1f93057c85a">save_nd_data</a>(<span class="stringliteral">"test2.csv"</span>, X, <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>, features); <span class="comment">// save test data points</span></div>
|
||||
<div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  <a class="code" href="../../d0/d46/kohonen__som__trace_8c.html#aa2246f940155472084ee461f3685d614">test_lamniscate</a>(X, N); <span class="comment">// create test data around the lamniscate</span></div>
|
||||
<div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  <a class="code" href="../../d0/dcb/group__kohonen__1d.html#ga7b84b14e60f47812b581d1f93057c85a">save_nd_data</a>(<span class="stringliteral">"test2.csv"</span>, X, N, features); <span class="comment">// save test data points</span></div>
|
||||
<div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  <a class="code" href="../../d0/dcb/group__kohonen__1d.html#ga7b84b14e60f47812b581d1f93057c85a">save_nd_data</a>(<span class="stringliteral">"w21.csv"</span>, W, num_out,</div>
|
||||
<div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  features); <span class="comment">// save initial random weights</span></div>
|
||||
<div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <a class="code" href="../../d0/dcb/group__kohonen__1d.html#gaeaeffbff2be4d5d15b0d4f10f846abde">kohonen_som_tracer</a>(X, W, <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>, features, num_out, 0.01); <span class="comment">// train the SOM</span></div>
|
||||
<div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <a class="code" href="../../d0/dcb/group__kohonen__1d.html#gaeaeffbff2be4d5d15b0d4f10f846abde">kohonen_som_tracer</a>(X, W, N, features, num_out, 0.01); <span class="comment">// train the SOM</span></div>
|
||||
<div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  <a class="code" href="../../d0/dcb/group__kohonen__1d.html#ga7b84b14e60f47812b581d1f93057c85a">save_nd_data</a>(<span class="stringliteral">"w22.csv"</span>, W, num_out,</div>
|
||||
<div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  features); <span class="comment">// save the resultant weights</span></div>
|
||||
<div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  </div>
|
||||
<div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="../../d0/dcb/group__kohonen__1d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a>(num_out, <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>); i++)</div>
|
||||
<div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="../../d0/dcb/group__kohonen__1d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a>(num_out, N); i++)</div>
|
||||
<div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  {</div>
|
||||
<div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  <span class="keywordflow">if</span> (i < <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>)</div>
|
||||
<div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  <span class="keywordflow">if</span> (i < N)</div>
|
||||
<div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  free(X[i]);</div>
|
||||
<div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  <span class="keywordflow">if</span> (i < num_out)</div>
|
||||
<div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  free(W[i]);</div>
|
||||
@ -397,14 +397,14 @@ Here is the call graph for this function:</div>
|
||||
</div><!-- fragment --><p><img src="https://raw.githubusercontent.com/TheAlgorithms/C/docs/images/machine_learning/kohonen/test3.svg" alt="Sample execution
|
||||
output" style="pointer-events: none;" class="inline"/> </p>
|
||||
<div class="fragment"><div class="line"><a name="l00463"></a><span class="lineno"> 463</span> {</div>
|
||||
<div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="keywordtype">int</span> j, <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> = 200;</div>
|
||||
<div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="keywordtype">int</span> j, N = 200;</div>
|
||||
<div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  <span class="keywordtype">int</span> features = 3;</div>
|
||||
<div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  <span class="keywordtype">int</span> num_out = 20;</div>
|
||||
<div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  <span class="keywordtype">double</span> **X = (<span class="keywordtype">double</span> **)malloc(<a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> * <span class="keyword">sizeof</span>(<span class="keywordtype">double</span> *));</div>
|
||||
<div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  <span class="keywordtype">double</span> **X = (<span class="keywordtype">double</span> **)malloc(N * <span class="keyword">sizeof</span>(<span class="keywordtype">double</span> *));</div>
|
||||
<div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  <span class="keywordtype">double</span> **W = (<span class="keywordtype">double</span> **)malloc(num_out * <span class="keyword">sizeof</span>(<span class="keywordtype">double</span> *));</div>
|
||||
<div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="../../d0/dcb/group__kohonen__1d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a>(num_out, <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>); i++)</div>
|
||||
<div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="../../d0/dcb/group__kohonen__1d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a>(num_out, N); i++)</div>
|
||||
<div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  {</div>
|
||||
<div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  <span class="keywordflow">if</span> (i < <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>) <span class="comment">// only add new arrays if i < N</span></div>
|
||||
<div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  <span class="keywordflow">if</span> (i < N) <span class="comment">// only add new arrays if i < N</span></div>
|
||||
<div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  X[i] = (<span class="keywordtype">double</span> *)malloc(features * <span class="keyword">sizeof</span>(<span class="keywordtype">double</span>));</div>
|
||||
<div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  <span class="keywordflow">if</span> (i < num_out) <span class="comment">// only add new arrays if i < num_out</span></div>
|
||||
<div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  {</div>
|
||||
@ -418,17 +418,17 @@ output" style="pointer-events: none;" class="inline"/> </p>
|
||||
<div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  }</div>
|
||||
<div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  }</div>
|
||||
<div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  </div>
|
||||
<div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  <a class="code" href="../../d0/d46/kohonen__som__trace_8c.html#a41ae16442e3e5b891a58d2e5932a2cd0">test_3d_classes</a>(X, <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>); <span class="comment">// create test data around the lamniscate</span></div>
|
||||
<div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  <a class="code" href="../../d0/dcb/group__kohonen__1d.html#ga7b84b14e60f47812b581d1f93057c85a">save_nd_data</a>(<span class="stringliteral">"test3.csv"</span>, X, <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>, features); <span class="comment">// save test data points</span></div>
|
||||
<div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  <a class="code" href="../../d0/d46/kohonen__som__trace_8c.html#a41ae16442e3e5b891a58d2e5932a2cd0">test_3d_classes</a>(X, N); <span class="comment">// create test data around the lamniscate</span></div>
|
||||
<div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  <a class="code" href="../../d0/dcb/group__kohonen__1d.html#ga7b84b14e60f47812b581d1f93057c85a">save_nd_data</a>(<span class="stringliteral">"test3.csv"</span>, X, N, features); <span class="comment">// save test data points</span></div>
|
||||
<div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  <a class="code" href="../../d0/dcb/group__kohonen__1d.html#ga7b84b14e60f47812b581d1f93057c85a">save_nd_data</a>(<span class="stringliteral">"w31.csv"</span>, W, num_out,</div>
|
||||
<div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  features); <span class="comment">// save initial random weights</span></div>
|
||||
<div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  <a class="code" href="../../d0/dcb/group__kohonen__1d.html#gaeaeffbff2be4d5d15b0d4f10f846abde">kohonen_som_tracer</a>(X, W, <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>, features, num_out, 0.01); <span class="comment">// train the SOM</span></div>
|
||||
<div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  <a class="code" href="../../d0/dcb/group__kohonen__1d.html#gaeaeffbff2be4d5d15b0d4f10f846abde">kohonen_som_tracer</a>(X, W, N, features, num_out, 0.01); <span class="comment">// train the SOM</span></div>
|
||||
<div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  <a class="code" href="../../d0/dcb/group__kohonen__1d.html#ga7b84b14e60f47812b581d1f93057c85a">save_nd_data</a>(<span class="stringliteral">"w32.csv"</span>, W, num_out,</div>
|
||||
<div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  features); <span class="comment">// save the resultant weights</span></div>
|
||||
<div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  </div>
|
||||
<div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="../../d0/dcb/group__kohonen__1d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a>(num_out, <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>); i++)</div>
|
||||
<div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="../../d0/dcb/group__kohonen__1d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a>(num_out, N); i++)</div>
|
||||
<div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  {</div>
|
||||
<div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  <span class="keywordflow">if</span> (i < <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>)</div>
|
||||
<div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  <span class="keywordflow">if</span> (i < N)</div>
|
||||
<div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  free(X[i]);</div>
|
||||
<div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  <span class="keywordflow">if</span> (i < num_out)</div>
|
||||
<div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  free(W[i]);</div>
|
||||
@ -500,7 +500,7 @@ Here is the call graph for this function:</div>
|
||||
<div class="line"><a name="l00423"></a><span class="lineno"> 423</span> <span class="preprocessor">#ifdef _OPENMP</span></div>
|
||||
<div class="line"><a name="l00424"></a><span class="lineno"> 424</span> <span class="preprocessor">#pragma omp for</span></div>
|
||||
<div class="line"><a name="l00425"></a><span class="lineno"> 425</span> <span class="preprocessor">#endif</span></div>
|
||||
<div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  <span class="keywordflow">for</span> (i = 0; i < <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>; i++)</div>
|
||||
<div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  <span class="keywordflow">for</span> (i = 0; i < N; i++)</div>
|
||||
<div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  {</div>
|
||||
<div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  <span class="keywordtype">int</span> <span class="keyword">class </span>=</div>
|
||||
<div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  rand() % num_classes; <span class="comment">// select a random class for the point</span></div>
|
||||
@ -571,7 +571,7 @@ Here is the call graph for this function:</div>
|
||||
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span> <span class="preprocessor">#ifdef _OPENMP</span></div>
|
||||
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span> <span class="preprocessor">#pragma omp for</span></div>
|
||||
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span> <span class="preprocessor">#endif</span></div>
|
||||
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="keywordflow">for</span> (i = 0; i < <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>; i++)</div>
|
||||
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="keywordflow">for</span> (i = 0; i < N; i++)</div>
|
||||
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  {</div>
|
||||
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <span class="keywordtype">double</span> r = <a class="code" href="../../d0/dcb/group__kohonen__1d.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a>(a_r, b_r); <span class="comment">// random radius</span></div>
|
||||
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <span class="keywordtype">double</span> theta = <a class="code" href="../../d0/dcb/group__kohonen__1d.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a>(a_t, b_t); <span class="comment">// random theta</span></div>
|
||||
@ -632,7 +632,7 @@ Here is the call graph for this function:</div>
|
||||
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span> <span class="preprocessor">#ifdef _OPENMP</span></div>
|
||||
<div class="line"><a name="l00325"></a><span class="lineno"> 325</span> <span class="preprocessor">#pragma omp for</span></div>
|
||||
<div class="line"><a name="l00326"></a><span class="lineno"> 326</span> <span class="preprocessor">#endif</span></div>
|
||||
<div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  <span class="keywordflow">for</span> (i = 0; i < <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>; i++)</div>
|
||||
<div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  <span class="keywordflow">for</span> (i = 0; i < N; i++)</div>
|
||||
<div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  {</div>
|
||||
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  <span class="keywordtype">double</span> dx = <a class="code" href="../../d0/dcb/group__kohonen__1d.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a>(-dr, dr); <span class="comment">// random change in x</span></div>
|
||||
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  <span class="keywordtype">double</span> dy = <a class="code" href="../../d0/dcb/group__kohonen__1d.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a>(-dr, dr); <span class="comment">// random change in y</span></div>
|
||||
@ -655,7 +655,6 @@ Here is the call graph for this function:</div>
|
||||
<div class="ttc" id="akohonen__som__trace_8c_html_a107f00650b8041f77767927073ddddb8"><div class="ttname"><a href="../../d0/d46/kohonen__som__trace_8c.html#a107f00650b8041f77767927073ddddb8">test_circle</a></div><div class="ttdeci">void test_circle(double *const *data, int N)</div><div class="ttdoc">Creates a random set of points distributed near the circumference of a circle and trains an SOM that ...</div><div class="ttdef"><b>Definition:</b> kohonen_som_trace.c:223</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="agroup__kohonen__1d_html_ga7b84b14e60f47812b581d1f93057c85a"><div class="ttname"><a href="../../d0/dcb/group__kohonen__1d.html#ga7b84b14e60f47812b581d1f93057c85a">save_nd_data</a></div><div class="ttdeci">int save_nd_data(const char *fname, double **X, int num_points, int num_features)</div><div class="ttdoc">Save a given n-dimensional data martix to file.</div><div class="ttdef"><b>Definition:</b> kohonen_som_trace.c:70</div></div>
|
||||
<div class="ttc" id="aproblem__13_2sol1_8c_html_a0240ac851181b84ac374872dc5434ee4"><div class="ttname"><a href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a></div><div class="ttdeci">#define N</div><div class="ttdoc">number of digits of the large number</div><div class="ttdef"><b>Definition:</b> sol1.c:109</div></div>
|
||||
<div class="ttc" id="akohonen__som__trace_8c_html_aa2246f940155472084ee461f3685d614"><div class="ttname"><a href="../../d0/d46/kohonen__som__trace_8c.html#aa2246f940155472084ee461f3685d614">test_lamniscate</a></div><div class="ttdeci">void test_lamniscate(double *const *data, int N)</div><div class="ttdoc">Creates a random set of points distributed near the locus of the Lamniscate of Gerono.</div><div class="ttdef"><b>Definition:</b> kohonen_som_trace.c:319</div></div>
|
||||
<div class="ttc" id="agroup__kohonen__1d_html_gaeaeffbff2be4d5d15b0d4f10f846abde"><div class="ttname"><a href="../../d0/dcb/group__kohonen__1d.html#gaeaeffbff2be4d5d15b0d4f10f846abde">kohonen_som_tracer</a></div><div class="ttdeci">void kohonen_som_tracer(double **X, double *const *W, int num_samples, int num_features, int num_out, double alpha_min)</div><div class="ttdoc">Apply incremental algorithm with updating neighborhood and learning rates on all samples in the given...</div><div class="ttdef"><b>Definition:</b> kohonen_som_trace.c:179</div></div>
|
||||
<div class="ttc" id="agroup__kohonen__1d_html_gaffe776513b24d84b39af8ab0930fef7f"><div class="ttname"><a href="../../d0/dcb/group__kohonen__1d.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_trace.c:32</div></div>
|
||||
|
||||
@ -116,7 +116,7 @@ char </td><td class="memItemRight" valign="bottom"><a class="el" href="../.
|
||||
<tr class="memdesc:acc871ab6bfead702e983a7f9c412915f"><td class="mdescLeft"> </td><td class="mdescRight">Function to check if a number is prime. <br /></td></tr>
|
||||
<tr class="separator:acc871ab6bfead702e983a7f9c412915f"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:ae3d987cb2ad0ddb0c3caa4c2506a20e5"><td class="memItemLeft" align="right" valign="top"><a id="ae3d987cb2ad0ddb0c3caa4c2506a20e5"></a>
|
||||
unsigned long long </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d6d/problem__10_2sol1_8c.html#ae3d987cb2ad0ddb0c3caa4c2506a20e5">sum_of_primes</a> (unsigned long <a class="el" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>)</td></tr>
|
||||
unsigned long long </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d6d/problem__10_2sol1_8c.html#ae3d987cb2ad0ddb0c3caa4c2506a20e5">sum_of_primes</a> (unsigned long N)</td></tr>
|
||||
<tr class="memdesc:ae3d987cb2ad0ddb0c3caa4c2506a20e5"><td class="mdescLeft"> </td><td class="mdescRight">Computes sum of prime numbers less than N. <br /></td></tr>
|
||||
<tr class="separator:ae3d987cb2ad0ddb0c3caa4c2506a20e5"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a0ddf1224851353fc92bfbff6f499fa97"><td class="memItemLeft" align="right" valign="top"><a id="a0ddf1224851353fc92bfbff6f499fa97"></a>
|
||||
|
||||
@ -123,7 +123,7 @@ Functions</h2></td></tr>
|
||||
<tr class="memitem:ga7b84b14e60f47812b581d1f93057c85a"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/dcb/group__kohonen__1d.html#ga7b84b14e60f47812b581d1f93057c85a">save_nd_data</a> (const char *fname, double **X, int num_points, int num_features)</td></tr>
|
||||
<tr class="memdesc:ga7b84b14e60f47812b581d1f93057c85a"><td class="mdescLeft"> </td><td class="mdescRight">Save a given n-dimensional data martix to file. <a href="../../d0/dcb/group__kohonen__1d.html#ga7b84b14e60f47812b581d1f93057c85a">More...</a><br /></td></tr>
|
||||
<tr class="separator:ga7b84b14e60f47812b581d1f93057c85a"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:ga4a57a413a3cef286a7da6d4666575586"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/dcb/group__kohonen__1d.html#ga4a57a413a3cef286a7da6d4666575586">kohonen_get_min_1d</a> (double const *X, int <a class="el" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>, double *val, int *idx)</td></tr>
|
||||
<tr class="memitem:ga4a57a413a3cef286a7da6d4666575586"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/dcb/group__kohonen__1d.html#ga4a57a413a3cef286a7da6d4666575586">kohonen_get_min_1d</a> (double const *X, int N, double *val, int *idx)</td></tr>
|
||||
<tr class="memdesc:ga4a57a413a3cef286a7da6d4666575586"><td class="mdescLeft"> </td><td class="mdescRight">Get minimum value and index of the value in a vector. <a href="../../d0/dcb/group__kohonen__1d.html#ga4a57a413a3cef286a7da6d4666575586">More...</a><br /></td></tr>
|
||||
<tr class="separator:ga4a57a413a3cef286a7da6d4666575586"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:gae334493a0917a24736fe5ba82aa6f81f"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/dcb/group__kohonen__1d.html#gae334493a0917a24736fe5ba82aa6f81f">kohonen_update_weights</a> (double const *x, double *const *W, double *D, int num_out, int num_features, double alpha, int R)</td></tr>
|
||||
@ -237,7 +237,7 @@ Functions</h2></td></tr>
|
||||
<div class="fragment"><div class="line"><a name="l00105"></a><span class="lineno"> 105</span> {</div>
|
||||
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  val[0] = INFINITY; <span class="comment">// initial min value</span></div>
|
||||
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  </div>
|
||||
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>; i++) <span class="comment">// check each value</span></div>
|
||||
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < N; i++) <span class="comment">// check each value</span></div>
|
||||
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  {</div>
|
||||
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keywordflow">if</span> (X[i] < val[0]) <span class="comment">// if a lower value is found</span></div>
|
||||
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  { <span class="comment">// save the value and its index</span></div>
|
||||
@ -537,7 +537,6 @@ Here is the call graph for this function:</div>
|
||||
</div>
|
||||
</div><!-- contents -->
|
||||
</div><!-- doc-content -->
|
||||
<div class="ttc" id="aproblem__13_2sol1_8c_html_a0240ac851181b84ac374872dc5434ee4"><div class="ttname"><a href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a></div><div class="ttdeci">#define N</div><div class="ttdoc">number of digits of the large number</div><div class="ttdef"><b>Definition:</b> sol1.c:109</div></div>
|
||||
<div class="ttc" id="agroup__kohonen__1d_html_gae334493a0917a24736fe5ba82aa6f81f"><div class="ttname"><a href="../../d0/dcb/group__kohonen__1d.html#gae334493a0917a24736fe5ba82aa6f81f">kohonen_update_weights</a></div><div class="ttdeci">void kohonen_update_weights(double const *x, double *const *W, double *D, int num_out, int num_features, double alpha, int R)</div><div class="ttdoc">Update weights of the SOM using Kohonen algorithm.</div><div class="ttdef"><b>Definition:</b> kohonen_som_trace.c:129</div></div>
|
||||
<div class="ttc" id="agroup__kohonen__1d_html_gac6afabdc09a49a433ee19d8a9486056d"><div class="ttname"><a href="../../d0/dcb/group__kohonen__1d.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_trace.c:36</div></div>
|
||||
<div class="ttc" id="agroup__kohonen__1d_html_gaffe776513b24d84b39af8ab0930fef7f"><div class="ttname"><a href="../../d0/dcb/group__kohonen__1d.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_trace.c:32</div></div>
|
||||
|
||||
@ -136,7 +136,7 @@ Functions</h2></td></tr>
|
||||
<tr class="memitem:ga49d35f68f5d11d8ef6f8cce0d0e7bcba"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/d6b/group__kohonen__2d.html#ga49d35f68f5d11d8ef6f8cce0d0e7bcba">save_u_matrix</a> (const char *fname, struct <a class="el" href="../../d8/db8/structkohonen__array__3d.html">kohonen_array_3d</a> *W)</td></tr>
|
||||
<tr class="memdesc:ga49d35f68f5d11d8ef6f8cce0d0e7bcba"><td class="mdescLeft"> </td><td class="mdescRight">Create the distance matrix or <a href="https://en.wikipedia.org/wiki/U-matrix">U-matrix</a> from the trained weights and save to disk. <a href="../../d1/d6b/group__kohonen__2d.html#ga49d35f68f5d11d8ef6f8cce0d0e7bcba">More...</a><br /></td></tr>
|
||||
<tr class="separator:ga49d35f68f5d11d8ef6f8cce0d0e7bcba"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:gadc22d512c00a9f5799ee067f4fb90b4b"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/d6b/group__kohonen__2d.html#gadc22d512c00a9f5799ee067f4fb90b4b">get_min_2d</a> (double **X, int <a class="el" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>, double *val, int *x_idx, int *y_idx)</td></tr>
|
||||
<tr class="memitem:gadc22d512c00a9f5799ee067f4fb90b4b"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/d6b/group__kohonen__2d.html#gadc22d512c00a9f5799ee067f4fb90b4b">get_min_2d</a> (double **X, int N, double *val, int *x_idx, int *y_idx)</td></tr>
|
||||
<tr class="memdesc:gadc22d512c00a9f5799ee067f4fb90b4b"><td class="mdescLeft"> </td><td class="mdescRight">Get minimum value and index of the value in a matrix. <a href="../../d1/d6b/group__kohonen__2d.html#gadc22d512c00a9f5799ee067f4fb90b4b">More...</a><br /></td></tr>
|
||||
<tr class="separator:gadc22d512c00a9f5799ee067f4fb90b4b"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:ga83abb572c60d202e100595a989dfe123"><td class="memItemLeft" align="right" valign="top">double </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/d6b/group__kohonen__2d.html#ga83abb572c60d202e100595a989dfe123">kohonen_update_weights</a> (const double *X, struct <a class="el" href="../../d8/db8/structkohonen__array__3d.html">kohonen_array_3d</a> *W, double **D, int num_out, int num_features, double alpha, int R)</td></tr>
|
||||
@ -256,9 +256,9 @@ Functions</h2></td></tr>
|
||||
<div class="fragment"><div class="line"><a name="l00205"></a><span class="lineno"> 205</span> {</div>
|
||||
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  val[0] = INFINITY; <span class="comment">// initial min value</span></div>
|
||||
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  </div>
|
||||
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>; i++) <span class="comment">// traverse each x-index</span></div>
|
||||
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < N; i++) <span class="comment">// traverse each x-index</span></div>
|
||||
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  {</div>
|
||||
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>; j++) <span class="comment">// traverse each y-index</span></div>
|
||||
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < N; j++) <span class="comment">// traverse each y-index</span></div>
|
||||
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  {</div>
|
||||
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="keywordflow">if</span> (X[i][j] < val[0]) <span class="comment">// if a lower value is found</span></div>
|
||||
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  { <span class="comment">// save the value and its index</span></div>
|
||||
@ -764,7 +764,6 @@ Here is the call graph for this function:</div>
|
||||
<div class="ttc" id="astructkohonen__array__3d_html_ad546baa2e81c6196d5f1dc0fe2e5bd59"><div class="ttname"><a href="../../d8/db8/structkohonen__array__3d.html#ad546baa2e81c6196d5f1dc0fe2e5bd59">kohonen_array_3d::data</a></div><div class="ttdeci">double * data</div><div class="ttdoc">pointer to data</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:52</div></div>
|
||||
<div class="ttc" id="astructkohonen__array__3d_html_a888d7e007b38c91c7933e12a9566af1d"><div class="ttname"><a href="../../d8/db8/structkohonen__array__3d.html#a888d7e007b38c91c7933e12a9566af1d">kohonen_array_3d::dim2</a></div><div class="ttdeci">int dim2</div><div class="ttdoc">lengths of second dimension</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:50</div></div>
|
||||
<div class="ttc" id="astructkohonen__array__3d_html_a160f14830bdfbbf9f422f382ee754dbf"><div class="ttname"><a href="../../d8/db8/structkohonen__array__3d.html#a160f14830bdfbbf9f422f382ee754dbf">kohonen_array_3d::dim3</a></div><div class="ttdeci">int dim3</div><div class="ttdoc">lengths of thirddimension</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:51</div></div>
|
||||
<div class="ttc" id="aproblem__13_2sol1_8c_html_a0240ac851181b84ac374872dc5434ee4"><div class="ttname"><a href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a></div><div class="ttdeci">#define N</div><div class="ttdoc">number of digits of the large number</div><div class="ttdef"><b>Definition:</b> sol1.c:109</div></div>
|
||||
<div class="ttc" id="agroup__kohonen__2d_html_gadc22d512c00a9f5799ee067f4fb90b4b"><div class="ttname"><a href="../../d1/d6b/group__kohonen__2d.html#gadc22d512c00a9f5799ee067f4fb90b4b">get_min_2d</a></div><div class="ttdeci">void get_min_2d(double **X, int N, double *val, int *x_idx, int *y_idx)</div><div class="ttdoc">Get minimum value and index of the value in a matrix.</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:204</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="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>
|
||||
|
||||
@ -147,7 +147,7 @@ Functions</h2></td></tr>
|
||||
<tr class="memitem:ga49d35f68f5d11d8ef6f8cce0d0e7bcba"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/d6b/group__kohonen__2d.html#ga49d35f68f5d11d8ef6f8cce0d0e7bcba">save_u_matrix</a> (const char *fname, struct <a class="el" href="../../d8/db8/structkohonen__array__3d.html">kohonen_array_3d</a> *W)</td></tr>
|
||||
<tr class="memdesc:ga49d35f68f5d11d8ef6f8cce0d0e7bcba"><td class="mdescLeft"> </td><td class="mdescRight">Create the distance matrix or <a href="https://en.wikipedia.org/wiki/U-matrix">U-matrix</a> from the trained weights and save to disk. <a href="../../d1/d6b/group__kohonen__2d.html#ga49d35f68f5d11d8ef6f8cce0d0e7bcba">More...</a><br /></td></tr>
|
||||
<tr class="separator:ga49d35f68f5d11d8ef6f8cce0d0e7bcba"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:gadc22d512c00a9f5799ee067f4fb90b4b"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/d6b/group__kohonen__2d.html#gadc22d512c00a9f5799ee067f4fb90b4b">get_min_2d</a> (double **X, int <a class="el" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>, double *val, int *x_idx, int *y_idx)</td></tr>
|
||||
<tr class="memitem:gadc22d512c00a9f5799ee067f4fb90b4b"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/d6b/group__kohonen__2d.html#gadc22d512c00a9f5799ee067f4fb90b4b">get_min_2d</a> (double **X, int N, double *val, int *x_idx, int *y_idx)</td></tr>
|
||||
<tr class="memdesc:gadc22d512c00a9f5799ee067f4fb90b4b"><td class="mdescLeft"> </td><td class="mdescRight">Get minimum value and index of the value in a matrix. <a href="../../d1/d6b/group__kohonen__2d.html#gadc22d512c00a9f5799ee067f4fb90b4b">More...</a><br /></td></tr>
|
||||
<tr class="separator:gadc22d512c00a9f5799ee067f4fb90b4b"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:ga83abb572c60d202e100595a989dfe123"><td class="memItemLeft" align="right" valign="top">double </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/d6b/group__kohonen__2d.html#ga83abb572c60d202e100595a989dfe123">kohonen_update_weights</a> (const double *X, struct <a class="el" href="../../d8/db8/structkohonen__array__3d.html">kohonen_array_3d</a> *W, double **D, int num_out, int num_features, double alpha, int R)</td></tr>
|
||||
@ -156,19 +156,19 @@ Functions</h2></td></tr>
|
||||
<tr class="memitem:gacb42eda8af6ebd6a141a34ab00a0b710"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/d6b/group__kohonen__2d.html#gacb42eda8af6ebd6a141a34ab00a0b710">kohonen_som</a> (double **X, struct <a class="el" href="../../d8/db8/structkohonen__array__3d.html">kohonen_array_3d</a> *W, int num_samples, int num_features, int num_out, double alpha_min)</td></tr>
|
||||
<tr class="memdesc:gacb42eda8af6ebd6a141a34ab00a0b710"><td class="mdescLeft"> </td><td class="mdescRight">Apply incremental algorithm with updating neighborhood and learning rates on all samples in the given datset. <a href="../../d1/d6b/group__kohonen__2d.html#gacb42eda8af6ebd6a141a34ab00a0b710">More...</a><br /></td></tr>
|
||||
<tr class="separator:gacb42eda8af6ebd6a141a34ab00a0b710"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:adb5ded007be1fd666fab9affe6764018"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/df6/kohonen__som__topology_8c.html#adb5ded007be1fd666fab9affe6764018">test_2d_classes</a> (double *const *<a class="el" href="../../df/dea/structdata.html">data</a>, int <a class="el" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>)</td></tr>
|
||||
<tr class="memitem:adb5ded007be1fd666fab9affe6764018"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/df6/kohonen__som__topology_8c.html#adb5ded007be1fd666fab9affe6764018">test_2d_classes</a> (double *const *<a class="el" href="../../df/dea/structdata.html">data</a>, int N)</td></tr>
|
||||
<tr class="memdesc:adb5ded007be1fd666fab9affe6764018"><td class="mdescLeft"> </td><td class="mdescRight">Creates a random set of points distributed in four clusters in 3D space with centroids at the points. <a href="../../d2/df6/kohonen__som__topology_8c.html#adb5ded007be1fd666fab9affe6764018">More...</a><br /></td></tr>
|
||||
<tr class="separator:adb5ded007be1fd666fab9affe6764018"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a1440a7779ac56f47a3f355ce4a8c7da0"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/df6/kohonen__som__topology_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a> ()</td></tr>
|
||||
<tr class="memdesc:a1440a7779ac56f47a3f355ce4a8c7da0"><td class="mdescLeft"> </td><td class="mdescRight">Test that creates a random set of points distributed in four clusters in 2D space and trains an SOM that finds the topological pattern. <a href="../../d2/df6/kohonen__som__topology_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0">More...</a><br /></td></tr>
|
||||
<tr class="separator:a1440a7779ac56f47a3f355ce4a8c7da0"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:ad9e25202bb8b481461f932668f249dbc"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/df6/kohonen__som__topology_8c.html#ad9e25202bb8b481461f932668f249dbc">test_3d_classes1</a> (double *const *<a class="el" href="../../df/dea/structdata.html">data</a>, int <a class="el" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>)</td></tr>
|
||||
<tr class="memitem:ad9e25202bb8b481461f932668f249dbc"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/df6/kohonen__som__topology_8c.html#ad9e25202bb8b481461f932668f249dbc">test_3d_classes1</a> (double *const *<a class="el" href="../../df/dea/structdata.html">data</a>, int N)</td></tr>
|
||||
<tr class="memdesc:ad9e25202bb8b481461f932668f249dbc"><td class="mdescLeft"> </td><td class="mdescRight">Creates a random set of points distributed in four clusters in 3D space with centroids at the points. <a href="../../d2/df6/kohonen__som__topology_8c.html#ad9e25202bb8b481461f932668f249dbc">More...</a><br /></td></tr>
|
||||
<tr class="separator:ad9e25202bb8b481461f932668f249dbc"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a0283886819c7c140a023582b7269e2d0"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/df6/kohonen__som__topology_8c.html#a0283886819c7c140a023582b7269e2d0">test2</a> ()</td></tr>
|
||||
<tr class="memdesc:a0283886819c7c140a023582b7269e2d0"><td class="mdescLeft"> </td><td class="mdescRight">Test that creates a random set of points distributed in 4 clusters in 3D space and trains an SOM that finds the topological pattern. <a href="../../d2/df6/kohonen__som__topology_8c.html#a0283886819c7c140a023582b7269e2d0">More...</a><br /></td></tr>
|
||||
<tr class="separator:a0283886819c7c140a023582b7269e2d0"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a5bb02a8322d717ead1b11182c5f02a3a"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/df6/kohonen__som__topology_8c.html#a5bb02a8322d717ead1b11182c5f02a3a">test_3d_classes2</a> (double *const *<a class="el" href="../../df/dea/structdata.html">data</a>, int <a class="el" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>)</td></tr>
|
||||
<tr class="memitem:a5bb02a8322d717ead1b11182c5f02a3a"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/df6/kohonen__som__topology_8c.html#a5bb02a8322d717ead1b11182c5f02a3a">test_3d_classes2</a> (double *const *<a class="el" href="../../df/dea/structdata.html">data</a>, int N)</td></tr>
|
||||
<tr class="memdesc:a5bb02a8322d717ead1b11182c5f02a3a"><td class="mdescLeft"> </td><td class="mdescRight">Creates a random set of points distributed in four clusters in 3D space with centroids at the points. <a href="../../d2/df6/kohonen__som__topology_8c.html#a5bb02a8322d717ead1b11182c5f02a3a">More...</a><br /></td></tr>
|
||||
<tr class="separator:a5bb02a8322d717ead1b11182c5f02a3a"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a6d0455dd5c30adda100e95f0423c786e"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/df6/kohonen__som__topology_8c.html#a6d0455dd5c30adda100e95f0423c786e">test3</a> ()</td></tr>
|
||||
@ -251,12 +251,12 @@ int </td><td class="memItemRight" valign="bottom"><a class="el" href="../..
|
||||
<li><code>w12.csv</code>: trained SOM U-matrix </li>
|
||||
</ul>
|
||||
<div class="fragment"><div class="line"><a name="l00407"></a><span class="lineno"> 407</span> {</div>
|
||||
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  <span class="keywordtype">int</span> j, <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> = 300;</div>
|
||||
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  <span class="keywordtype">int</span> j, N = 300;</div>
|
||||
<div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  <span class="keywordtype">int</span> features = 2;</div>
|
||||
<div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  <span class="keywordtype">int</span> num_out = 30; <span class="comment">// image size - N x N</span></div>
|
||||
<div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  </div>
|
||||
<div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  <span class="comment">// 2D space, hence size = number of rows * 2</span></div>
|
||||
<div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  <span class="keywordtype">double</span> **X = (<span class="keywordtype">double</span> **)malloc(<a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> * <span class="keyword">sizeof</span>(<span class="keywordtype">double</span> *));</div>
|
||||
<div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  <span class="keywordtype">double</span> **X = (<span class="keywordtype">double</span> **)malloc(N * <span class="keyword">sizeof</span>(<span class="keywordtype">double</span> *));</div>
|
||||
<div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  </div>
|
||||
<div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  <span class="comment">// cluster nodex in 'x' * cluster nodes in 'y' * 2</span></div>
|
||||
<div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  <span class="keyword">struct </span><a class="code" href="../../d8/db8/structkohonen__array__3d.html">kohonen_array_3d</a> W;</div>
|
||||
@ -266,9 +266,9 @@ int </td><td class="memItemRight" valign="bottom"><a class="el" href="../..
|
||||
<div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  W.data = (<span class="keywordtype">double</span> *)malloc(num_out * num_out * features *</div>
|
||||
<div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  <span class="keyword">sizeof</span>(<span class="keywordtype">double</span>)); <span class="comment">// assign rows</span></div>
|
||||
<div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  </div>
|
||||
<div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="../../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a>(num_out, <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>); i++) <span class="comment">// loop till max(N, num_out)</span></div>
|
||||
<div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="../../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a>(num_out, N); i++) <span class="comment">// loop till max(N, num_out)</span></div>
|
||||
<div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  {</div>
|
||||
<div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  <span class="keywordflow">if</span> (i < <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>) <span class="comment">// only add new arrays if i < N</span></div>
|
||||
<div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  <span class="keywordflow">if</span> (i < N) <span class="comment">// only add new arrays if i < N</span></div>
|
||||
<div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  X[i] = (<span class="keywordtype">double</span> *)malloc(features * <span class="keyword">sizeof</span>(<span class="keywordtype">double</span>));</div>
|
||||
<div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  <span class="keywordflow">if</span> (i < num_out) <span class="comment">// only add new arrays if i < num_out</span></div>
|
||||
<div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  {</div>
|
||||
@ -287,13 +287,13 @@ int </td><td class="memItemRight" valign="bottom"><a class="el" href="../..
|
||||
<div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  }</div>
|
||||
<div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  }</div>
|
||||
<div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  </div>
|
||||
<div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  <a class="code" href="../../d2/df6/kohonen__som__topology_8c.html#adb5ded007be1fd666fab9affe6764018">test_2d_classes</a>(X, <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>); <span class="comment">// create test data around circumference of a circle</span></div>
|
||||
<div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  <a class="code" href="../../d1/d6b/group__kohonen__2d.html#ga6824dc6d973eb3339af7aef5fea78b0c">save_2d_data</a>(<span class="stringliteral">"test1.csv"</span>, X, <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>, features); <span class="comment">// save test data points</span></div>
|
||||
<div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  <a class="code" href="../../d2/df6/kohonen__som__topology_8c.html#adb5ded007be1fd666fab9affe6764018">test_2d_classes</a>(X, N); <span class="comment">// create test data around circumference of a circle</span></div>
|
||||
<div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  <a class="code" href="../../d1/d6b/group__kohonen__2d.html#ga6824dc6d973eb3339af7aef5fea78b0c">save_2d_data</a>(<span class="stringliteral">"test1.csv"</span>, X, N, features); <span class="comment">// save test data points</span></div>
|
||||
<div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  <a class="code" href="../../d1/d6b/group__kohonen__2d.html#ga49d35f68f5d11d8ef6f8cce0d0e7bcba">save_u_matrix</a>(<span class="stringliteral">"w11.csv"</span>, &W); <span class="comment">// save initial random weights</span></div>
|
||||
<div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  <a class="code" href="../../d1/d6b/group__kohonen__2d.html#gacb42eda8af6ebd6a141a34ab00a0b710">kohonen_som</a>(X, &W, <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>, features, num_out, 1e-4); <span class="comment">// train the SOM</span></div>
|
||||
<div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  <a class="code" href="../../d1/d6b/group__kohonen__2d.html#gacb42eda8af6ebd6a141a34ab00a0b710">kohonen_som</a>(X, &W, N, features, num_out, 1e-4); <span class="comment">// train the SOM</span></div>
|
||||
<div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  <a class="code" href="../../d1/d6b/group__kohonen__2d.html#ga49d35f68f5d11d8ef6f8cce0d0e7bcba">save_u_matrix</a>(<span class="stringliteral">"w12.csv"</span>, &W); <span class="comment">// save the resultant weights</span></div>
|
||||
<div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  </div>
|
||||
<div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>; i++) free(X[i]);</div>
|
||||
<div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < N; i++) free(X[i]);</div>
|
||||
<div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  free(X);</div>
|
||||
<div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  free(W.data);</div>
|
||||
<div class="line"><a name="l00453"></a><span class="lineno"> 453</span> }</div>
|
||||
@ -328,12 +328,12 @@ Here is the call graph for this function:</div>
|
||||
<li><code>w22.csv</code>: trained SOM U-matrix </li>
|
||||
</ul>
|
||||
<div class="fragment"><div class="line"><a name="l00507"></a><span class="lineno"> 507</span> {</div>
|
||||
<div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  <span class="keywordtype">int</span> j, <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> = 500;</div>
|
||||
<div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  <span class="keywordtype">int</span> j, N = 500;</div>
|
||||
<div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  <span class="keywordtype">int</span> features = 3;</div>
|
||||
<div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  <span class="keywordtype">int</span> num_out = 30; <span class="comment">// image size - N x N</span></div>
|
||||
<div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  </div>
|
||||
<div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  <span class="comment">// 3D space, hence size = number of rows * 3</span></div>
|
||||
<div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  <span class="keywordtype">double</span> **X = (<span class="keywordtype">double</span> **)malloc(<a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> * <span class="keyword">sizeof</span>(<span class="keywordtype">double</span> *));</div>
|
||||
<div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  <span class="keywordtype">double</span> **X = (<span class="keywordtype">double</span> **)malloc(N * <span class="keyword">sizeof</span>(<span class="keywordtype">double</span> *));</div>
|
||||
<div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  </div>
|
||||
<div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  <span class="comment">// cluster nodex in 'x' * cluster nodes in 'y' * 2</span></div>
|
||||
<div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  <span class="keyword">struct </span><a class="code" href="../../d8/db8/structkohonen__array__3d.html">kohonen_array_3d</a> W;</div>
|
||||
@ -343,9 +343,9 @@ Here is the call graph for this function:</div>
|
||||
<div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  W.data = (<span class="keywordtype">double</span> *)malloc(num_out * num_out * features *</div>
|
||||
<div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  <span class="keyword">sizeof</span>(<span class="keywordtype">double</span>)); <span class="comment">// assign rows</span></div>
|
||||
<div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  </div>
|
||||
<div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="../../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a>(num_out, <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>); i++) <span class="comment">// loop till max(N, num_out)</span></div>
|
||||
<div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="../../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a>(num_out, N); i++) <span class="comment">// loop till max(N, num_out)</span></div>
|
||||
<div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  {</div>
|
||||
<div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  <span class="keywordflow">if</span> (i < <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>) <span class="comment">// only add new arrays if i < N</span></div>
|
||||
<div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  <span class="keywordflow">if</span> (i < N) <span class="comment">// only add new arrays if i < N</span></div>
|
||||
<div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  X[i] = (<span class="keywordtype">double</span> *)malloc(features * <span class="keyword">sizeof</span>(<span class="keywordtype">double</span>));</div>
|
||||
<div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  <span class="keywordflow">if</span> (i < num_out) <span class="comment">// only add new arrays if i < num_out</span></div>
|
||||
<div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  {</div>
|
||||
@ -363,13 +363,13 @@ Here is the call graph for this function:</div>
|
||||
<div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  }</div>
|
||||
<div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  }</div>
|
||||
<div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  </div>
|
||||
<div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  <a class="code" href="../../d2/df6/kohonen__som__topology_8c.html#ad9e25202bb8b481461f932668f249dbc">test_3d_classes1</a>(X, <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>); <span class="comment">// create test data</span></div>
|
||||
<div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  <a class="code" href="../../d1/d6b/group__kohonen__2d.html#ga6824dc6d973eb3339af7aef5fea78b0c">save_2d_data</a>(<span class="stringliteral">"test2.csv"</span>, X, <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>, features); <span class="comment">// save test data points</span></div>
|
||||
<div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  <a class="code" href="../../d2/df6/kohonen__som__topology_8c.html#ad9e25202bb8b481461f932668f249dbc">test_3d_classes1</a>(X, N); <span class="comment">// create test data</span></div>
|
||||
<div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  <a class="code" href="../../d1/d6b/group__kohonen__2d.html#ga6824dc6d973eb3339af7aef5fea78b0c">save_2d_data</a>(<span class="stringliteral">"test2.csv"</span>, X, N, features); <span class="comment">// save test data points</span></div>
|
||||
<div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  <a class="code" href="../../d1/d6b/group__kohonen__2d.html#ga49d35f68f5d11d8ef6f8cce0d0e7bcba">save_u_matrix</a>(<span class="stringliteral">"w21.csv"</span>, &W); <span class="comment">// save initial random weights</span></div>
|
||||
<div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  <a class="code" href="../../d1/d6b/group__kohonen__2d.html#gacb42eda8af6ebd6a141a34ab00a0b710">kohonen_som</a>(X, &W, <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>, features, num_out, 1e-4); <span class="comment">// train the SOM</span></div>
|
||||
<div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  <a class="code" href="../../d1/d6b/group__kohonen__2d.html#gacb42eda8af6ebd6a141a34ab00a0b710">kohonen_som</a>(X, &W, N, features, num_out, 1e-4); <span class="comment">// train the SOM</span></div>
|
||||
<div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  <a class="code" href="../../d1/d6b/group__kohonen__2d.html#ga49d35f68f5d11d8ef6f8cce0d0e7bcba">save_u_matrix</a>(<span class="stringliteral">"w22.csv"</span>, &W); <span class="comment">// save the resultant weights</span></div>
|
||||
<div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  </div>
|
||||
<div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>; i++) free(X[i]);</div>
|
||||
<div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < N; i++) free(X[i]);</div>
|
||||
<div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  free(X);</div>
|
||||
<div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  free(W.data);</div>
|
||||
<div class="line"><a name="l00552"></a><span class="lineno"> 552</span> }</div>
|
||||
@ -404,10 +404,10 @@ Here is the call graph for this function:</div>
|
||||
<li><code>w32.csv</code>: trained SOM U-matrix </li>
|
||||
</ul>
|
||||
<div class="fragment"><div class="line"><a name="l00610"></a><span class="lineno"> 610</span> {</div>
|
||||
<div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  <span class="keywordtype">int</span> j, <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> = 500;</div>
|
||||
<div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  <span class="keywordtype">int</span> j, N = 500;</div>
|
||||
<div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  <span class="keywordtype">int</span> features = 3;</div>
|
||||
<div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  <span class="keywordtype">int</span> num_out = 30;</div>
|
||||
<div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  <span class="keywordtype">double</span> **X = (<span class="keywordtype">double</span> **)malloc(<a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> * <span class="keyword">sizeof</span>(<span class="keywordtype">double</span> *));</div>
|
||||
<div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  <span class="keywordtype">double</span> **X = (<span class="keywordtype">double</span> **)malloc(N * <span class="keyword">sizeof</span>(<span class="keywordtype">double</span> *));</div>
|
||||
<div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  </div>
|
||||
<div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  <span class="comment">// cluster nodex in 'x' * cluster nodes in 'y' * 2</span></div>
|
||||
<div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  <span class="keyword">struct </span><a class="code" href="../../d8/db8/structkohonen__array__3d.html">kohonen_array_3d</a> W;</div>
|
||||
@ -417,9 +417,9 @@ Here is the call graph for this function:</div>
|
||||
<div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  W.data = (<span class="keywordtype">double</span> *)malloc(num_out * num_out * features *</div>
|
||||
<div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  <span class="keyword">sizeof</span>(<span class="keywordtype">double</span>)); <span class="comment">// assign rows</span></div>
|
||||
<div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  </div>
|
||||
<div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="../../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a>(num_out, <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>); i++) <span class="comment">// loop till max(N, num_out)</span></div>
|
||||
<div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="../../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a>(num_out, N); i++) <span class="comment">// loop till max(N, num_out)</span></div>
|
||||
<div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  {</div>
|
||||
<div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  <span class="keywordflow">if</span> (i < <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>) <span class="comment">// only add new arrays if i < N</span></div>
|
||||
<div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  <span class="keywordflow">if</span> (i < N) <span class="comment">// only add new arrays if i < N</span></div>
|
||||
<div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  X[i] = (<span class="keywordtype">double</span> *)malloc(features * <span class="keyword">sizeof</span>(<span class="keywordtype">double</span>));</div>
|
||||
<div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  <span class="keywordflow">if</span> (i < num_out) <span class="comment">// only add new arrays if i < num_out</span></div>
|
||||
<div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  {</div>
|
||||
@ -438,13 +438,13 @@ Here is the call graph for this function:</div>
|
||||
<div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  }</div>
|
||||
<div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  }</div>
|
||||
<div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  </div>
|
||||
<div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  <a class="code" href="../../d2/df6/kohonen__som__topology_8c.html#a5bb02a8322d717ead1b11182c5f02a3a">test_3d_classes2</a>(X, <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>); <span class="comment">// create test data around the lamniscate</span></div>
|
||||
<div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  <a class="code" href="../../d1/d6b/group__kohonen__2d.html#ga6824dc6d973eb3339af7aef5fea78b0c">save_2d_data</a>(<span class="stringliteral">"test3.csv"</span>, X, <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>, features); <span class="comment">// save test data points</span></div>
|
||||
<div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  <a class="code" href="../../d2/df6/kohonen__som__topology_8c.html#a5bb02a8322d717ead1b11182c5f02a3a">test_3d_classes2</a>(X, N); <span class="comment">// create test data around the lamniscate</span></div>
|
||||
<div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  <a class="code" href="../../d1/d6b/group__kohonen__2d.html#ga6824dc6d973eb3339af7aef5fea78b0c">save_2d_data</a>(<span class="stringliteral">"test3.csv"</span>, X, N, features); <span class="comment">// save test data points</span></div>
|
||||
<div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  <a class="code" href="../../d1/d6b/group__kohonen__2d.html#ga49d35f68f5d11d8ef6f8cce0d0e7bcba">save_u_matrix</a>(<span class="stringliteral">"w31.csv"</span>, &W); <span class="comment">// save initial random weights</span></div>
|
||||
<div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  <a class="code" href="../../d1/d6b/group__kohonen__2d.html#gacb42eda8af6ebd6a141a34ab00a0b710">kohonen_som</a>(X, &W, <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>, features, num_out, 0.01); <span class="comment">// train the SOM</span></div>
|
||||
<div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  <a class="code" href="../../d1/d6b/group__kohonen__2d.html#gacb42eda8af6ebd6a141a34ab00a0b710">kohonen_som</a>(X, &W, N, features, num_out, 0.01); <span class="comment">// train the SOM</span></div>
|
||||
<div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  <a class="code" href="../../d1/d6b/group__kohonen__2d.html#ga49d35f68f5d11d8ef6f8cce0d0e7bcba">save_u_matrix</a>(<span class="stringliteral">"w32.csv"</span>, &W); <span class="comment">// save the resultant weights</span></div>
|
||||
<div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  </div>
|
||||
<div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>; i++) free(X[i]);</div>
|
||||
<div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < N; i++) free(X[i]);</div>
|
||||
<div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  free(X);</div>
|
||||
<div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  free(W.data);</div>
|
||||
<div class="line"><a name="l00654"></a><span class="lineno"> 654</span> }</div>
|
||||
@ -512,7 +512,7 @@ Here is the call graph for this function:</div>
|
||||
<div class="line"><a name="l00379"></a><span class="lineno"> 379</span> <span class="preprocessor">#ifdef _OPENMP</span></div>
|
||||
<div class="line"><a name="l00380"></a><span class="lineno"> 380</span> <span class="preprocessor">#pragma omp for</span></div>
|
||||
<div class="line"><a name="l00381"></a><span class="lineno"> 381</span> <span class="preprocessor">#endif</span></div>
|
||||
<div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  <span class="keywordflow">for</span> (i = 0; i < <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>; i++)</div>
|
||||
<div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  <span class="keywordflow">for</span> (i = 0; i < N; i++)</div>
|
||||
<div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  {</div>
|
||||
<div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  <span class="keywordtype">int</span> <span class="keyword">class </span>=</div>
|
||||
<div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  rand() % num_classes; <span class="comment">// select a random class for the point</span></div>
|
||||
@ -591,7 +591,7 @@ Here is the call graph for this function:</div>
|
||||
<div class="line"><a name="l00478"></a><span class="lineno"> 478</span> <span class="preprocessor">#ifdef _OPENMP</span></div>
|
||||
<div class="line"><a name="l00479"></a><span class="lineno"> 479</span> <span class="preprocessor">#pragma omp for</span></div>
|
||||
<div class="line"><a name="l00480"></a><span class="lineno"> 480</span> <span class="preprocessor">#endif</span></div>
|
||||
<div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  <span class="keywordflow">for</span> (i = 0; i < <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>; i++)</div>
|
||||
<div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  <span class="keywordflow">for</span> (i = 0; i < N; i++)</div>
|
||||
<div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  {</div>
|
||||
<div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  <span class="keywordtype">int</span> <span class="keyword">class </span>=</div>
|
||||
<div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  rand() % num_classes; <span class="comment">// select a random class for the point</span></div>
|
||||
@ -675,7 +675,7 @@ Here is the call graph for this function:</div>
|
||||
<div class="line"><a name="l00581"></a><span class="lineno"> 581</span> <span class="preprocessor">#ifdef _OPENMP</span></div>
|
||||
<div class="line"><a name="l00582"></a><span class="lineno"> 582</span> <span class="preprocessor">#pragma omp for</span></div>
|
||||
<div class="line"><a name="l00583"></a><span class="lineno"> 583</span> <span class="preprocessor">#endif</span></div>
|
||||
<div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  <span class="keywordflow">for</span> (i = 0; i < <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>; i++)</div>
|
||||
<div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  <span class="keywordflow">for</span> (i = 0; i < N; i++)</div>
|
||||
<div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  {</div>
|
||||
<div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  <span class="keywordtype">int</span> <span class="keyword">class </span>=</div>
|
||||
<div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  rand() % num_classes; <span class="comment">// select a random class for the point</span></div>
|
||||
@ -707,7 +707,6 @@ Here is the call graph for this function:</div>
|
||||
<div class="ttc" id="agroup__kohonen__2d_html_ga6824dc6d973eb3339af7aef5fea78b0c"><div class="ttname"><a href="../../d1/d6b/group__kohonen__2d.html#ga6824dc6d973eb3339af7aef5fea78b0c">save_2d_data</a></div><div class="ttdeci">int save_2d_data(const char *fname, double **X, int num_points, int num_features)</div><div class="ttdoc">Save a given n-dimensional data martix to file.</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:102</div></div>
|
||||
<div class="ttc" id="agroup__kohonen__2d_html_gaf5ce14f026d6d231bef29161bac2b485"><div class="ttname"><a href="../../d1/d6b/group__kohonen__2d.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a></div><div class="ttdeci">double _random(double a, double b)</div><div class="ttdoc">Helper function to generate a random number in a given interval.</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:87</div></div>
|
||||
<div class="ttc" id="akohonen__som__topology_8c_html_a5bb02a8322d717ead1b11182c5f02a3a"><div class="ttname"><a href="../../d2/df6/kohonen__som__topology_8c.html#a5bb02a8322d717ead1b11182c5f02a3a">test_3d_classes2</a></div><div class="ttdeci">void test_3d_classes2(double *const *data, int N)</div><div class="ttdoc">Creates a random set of points distributed in four clusters in 3D space with centroids at the points.</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:564</div></div>
|
||||
<div class="ttc" id="aproblem__13_2sol1_8c_html_a0240ac851181b84ac374872dc5434ee4"><div class="ttname"><a href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a></div><div class="ttdeci">#define N</div><div class="ttdoc">number of digits of the large number</div><div class="ttdef"><b>Definition:</b> sol1.c:109</div></div>
|
||||
<div class="ttc" id="astructkohonen__array__3d_html"><div class="ttname"><a href="../../d8/db8/structkohonen__array__3d.html">kohonen_array_3d</a></div><div class="ttdoc">to store info regarding 3D arrays</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:48</div></div>
|
||||
<div class="ttc" id="agroup__kohonen__2d_html_gacb42eda8af6ebd6a141a34ab00a0b710"><div class="ttname"><a href="../../d1/d6b/group__kohonen__2d.html#gacb42eda8af6ebd6a141a34ab00a0b710">kohonen_som</a></div><div class="ttdeci">void kohonen_som(double **X, struct kohonen_array_3d *W, int num_samples, int num_features, int num_out, double alpha_min)</div><div class="ttdoc">Apply incremental algorithm with updating neighborhood and learning rates on all samples in the given...</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:314</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>
|
||||
|
||||
@ -119,7 +119,7 @@ This graph shows which files directly or indirectly include this file:</div>
|
||||
<table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
|
||||
Functions</h2></td></tr>
|
||||
<tr class="memitem:a90562ce8c3707401e9c5809dece68d6a"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d68/qr__decompose_8h.html#a90562ce8c3707401e9c5809dece68d6a">print_matrix</a> (double **A, int M, int <a class="el" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>)</td></tr>
|
||||
<tr class="memitem:a90562ce8c3707401e9c5809dece68d6a"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d68/qr__decompose_8h.html#a90562ce8c3707401e9c5809dece68d6a">print_matrix</a> (double **A, int M, int N)</td></tr>
|
||||
<tr class="memdesc:a90562ce8c3707401e9c5809dece68d6a"><td class="mdescLeft"> </td><td class="mdescRight">function to display matrix on stdout <a href="../../d4/d68/qr__decompose_8h.html#a90562ce8c3707401e9c5809dece68d6a">More...</a><br /></td></tr>
|
||||
<tr class="separator:a90562ce8c3707401e9c5809dece68d6a"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a3a584b79941a43d775f9d4ce446dbe05"><td class="memItemLeft" align="right" valign="top">double </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d68/qr__decompose_8h.html#a3a584b79941a43d775f9d4ce446dbe05">vector_dot</a> (double *a, double *b, int <a class="el" href="../../df/db3/struct_l.html">L</a>)</td></tr>
|
||||
@ -134,7 +134,7 @@ Functions</h2></td></tr>
|
||||
<tr class="memitem:a6b6a0e75e75ff7919057dd275bb69145"><td class="memItemLeft" align="right" valign="top">double * </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d68/qr__decompose_8h.html#a6b6a0e75e75ff7919057dd275bb69145">vector_sub</a> (double *a, double *b, double *out, int <a class="el" href="../../df/db3/struct_l.html">L</a>)</td></tr>
|
||||
<tr class="memdesc:a6b6a0e75e75ff7919057dd275bb69145"><td class="mdescLeft"> </td><td class="mdescRight">Compute vector subtraction. <a href="../../d4/d68/qr__decompose_8h.html#a6b6a0e75e75ff7919057dd275bb69145">More...</a><br /></td></tr>
|
||||
<tr class="separator:a6b6a0e75e75ff7919057dd275bb69145"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a45c7640d9d22c89c11beb1f567843c56"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d68/qr__decompose_8h.html#a45c7640d9d22c89c11beb1f567843c56">qr_decompose</a> (double **A, double **Q, double **R, int M, int <a class="el" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>)</td></tr>
|
||||
<tr class="memitem:a45c7640d9d22c89c11beb1f567843c56"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d68/qr__decompose_8h.html#a45c7640d9d22c89c11beb1f567843c56">qr_decompose</a> (double **A, double **Q, double **R, int M, int N)</td></tr>
|
||||
<tr class="memdesc:a45c7640d9d22c89c11beb1f567843c56"><td class="mdescLeft"> </td><td class="mdescRight">Decompose matrix \(A\) using <a href="https://en.wikipedia.org/wiki/QR_decomposition">Gram-Schmidt process</a>. <a href="../../d4/d68/qr__decompose_8h.html#a45c7640d9d22c89c11beb1f567843c56">More...</a><br /></td></tr>
|
||||
<tr class="separator:a45c7640d9d22c89c11beb1f567843c56"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table>
|
||||
@ -186,7 +186,7 @@ Functions</h2></td></tr>
|
||||
<div class="fragment"><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> {</div>
|
||||
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> row = 0; row < M; row++)</div>
|
||||
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span>  {</div>
|
||||
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> col = 0; col < <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>; col++) printf(<span class="stringliteral">"% 9.3g\t"</span>, A[row][col]);</div>
|
||||
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> col = 0; col < N; col++) printf(<span class="stringliteral">"% 9.3g\t"</span>, A[row][col]);</div>
|
||||
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  putchar(<span class="charliteral">'\n'</span>);</div>
|
||||
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span>  }</div>
|
||||
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  putchar(<span class="charliteral">'\n'</span>);</div>
|
||||
@ -256,7 +256,7 @@ Functions</h2></td></tr>
|
||||
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="keywordtype">double</span> *col_vector = (<span class="keywordtype">double</span> *)malloc(M * <span class="keyword">sizeof</span>(<span class="keywordtype">double</span>));</div>
|
||||
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="keywordtype">double</span> *col_vector2 = (<span class="keywordtype">double</span> *)malloc(M * <span class="keyword">sizeof</span>(<span class="keywordtype">double</span>));</div>
|
||||
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="keywordtype">double</span> *tmp_vector = (<span class="keywordtype">double</span> *)malloc(M * <span class="keyword">sizeof</span>(<span class="keywordtype">double</span>));</div>
|
||||
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>;</div>
|
||||
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < N;</div>
|
||||
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  i++) <span class="comment">/* for each column => R is a square matrix of NxN */</span></div>
|
||||
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  {</div>
|
||||
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="keywordtype">int</span> j;</div>
|
||||
@ -293,7 +293,7 @@ Functions</h2></td></tr>
|
||||
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  </div>
|
||||
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="comment">/* compute upper triangular values of R */</span></div>
|
||||
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> kk = 0; kk < M; kk++) col_vector[kk] = Q[kk][i];</div>
|
||||
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> k = i; k < <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>; k++)</div>
|
||||
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> k = i; k < N; k++)</div>
|
||||
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  {</div>
|
||||
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> kk = 0; kk < M; kk++) col_vector2[kk] = A[kk][k];</div>
|
||||
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  R[i][k] = <a class="code" href="../../d4/d68/qr__decompose_8h.html#a3a584b79941a43d775f9d4ce446dbe05">vector_dot</a>(col_vector, col_vector2, M);</div>
|
||||
@ -541,7 +541,6 @@ Here is the call graph for this function:</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="aqr__decompose_8h_html_abeec1f78a7a7e7251687e75340331212"><div class="ttname"><a href="../../d4/d68/qr__decompose_8h.html#abeec1f78a7a7e7251687e75340331212">vector_mag</a></div><div class="ttdeci">double vector_mag(double *vector, int L)</div><div class="ttdoc">Compute magnitude of vector.</div><div class="ttdef"><b>Definition:</b> qr_decompose.h:64</div></div>
|
||||
<div class="ttc" id="aqr__decompose_8h_html_a82b20e027437df768d7e994cf4cae29f"><div class="ttname"><a href="../../d4/d68/qr__decompose_8h.html#a82b20e027437df768d7e994cf4cae29f">vector_proj</a></div><div class="ttdeci">double * vector_proj(double *a, double *b, double *out, int L)</div><div class="ttdoc">Compute projection of vector on defined as.</div><div class="ttdef"><b>Definition:</b> qr_decompose.h:76</div></div>
|
||||
<div class="ttc" id="aproblem__13_2sol1_8c_html_a0240ac851181b84ac374872dc5434ee4"><div class="ttname"><a href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a></div><div class="ttdeci">#define N</div><div class="ttdoc">number of digits of the large number</div><div class="ttdef"><b>Definition:</b> sol1.c:109</div></div>
|
||||
<div class="ttc" id="aqr__decompose_8h_html_a3a584b79941a43d775f9d4ce446dbe05"><div class="ttname"><a href="../../d4/d68/qr__decompose_8h.html#a3a584b79941a43d775f9d4ce446dbe05">vector_dot</a></div><div class="ttdeci">double vector_dot(double *a, double *b, int L)</div><div class="ttdoc">Compute dot product of two vectors of equal lengths.</div><div class="ttdef"><b>Definition:</b> qr_decompose.h:43</div></div>
|
||||
<div class="ttc" id="aqr__decompose_8h_html_a6b6a0e75e75ff7919057dd275bb69145"><div class="ttname"><a href="../../d4/d68/qr__decompose_8h.html#a6b6a0e75e75ff7919057dd275bb69145">vector_sub</a></div><div class="ttdeci">double * vector_sub(double *a, double *b, double *out, int L)</div><div class="ttdoc">Compute vector subtraction.</div><div class="ttdef"><b>Definition:</b> qr_decompose.h:101</div></div>
|
||||
<!-- start footer part -->
|
||||
|
||||
@ -117,11 +117,11 @@ $(document).ready(function(){initNavTree('d4/d68/qr__decompose_8h_source.html','
|
||||
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment"> */</span></div>
|
||||
<div class="line"><a name="l00022"></a><span class="lineno"><a class="line" href="../../d4/d68/qr__decompose_8h.html#a90562ce8c3707401e9c5809dece68d6a"> 22</a></span> <span class="keywordtype">void</span> <a class="code" href="../../d4/d68/qr__decompose_8h.html#a90562ce8c3707401e9c5809dece68d6a">print_matrix</a>(<span class="keywordtype">double</span> **A, <span class="comment">/**< matrix to print */</span></div>
|
||||
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span>  <span class="keywordtype">int</span> M, <span class="comment">/**< number of rows of matrix */</span></div>
|
||||
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span>  <span class="keywordtype">int</span> <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>) <span class="comment">/**< number of columns of matrix */</span></div>
|
||||
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span>  <span class="keywordtype">int</span> <a class="code" href="../../dc/d18/structsudoku.html#a160365012280c3e10f1b31e914e8f129">N</a>) <span class="comment">/**< number of columns of matrix */</span></div>
|
||||
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> {</div>
|
||||
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> row = 0; row < M; row++)</div>
|
||||
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span>  {</div>
|
||||
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> col = 0; col < <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>; col++) printf(<span class="stringliteral">"% 9.3g\t"</span>, A[row][col]);</div>
|
||||
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> col = 0; col < <a class="code" href="../../dc/d18/structsudoku.html#a160365012280c3e10f1b31e914e8f129">N</a>; col++) printf(<span class="stringliteral">"% 9.3g\t"</span>, A[row][col]);</div>
|
||||
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  putchar(<span class="charliteral">'\n'</span>);</div>
|
||||
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span>  }</div>
|
||||
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  putchar(<span class="charliteral">'\n'</span>);</div>
|
||||
@ -239,13 +239,13 @@ $(document).ready(function(){initNavTree('d4/d68/qr__decompose_8h_source.html','
|
||||
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="keywordtype">double</span> **Q, <span class="comment">/**< output decomposed matrix */</span></div>
|
||||
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="keywordtype">double</span> **R, <span class="comment">/**< output decomposed matrix */</span></div>
|
||||
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="keywordtype">int</span> M, <span class="comment">/**< number of rows of matrix A */</span></div>
|
||||
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="keywordtype">int</span> <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> <span class="comment">/**< number of columns of matrix A */</span></div>
|
||||
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="keywordtype">int</span> <a class="code" href="../../dc/d18/structsudoku.html#a160365012280c3e10f1b31e914e8f129">N</a> <span class="comment">/**< number of columns of matrix A */</span></div>
|
||||
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span> )</div>
|
||||
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span> {</div>
|
||||
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="keywordtype">double</span> *col_vector = (<span class="keywordtype">double</span> *)malloc(M * <span class="keyword">sizeof</span>(<span class="keywordtype">double</span>));</div>
|
||||
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="keywordtype">double</span> *col_vector2 = (<span class="keywordtype">double</span> *)malloc(M * <span class="keyword">sizeof</span>(<span class="keywordtype">double</span>));</div>
|
||||
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="keywordtype">double</span> *tmp_vector = (<span class="keywordtype">double</span> *)malloc(M * <span class="keyword">sizeof</span>(<span class="keywordtype">double</span>));</div>
|
||||
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>;</div>
|
||||
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="../../dc/d18/structsudoku.html#a160365012280c3e10f1b31e914e8f129">N</a>;</div>
|
||||
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  i++) <span class="comment">/* for each column => R is a square matrix of NxN */</span></div>
|
||||
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  {</div>
|
||||
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="keywordtype">int</span> j;</div>
|
||||
@ -282,7 +282,7 @@ $(document).ready(function(){initNavTree('d4/d68/qr__decompose_8h_source.html','
|
||||
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  </div>
|
||||
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="comment">/* compute upper triangular values of R */</span></div>
|
||||
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> kk = 0; kk < M; kk++) col_vector[kk] = Q[kk][i];</div>
|
||||
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> k = i; k < <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>; k++)</div>
|
||||
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> k = i; k < <a class="code" href="../../dc/d18/structsudoku.html#a160365012280c3e10f1b31e914e8f129">N</a>; k++)</div>
|
||||
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  {</div>
|
||||
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> kk = 0; kk < M; kk++) col_vector2[kk] = A[kk][k];</div>
|
||||
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  R[i][k] = <a class="code" href="../../d4/d68/qr__decompose_8h.html#a3a584b79941a43d775f9d4ce446dbe05">vector_dot</a>(col_vector, col_vector2, M);</div>
|
||||
@ -341,7 +341,6 @@ $(document).ready(function(){initNavTree('d4/d68/qr__decompose_8h_source.html','
|
||||
<div class="ttc" id="astructkohonen__array__3d_html_a888d7e007b38c91c7933e12a9566af1d"><div class="ttname"><a href="../../d8/db8/structkohonen__array__3d.html#a888d7e007b38c91c7933e12a9566af1d">kohonen_array_3d::dim2</a></div><div class="ttdeci">int dim2</div><div class="ttdoc">lengths of second dimension</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:50</div></div>
|
||||
<div class="ttc" id="akohonen__som__topology_8c_html_a5bb02a8322d717ead1b11182c5f02a3a"><div class="ttname"><a href="../../d2/df6/kohonen__som__topology_8c.html#a5bb02a8322d717ead1b11182c5f02a3a">test_3d_classes2</a></div><div class="ttdeci">void test_3d_classes2(double *const *data, int N)</div><div class="ttdoc">Creates a random set of points distributed in four clusters in 3D space with centroids at the points.</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:564</div></div>
|
||||
<div class="ttc" id="astructkohonen__array__3d_html_a160f14830bdfbbf9f422f382ee754dbf"><div class="ttname"><a href="../../d8/db8/structkohonen__array__3d.html#a160f14830bdfbbf9f422f382ee754dbf">kohonen_array_3d::dim3</a></div><div class="ttdeci">int dim3</div><div class="ttdoc">lengths of thirddimension</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:51</div></div>
|
||||
<div class="ttc" id="aproblem__13_2sol1_8c_html_a0240ac851181b84ac374872dc5434ee4"><div class="ttname"><a href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a></div><div class="ttdeci">#define N</div><div class="ttdoc">number of digits of the large number</div><div class="ttdef"><b>Definition:</b> sol1.c:109</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="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="adurand__kerner__roots_8c_html_afa5b04ce11475d67049cba8273741fb7"><div class="ttname"><a href="../../da/d38/durand__kerner__roots_8c.html#afa5b04ce11475d67049cba8273741fb7">complex_str</a></div><div class="ttdeci">const char * complex_str(long double complex x)</div><div class="ttdoc">create a textual form of complex number</div><div class="ttdef"><b>Definition:</b> durand_kerner_roots.c:66</div></div>
|
||||
|
||||
@ -117,28 +117,28 @@ Macros</h2></td></tr>
|
||||
<tr class="memitem:aacbb9e1f38be71e22df1584a37c56693"><td class="memItemLeft" align="right" valign="top"><a id="aacbb9e1f38be71e22df1584a37c56693"></a>
|
||||
#define </td><td class="memItemRight" valign="bottom"><b>__STDC_FORMAT_MACROS</b></td></tr>
|
||||
<tr class="separator:aacbb9e1f38be71e22df1584a37c56693"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:aca7d5718ab8c38506adb3bef2469b319"><td class="memItemLeft" align="right" valign="top"><a id="aca7d5718ab8c38506adb3bef2469b319"></a>
|
||||
#define </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d83/problem__401_2sol1_8c.html#aca7d5718ab8c38506adb3bef2469b319">MOD</a>   (uint64_t)1e9</td></tr>
|
||||
<tr class="memdesc:aca7d5718ab8c38506adb3bef2469b319"><td class="mdescLeft"> </td><td class="mdescRight">modulo limit <br /></td></tr>
|
||||
<tr class="separator:aca7d5718ab8c38506adb3bef2469b319"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:adf2a0717e3307419a9d7c52707f5631e"><td class="memItemLeft" align="right" valign="top"><a id="adf2a0717e3307419a9d7c52707f5631e"></a>
|
||||
#define </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d83/problem__401_2sol1_8c.html#adf2a0717e3307419a9d7c52707f5631e">MAX_L</a>   5000</td></tr>
|
||||
<tr class="memdesc:adf2a0717e3307419a9d7c52707f5631e"><td class="mdescLeft"> </td><td class="mdescRight">chunk size of array allocation <br /></td></tr>
|
||||
<tr class="separator:adf2a0717e3307419a9d7c52707f5631e"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:ade1bdf2529e3c58f53bfb4d844f3a9d3"><td class="memItemLeft" align="right" valign="top"><a id="ade1bdf2529e3c58f53bfb4d844f3a9d3"></a>
|
||||
#define </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d83/problem__401_2sol1_8c.html#ade1bdf2529e3c58f53bfb4d844f3a9d3">MOD_LIMIT</a>   (uint64_t)1e9</td></tr>
|
||||
<tr class="memdesc:ade1bdf2529e3c58f53bfb4d844f3a9d3"><td class="mdescLeft"> </td><td class="mdescRight">modulo limit <br /></td></tr>
|
||||
<tr class="separator:ade1bdf2529e3c58f53bfb4d844f3a9d3"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a7a9a231e30b47bc0345749c8bd1e5077"><td class="memItemLeft" align="right" valign="top"><a id="a7a9a231e30b47bc0345749c8bd1e5077"></a>
|
||||
#define </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d83/problem__401_2sol1_8c.html#a7a9a231e30b47bc0345749c8bd1e5077">MAX_LENGTH</a>   5000</td></tr>
|
||||
<tr class="memdesc:a7a9a231e30b47bc0345749c8bd1e5077"><td class="mdescLeft"> </td><td class="mdescRight">chunk size of array allocation <br /></td></tr>
|
||||
<tr class="separator:a7a9a231e30b47bc0345749c8bd1e5077"><td class="memSeparator" colspan="2"> </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:a4441a6d27134cf3aed05727800d99456"><td class="memItemLeft" align="right" valign="top">char </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d83/problem__401_2sol1_8c.html#a4441a6d27134cf3aed05727800d99456">is_in</a> (uint64_t <a class="el" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>, uint64_t *D, uint64_t <a class="el" href="../../df/db3/struct_l.html">L</a>)</td></tr>
|
||||
<tr class="memitem:a4441a6d27134cf3aed05727800d99456"><td class="memItemLeft" align="right" valign="top">char </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d83/problem__401_2sol1_8c.html#a4441a6d27134cf3aed05727800d99456">is_in</a> (uint64_t N, uint64_t *D, uint64_t <a class="el" href="../../df/db3/struct_l.html">L</a>)</td></tr>
|
||||
<tr class="memdesc:a4441a6d27134cf3aed05727800d99456"><td class="mdescLeft"> </td><td class="mdescRight">Check if a number is present in given array. <a href="../../d4/d83/problem__401_2sol1_8c.html#a4441a6d27134cf3aed05727800d99456">More...</a><br /></td></tr>
|
||||
<tr class="separator:a4441a6d27134cf3aed05727800d99456"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a7380e14d595d560007b02ce516b6b215"><td class="memItemLeft" align="right" valign="top">uint64_t </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d83/problem__401_2sol1_8c.html#a7380e14d595d560007b02ce516b6b215">get_divisors</a> (uint64_t <a class="el" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>, uint64_t *D)</td></tr>
|
||||
<tr class="memitem:a7380e14d595d560007b02ce516b6b215"><td class="memItemLeft" align="right" valign="top">uint64_t </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d83/problem__401_2sol1_8c.html#a7380e14d595d560007b02ce516b6b215">get_divisors</a> (uint64_t N, uint64_t *D)</td></tr>
|
||||
<tr class="memdesc:a7380e14d595d560007b02ce516b6b215"><td class="mdescLeft"> </td><td class="mdescRight">Get all integer divisors of a number. <a href="../../d4/d83/problem__401_2sol1_8c.html#a7380e14d595d560007b02ce516b6b215">More...</a><br /></td></tr>
|
||||
<tr class="separator:a7380e14d595d560007b02ce516b6b215"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a236548478af932f1115a71f601a68788"><td class="memItemLeft" align="right" valign="top">uint64_t </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d83/problem__401_2sol1_8c.html#a236548478af932f1115a71f601a68788">sigma2</a> (uint64_t <a class="el" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>)</td></tr>
|
||||
<tr class="memitem:a236548478af932f1115a71f601a68788"><td class="memItemLeft" align="right" valign="top">uint64_t </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d83/problem__401_2sol1_8c.html#a236548478af932f1115a71f601a68788">sigma2</a> (uint64_t N)</td></tr>
|
||||
<tr class="memdesc:a236548478af932f1115a71f601a68788"><td class="mdescLeft"> </td><td class="mdescRight">compute sum of squares of all integer factors of a number <a href="../../d4/d83/problem__401_2sol1_8c.html#a236548478af932f1115a71f601a68788">More...</a><br /></td></tr>
|
||||
<tr class="separator:a236548478af932f1115a71f601a68788"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:aaf964739be92adc2f500e7da11e3f6be"><td class="memItemLeft" align="right" valign="top"><a id="aaf964739be92adc2f500e7da11e3f6be"></a>
|
||||
uint64_t </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d83/problem__401_2sol1_8c.html#aaf964739be92adc2f500e7da11e3f6be">sigma</a> (uint64_t <a class="el" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>)</td></tr>
|
||||
uint64_t </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d83/problem__401_2sol1_8c.html#aaf964739be92adc2f500e7da11e3f6be">sigma</a> (uint64_t N)</td></tr>
|
||||
<tr class="memdesc:aaf964739be92adc2f500e7da11e3f6be"><td class="mdescLeft"> </td><td class="mdescRight">sum of squares of factors of numbers from 1 thru N <br /></td></tr>
|
||||
<tr class="separator:aaf964739be92adc2f500e7da11e3f6be"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a3c04138a5bfe5d72780bb7e82a18e627"><td class="memItemLeft" align="right" valign="top"><a id="a3c04138a5bfe5d72780bb7e82a18e627"></a>
|
||||
@ -185,43 +185,45 @@ int </td><td class="memItemRight" valign="bottom"><a class="el" href="../..
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>number of divisors found </dd></dl>
|
||||
<div class="fragment"><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> {</div>
|
||||
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  uint64_t q, r;</div>
|
||||
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  int64_t i, num = 0;</div>
|
||||
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  </div>
|
||||
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="keywordflow">if</span> (<a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> == 1)</div>
|
||||
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  {</div>
|
||||
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  D[0] = 1;</div>
|
||||
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="keywordflow">return</span> 1;</div>
|
||||
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  }</div>
|
||||
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  </div>
|
||||
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="comment">// search till sqrt(N)</span></div>
|
||||
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="comment">// because after this, the pair of divisors will repeat themselves</span></div>
|
||||
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="keywordflow">for</span> (i = 1; i * i <= <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> + 1; i++)</div>
|
||||
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  {</div>
|
||||
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  r = <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> % i; <span class="comment">// get reminder</span></div>
|
||||
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  </div>
|
||||
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="comment">// reminder = 0 if 'i' is a divisor of 'N'</span></div>
|
||||
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <span class="keywordflow">if</span> (r == 0)</div>
|
||||
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  {</div>
|
||||
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  q = <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> / i;</div>
|
||||
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="keywordflow">if</span> (!<a class="code" href="../../d4/d83/problem__401_2sol1_8c.html#a4441a6d27134cf3aed05727800d99456">is_in</a>(i, D, num)) <span class="comment">// if divisor was already stored</span></div>
|
||||
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  {</div>
|
||||
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  D[num] = i;</div>
|
||||
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  num++;</div>
|
||||
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  }</div>
|
||||
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keywordflow">if</span> (!<a class="code" href="../../d4/d83/problem__401_2sol1_8c.html#a4441a6d27134cf3aed05727800d99456">is_in</a>(q, D, num)) <span class="comment">// if divisor was already stored</span></div>
|
||||
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  {</div>
|
||||
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  D[num] = q;</div>
|
||||
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  num++;</div>
|
||||
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  }</div>
|
||||
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  }</div>
|
||||
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  </div>
|
||||
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="keywordflow">if</span> (num == <a class="code" href="../../d4/d83/problem__401_2sol1_8c.html#adf2a0717e3307419a9d7c52707f5631e">MAX_L</a>) <span class="comment">// limit of array reached, allocate more space</span></div>
|
||||
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  D = (uint64_t *)realloc(D, <a class="code" href="../../d4/d83/problem__401_2sol1_8c.html#adf2a0717e3307419a9d7c52707f5631e">MAX_L</a> * <span class="keyword">sizeof</span>(uint64_t) << 1);</div>
|
||||
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  }</div>
|
||||
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="keywordflow">return</span> num;</div>
|
||||
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span> }</div>
|
||||
<div class="fragment"><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> {</div>
|
||||
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  uint64_t q, r;</div>
|
||||
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  int64_t i, num = 0;</div>
|
||||
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  </div>
|
||||
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="keywordflow">if</span> (N == 1)</div>
|
||||
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  {</div>
|
||||
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  D[0] = 1;</div>
|
||||
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="keywordflow">return</span> 1;</div>
|
||||
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  }</div>
|
||||
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  </div>
|
||||
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="comment">// search till sqrt(N)</span></div>
|
||||
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="comment">// because after this, the pair of divisors will repeat themselves</span></div>
|
||||
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="keywordflow">for</span> (i = 1; i * i <= N + 1; i++)</div>
|
||||
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  {</div>
|
||||
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  r = N % i; <span class="comment">// get reminder</span></div>
|
||||
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  </div>
|
||||
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="comment">// reminder = 0 if 'i' is a divisor of 'N'</span></div>
|
||||
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="keywordflow">if</span> (r == 0)</div>
|
||||
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  {</div>
|
||||
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  q = N / i;</div>
|
||||
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <span class="keywordflow">if</span> (!<a class="code" href="../../d4/d83/problem__401_2sol1_8c.html#a4441a6d27134cf3aed05727800d99456">is_in</a>(i, D, num)) <span class="comment">// if divisor was already stored</span></div>
|
||||
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  {</div>
|
||||
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  D[num] = i;</div>
|
||||
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  num++;</div>
|
||||
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  }</div>
|
||||
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="keywordflow">if</span> (!<a class="code" href="../../d4/d83/problem__401_2sol1_8c.html#a4441a6d27134cf3aed05727800d99456">is_in</a>(q, D, num)) <span class="comment">// if divisor was already stored</span></div>
|
||||
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  {</div>
|
||||
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  D[num] = q;</div>
|
||||
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  num++;</div>
|
||||
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  }</div>
|
||||
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  }</div>
|
||||
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  </div>
|
||||
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="keywordflow">if</span> (num == <a class="code" href="../../d4/d83/problem__401_2sol1_8c.html#a7a9a231e30b47bc0345749c8bd1e5077">MAX_LENGTH</a>)</div>
|
||||
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  { <span class="comment">// limit of array reached, allocate more space</span></div>
|
||||
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  D = (uint64_t *)realloc(D, <a class="code" href="../../d4/d83/problem__401_2sol1_8c.html#a7a9a231e30b47bc0345749c8bd1e5077">MAX_LENGTH</a> * <span class="keyword">sizeof</span>(uint64_t) << 1);</div>
|
||||
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  }</div>
|
||||
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  }</div>
|
||||
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="keywordflow">return</span> num;</div>
|
||||
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span> }</div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
@ -278,10 +280,14 @@ Here is the call graph for this function:</div>
|
||||
<div class="fragment"><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> {</div>
|
||||
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span>  uint64_t i;</div>
|
||||
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  <span class="keywordflow">for</span> (i = 0; i < <a class="code" href="../../df/db3/struct_l.html">L</a>; i++)</div>
|
||||
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  <span class="keywordflow">if</span> (D[i] == <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>)</div>
|
||||
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  <span class="keywordflow">return</span> 1;</div>
|
||||
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span> }</div>
|
||||
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  {</div>
|
||||
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  <span class="keywordflow">if</span> (D[i] == N)</div>
|
||||
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  {</div>
|
||||
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  <span class="keywordflow">return</span> 1;</div>
|
||||
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  }</div>
|
||||
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  }</div>
|
||||
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span> }</div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
@ -309,21 +315,21 @@ Here is the call graph for this function:</div>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>sum of squares </dd></dl>
|
||||
<div class="fragment"><div class="line"><a name="l00088"></a><span class="lineno"> 88</span> {</div>
|
||||
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  uint64_t sum = 0, <a class="code" href="../../df/db3/struct_l.html">L</a>;</div>
|
||||
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  int64_t i;</div>
|
||||
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  uint64_t *D = (uint64_t *)malloc(<a class="code" href="../../d4/d83/problem__401_2sol1_8c.html#adf2a0717e3307419a9d7c52707f5631e">MAX_L</a> * <span class="keyword">sizeof</span>(uint64_t));</div>
|
||||
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  </div>
|
||||
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <a class="code" href="../../df/db3/struct_l.html">L</a> = <a class="code" href="../../d4/d83/problem__401_2sol1_8c.html#a7380e14d595d560007b02ce516b6b215">get_divisors</a>(<a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>, D);</div>
|
||||
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keywordflow">for</span> (i = 1; i < <a class="code" href="../../df/db3/struct_l.html">L</a>; i++)</div>
|
||||
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  {</div>
|
||||
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  uint64_t DD = (D[i] * D[i]) % <a class="code" href="../../d4/d83/problem__401_2sol1_8c.html#aca7d5718ab8c38506adb3bef2469b319">MOD</a>;</div>
|
||||
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  sum += DD;</div>
|
||||
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  }</div>
|
||||
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  </div>
|
||||
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  free(D);</div>
|
||||
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keywordflow">return</span> sum % <a class="code" href="../../d4/d83/problem__401_2sol1_8c.html#aca7d5718ab8c38506adb3bef2469b319">MOD</a>;</div>
|
||||
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span> }</div>
|
||||
<div class="fragment"><div class="line"><a name="l00094"></a><span class="lineno"> 94</span> {</div>
|
||||
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  uint64_t sum = 0, <a class="code" href="../../df/db3/struct_l.html">L</a>;</div>
|
||||
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  int64_t i;</div>
|
||||
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  uint64_t *D = (uint64_t *)malloc(<a class="code" href="../../d4/d83/problem__401_2sol1_8c.html#a7a9a231e30b47bc0345749c8bd1e5077">MAX_LENGTH</a> * <span class="keyword">sizeof</span>(uint64_t));</div>
|
||||
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  </div>
|
||||
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <a class="code" href="../../df/db3/struct_l.html">L</a> = <a class="code" href="../../d4/d83/problem__401_2sol1_8c.html#a7380e14d595d560007b02ce516b6b215">get_divisors</a>(N, D);</div>
|
||||
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keywordflow">for</span> (i = 1; i < <a class="code" href="../../df/db3/struct_l.html">L</a>; i++)</div>
|
||||
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  {</div>
|
||||
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  uint64_t DD = (D[i] * D[i]) % <a class="code" href="../../d4/d83/problem__401_2sol1_8c.html#ade1bdf2529e3c58f53bfb4d844f3a9d3">MOD_LIMIT</a>;</div>
|
||||
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  sum += DD;</div>
|
||||
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  }</div>
|
||||
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  </div>
|
||||
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  free(D);</div>
|
||||
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="keywordflow">return</span> sum % <a class="code" href="../../d4/d83/problem__401_2sol1_8c.html#ade1bdf2529e3c58f53bfb4d844f3a9d3">MOD_LIMIT</a>;</div>
|
||||
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span> }</div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
@ -336,11 +342,10 @@ Here is the call graph for this function:</div>
|
||||
</div><!-- contents -->
|
||||
</div><!-- doc-content -->
|
||||
<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="aproblem__401_2sol1_8c_html_aca7d5718ab8c38506adb3bef2469b319"><div class="ttname"><a href="../../d4/d83/problem__401_2sol1_8c.html#aca7d5718ab8c38506adb3bef2469b319">MOD</a></div><div class="ttdeci">#define MOD</div><div class="ttdoc">modulo limit</div><div class="ttdef"><b>Definition:</b> sol1.c:17</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:43</div></div>
|
||||
<div class="ttc" id="aproblem__401_2sol1_8c_html_adf2a0717e3307419a9d7c52707f5631e"><div class="ttname"><a href="../../d4/d83/problem__401_2sol1_8c.html#adf2a0717e3307419a9d7c52707f5631e">MAX_L</a></div><div class="ttdeci">#define MAX_L</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="aproblem__13_2sol1_8c_html_a0240ac851181b84ac374872dc5434ee4"><div class="ttname"><a href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a></div><div class="ttdeci">#define N</div><div class="ttdoc">number of digits of the large number</div><div class="ttdef"><b>Definition:</b> sol1.c:109</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="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="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="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>
|
||||
<!-- start footer part -->
|
||||
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
||||
<ul>
|
||||
|
||||
@ -1,8 +1,8 @@
|
||||
var problem__401_2sol1_8c =
|
||||
[
|
||||
[ "__STDC_FORMAT_MACROS", "d4/d83/problem__401_2sol1_8c.html#aacbb9e1f38be71e22df1584a37c56693", null ],
|
||||
[ "MAX_L", "d4/d83/problem__401_2sol1_8c.html#adf2a0717e3307419a9d7c52707f5631e", null ],
|
||||
[ "MOD", "d4/d83/problem__401_2sol1_8c.html#aca7d5718ab8c38506adb3bef2469b319", null ],
|
||||
[ "MAX_LENGTH", "d4/d83/problem__401_2sol1_8c.html#a7a9a231e30b47bc0345749c8bd1e5077", null ],
|
||||
[ "MOD_LIMIT", "d4/d83/problem__401_2sol1_8c.html#ade1bdf2529e3c58f53bfb4d844f3a9d3", null ],
|
||||
[ "get_divisors", "d4/d83/problem__401_2sol1_8c.html#a7380e14d595d560007b02ce516b6b215", null ],
|
||||
[ "is_in", "d4/d83/problem__401_2sol1_8c.html#a4441a6d27134cf3aed05727800d99456", null ],
|
||||
[ "main", "d4/d83/problem__401_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627", null ],
|
||||
|
||||
@ -112,17 +112,17 @@ Include dependency graph for sol2.c:</div>
|
||||
</div><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
|
||||
Functions</h2></td></tr>
|
||||
<tr class="memitem:a1aca7f530f82b27100262adba9e7556b"><td class="memItemLeft" align="right" valign="top">char </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/dbd/problem__23_2sol2_8c.html#a1aca7f530f82b27100262adba9e7556b">get_perfect_number</a> (unsigned long <a class="el" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>)</td></tr>
|
||||
<tr class="memitem:a1aca7f530f82b27100262adba9e7556b"><td class="memItemLeft" align="right" valign="top">char </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/dbd/problem__23_2sol2_8c.html#a1aca7f530f82b27100262adba9e7556b">get_perfect_number</a> (unsigned long N)</td></tr>
|
||||
<tr class="separator:a1aca7f530f82b27100262adba9e7556b"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a34f4ad85151e3a43368ae67f42347f56"><td class="memItemLeft" align="right" valign="top"><a id="a34f4ad85151e3a43368ae67f42347f56"></a>
|
||||
char </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/dbd/problem__23_2sol2_8c.html#a34f4ad85151e3a43368ae67f42347f56">is_abundant</a> (unsigned long <a class="el" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>)</td></tr>
|
||||
char </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/dbd/problem__23_2sol2_8c.html#a34f4ad85151e3a43368ae67f42347f56">is_abundant</a> (unsigned long N)</td></tr>
|
||||
<tr class="memdesc:a34f4ad85151e3a43368ae67f42347f56"><td class="mdescLeft"> </td><td class="mdescRight">Is the given number an abundant number (1) or not (0) <br /></td></tr>
|
||||
<tr class="separator:a34f4ad85151e3a43368ae67f42347f56"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:ac5d600bf3077f4188afc4c5cd2c40eaf"><td class="memItemLeft" align="right" valign="top"><a id="ac5d600bf3077f4188afc4c5cd2c40eaf"></a>
|
||||
unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/dbd/problem__23_2sol2_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf">get_next_abundant</a> (unsigned long <a class="el" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>)</td></tr>
|
||||
unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/dbd/problem__23_2sol2_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf">get_next_abundant</a> (unsigned long N)</td></tr>
|
||||
<tr class="memdesc:ac5d600bf3077f4188afc4c5cd2c40eaf"><td class="mdescLeft"> </td><td class="mdescRight">Find the next abundant number after N and not including N. <br /></td></tr>
|
||||
<tr class="separator:ac5d600bf3077f4188afc4c5cd2c40eaf"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a3ab61b5a1c4f2288625d160aa0ea8478"><td class="memItemLeft" align="right" valign="top">char </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/dbd/problem__23_2sol2_8c.html#a3ab61b5a1c4f2288625d160aa0ea8478">is_sum_of_abundant</a> (unsigned long <a class="el" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>)</td></tr>
|
||||
<tr class="memitem:a3ab61b5a1c4f2288625d160aa0ea8478"><td class="memItemLeft" align="right" valign="top">char </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/dbd/problem__23_2sol2_8c.html#a3ab61b5a1c4f2288625d160aa0ea8478">is_sum_of_abundant</a> (unsigned long N)</td></tr>
|
||||
<tr class="memdesc:a3ab61b5a1c4f2288625d160aa0ea8478"><td class="mdescLeft"> </td><td class="mdescRight">check if a given number can be represented as a sum of two abundant numbers. <a href="../../d4/dbd/problem__23_2sol2_8c.html#a3ab61b5a1c4f2288625d160aa0ea8478">More...</a><br /></td></tr>
|
||||
<tr class="separator:a3ab61b5a1c4f2288625d160aa0ea8478"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a3c04138a5bfe5d72780bb7e82a18e627"><td class="memItemLeft" align="right" valign="top"><a id="a3c04138a5bfe5d72780bb7e82a18e627"></a>
|
||||
@ -132,10 +132,6 @@ int </td><td class="memItemRight" valign="bottom"><a class="el" href="../..
|
||||
</table><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="var-members"></a>
|
||||
Variables</h2></td></tr>
|
||||
<tr class="memitem:a8c7ddb39906f281b801f2cd58d416c2b"><td class="memItemLeft" align="right" valign="top"><a id="a8c7ddb39906f281b801f2cd58d416c2b"></a>
|
||||
long </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/dbd/problem__23_2sol2_8c.html#a8c7ddb39906f281b801f2cd58d416c2b">MAX_N</a> = 28123</td></tr>
|
||||
<tr class="memdesc:a8c7ddb39906f281b801f2cd58d416c2b"><td class="mdescLeft"> </td><td class="mdescRight">Limit of numbers to check. <br /></td></tr>
|
||||
<tr class="separator:a8c7ddb39906f281b801f2cd58d416c2b"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:af920a16d6ef69dd604b283f427892e06"><td class="memItemLeft" align="right" valign="top">char * </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/dbd/problem__23_2sol2_8c.html#af920a16d6ef69dd604b283f427892e06">abundant_flags</a> = NULL</td></tr>
|
||||
<tr class="memdesc:af920a16d6ef69dd604b283f427892e06"><td class="mdescLeft"> </td><td class="mdescRight">This is the global array to be used to store a flag to identify if a particular number is abundant (1) or not (0). <a href="../../d4/dbd/problem__23_2sol2_8c.html#af920a16d6ef69dd604b283f427892e06">More...</a><br /></td></tr>
|
||||
<tr class="separator:af920a16d6ef69dd604b283f427892e06"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
@ -165,24 +161,26 @@ long </td><td class="memItemRight" valign="bottom"><a class="el" href="../.
|
||||
1 if N is abundant </dd>
|
||||
<dd>
|
||||
0 if N is perfect </dd></dl>
|
||||
<div class="fragment"><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> {</div>
|
||||
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> sum = 1;</div>
|
||||
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <span class="keywordtype">char</span> ret = 0;</div>
|
||||
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  </div>
|
||||
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> i = 2; i * i <= <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>; i++)</div>
|
||||
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  {</div>
|
||||
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  <span class="keywordflow">if</span> (<a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> % i == 0)</div>
|
||||
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  {</div>
|
||||
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  sum += i;</div>
|
||||
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> tmp = <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> / i;</div>
|
||||
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="keywordflow">if</span> (tmp != i)</div>
|
||||
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  sum += tmp;</div>
|
||||
<div class="fragment"><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> {</div>
|
||||
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> sum = 1;</div>
|
||||
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  <span class="keywordtype">char</span> ret = 0;</div>
|
||||
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  </div>
|
||||
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> i = 2; i * i <= N; i++)</div>
|
||||
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  {</div>
|
||||
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  <span class="keywordflow">if</span> (N % i == 0)</div>
|
||||
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  {</div>
|
||||
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  sum += i;</div>
|
||||
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> tmp = N / i;</div>
|
||||
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  <span class="keywordflow">if</span> (tmp != i)</div>
|
||||
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  {</div>
|
||||
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  sum += tmp;</div>
|
||||
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  }</div>
|
||||
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  }</div>
|
||||
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  }</div>
|
||||
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  </div>
|
||||
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  ret = sum == <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> ? 0 : (sum > <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> ? 1 : -1);</div>
|
||||
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  ret = sum == N ? 0 : (sum > N ? 1 : -1);</div>
|
||||
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="preprocessor">#ifdef DEBUG</span></div>
|
||||
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  printf(<span class="stringliteral">"%5lu: %5lu : %d\n"</span>, <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>, sum, ret);</div>
|
||||
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  printf(<span class="stringliteral">"%5lu: %5lu : %d\n"</span>, N, sum, ret);</div>
|
||||
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="preprocessor">#endif</span></div>
|
||||
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="keywordflow">return</span> ret;</div>
|
||||
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span> }</div>
|
||||
@ -209,22 +207,24 @@ long </td><td class="memItemRight" valign="bottom"><a class="el" href="../.
|
||||
<dl class="section return"><dt>Returns</dt><dd>1 - if yes </dd>
|
||||
<dd>
|
||||
0 - if not </dd></dl>
|
||||
<div class="fragment"><div class="line"><a name="l00086"></a><span class="lineno"> 86</span> {</div>
|
||||
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="comment">/* optimized logic:</span></div>
|
||||
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span> <span class="comment"> * i + j = N where both i and j should be abundant</span></div>
|
||||
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span> <span class="comment"> * hence we can simply check for j = N - i as we loop through i</span></div>
|
||||
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span> <span class="comment"> */</span></div>
|
||||
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> i = <a class="code" href="../../d4/dbd/problem__23_2sol2_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf">get_next_abundant</a>(1); i <= (<a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> >> 1);</div>
|
||||
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  i = <a class="code" href="../../d4/dbd/problem__23_2sol2_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf">get_next_abundant</a>(i))</div>
|
||||
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keywordflow">if</span> (<a class="code" href="../../d4/dbd/problem__23_2sol2_8c.html#a34f4ad85151e3a43368ae67f42347f56">is_abundant</a>(<a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> - i))</div>
|
||||
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  {</div>
|
||||
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span> <span class="preprocessor">#ifdef DEBUG</span></div>
|
||||
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  printf(<span class="stringliteral">"\t%4lu + %4lu = %4lu\n"</span>, i, <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> - i, <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>);</div>
|
||||
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span> <span class="preprocessor">#endif</span></div>
|
||||
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="keywordflow">return</span> 1;</div>
|
||||
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  }</div>
|
||||
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span> }</div>
|
||||
<div class="fragment"><div class="line"><a name="l00088"></a><span class="lineno"> 88</span> {</div>
|
||||
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="comment">/* optimized logic:</span></div>
|
||||
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span> <span class="comment"> * i + j = N where both i and j should be abundant</span></div>
|
||||
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span> <span class="comment"> * hence we can simply check for j = N - i as we loop through i</span></div>
|
||||
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span> <span class="comment"> */</span></div>
|
||||
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> i = <a class="code" href="../../d4/dbd/problem__23_2sol2_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf">get_next_abundant</a>(1); i <= (N >> 1);</div>
|
||||
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  i = <a class="code" href="../../d4/dbd/problem__23_2sol2_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf">get_next_abundant</a>(i))</div>
|
||||
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  {</div>
|
||||
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="keywordflow">if</span> (<a class="code" href="../../d4/dbd/problem__23_2sol2_8c.html#a34f4ad85151e3a43368ae67f42347f56">is_abundant</a>(N - i))</div>
|
||||
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  {</div>
|
||||
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span> <span class="preprocessor">#ifdef DEBUG</span></div>
|
||||
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  printf(<span class="stringliteral">"\t%4lu + %4lu = %4lu\n"</span>, i, N - i, N);</div>
|
||||
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span> <span class="preprocessor">#endif</span></div>
|
||||
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keywordflow">return</span> 1;</div>
|
||||
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  }</div>
|
||||
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  }</div>
|
||||
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span> }</div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
@ -254,7 +254,6 @@ Here is the call graph for this function:</div>
|
||||
</div>
|
||||
</div><!-- contents -->
|
||||
</div><!-- doc-content -->
|
||||
<div class="ttc" id="aproblem__13_2sol1_8c_html_a0240ac851181b84ac374872dc5434ee4"><div class="ttname"><a href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a></div><div class="ttdeci">#define N</div><div class="ttdoc">number of digits of the large number</div><div class="ttdef"><b>Definition:</b> sol1.c:109</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="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>
|
||||
<!-- start footer part -->
|
||||
|
||||
@ -5,6 +5,5 @@ var problem__23_2sol2_8c =
|
||||
[ "is_abundant", "d4/dbd/problem__23_2sol2_8c.html#a34f4ad85151e3a43368ae67f42347f56", null ],
|
||||
[ "is_sum_of_abundant", "d4/dbd/problem__23_2sol2_8c.html#a3ab61b5a1c4f2288625d160aa0ea8478", null ],
|
||||
[ "main", "d4/dbd/problem__23_2sol2_8c.html#a3c04138a5bfe5d72780bb7e82a18e627", null ],
|
||||
[ "abundant_flags", "d4/dbd/problem__23_2sol2_8c.html#af920a16d6ef69dd604b283f427892e06", null ],
|
||||
[ "MAX_N", "d4/dbd/problem__23_2sol2_8c.html#a8c7ddb39906f281b801f2cd58d416c2b", null ]
|
||||
[ "abundant_flags", "d4/dbd/problem__23_2sol2_8c.html#af920a16d6ef69dd604b283f427892e06", null ]
|
||||
];
|
||||
@ -126,7 +126,7 @@ Macros</h2></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:a7d96c5e4ae1bd6d29791bcc23a4cb2b0"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/d50/qr__eigen__values_8c.html#a7d96c5e4ae1bd6d29791bcc23a4cb2b0">create_matrix</a> (double **A, int <a class="el" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>)</td></tr>
|
||||
<tr class="memitem:a7d96c5e4ae1bd6d29791bcc23a4cb2b0"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/d50/qr__eigen__values_8c.html#a7d96c5e4ae1bd6d29791bcc23a4cb2b0">create_matrix</a> (double **A, int N)</td></tr>
|
||||
<tr class="memdesc:a7d96c5e4ae1bd6d29791bcc23a4cb2b0"><td class="mdescLeft"> </td><td class="mdescRight">create a square matrix of given size with random elements <a href="../../d7/d50/qr__eigen__values_8c.html#a7d96c5e4ae1bd6d29791bcc23a4cb2b0">More...</a><br /></td></tr>
|
||||
<tr class="separator:a7d96c5e4ae1bd6d29791bcc23a4cb2b0"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a741477692f001a805b0fea942c9dc2b9"><td class="memItemLeft" align="right" valign="top">double ** </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/d50/qr__eigen__values_8c.html#a741477692f001a805b0fea942c9dc2b9">mat_mul</a> (double **A, double **B, double **OUT, int R1, int C1, int R2, int C2)</td></tr>
|
||||
@ -190,10 +190,10 @@ int </td><td class="memItemRight" valign="bottom"><a class="el" href="../..
|
||||
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="preprocessor">#ifdef _OPENMP</span></div>
|
||||
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="preprocessor">#pragma omp for</span></div>
|
||||
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="preprocessor">#endif</span></div>
|
||||
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  <span class="keywordflow">for</span> (i = 0; i < <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>; i++)</div>
|
||||
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  <span class="keywordflow">for</span> (i = 0; i < N; i++)</div>
|
||||
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  {</div>
|
||||
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  A[i][i] = (rand() % <a class="code" href="../../d7/d50/qr__eigen__values_8c.html#aee57a411f07599034f5ceb8cc7d65b40">LIMS</a>) - lim2;</div>
|
||||
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  <span class="keywordflow">for</span> (j = i + 1; j < <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>; j++)</div>
|
||||
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  <span class="keywordflow">for</span> (j = i + 1; j < N; j++)</div>
|
||||
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  {</div>
|
||||
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  tmp = (rand() % <a class="code" href="../../d7/d50/qr__eigen__values_8c.html#aee57a411f07599034f5ceb8cc7d65b40">LIMS</a>) - lim2;</div>
|
||||
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  A[i][j] = tmp;</div>
|
||||
@ -620,7 +620,6 @@ Here is the call graph for this function:</div>
|
||||
</div><!-- contents -->
|
||||
</div><!-- doc-content -->
|
||||
<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__13_2sol1_8c_html_a0240ac851181b84ac374872dc5434ee4"><div class="ttname"><a href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a></div><div class="ttdeci">#define N</div><div class="ttdoc">number of digits of the large number</div><div class="ttdef"><b>Definition:</b> sol1.c:109</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="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="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>
|
||||
|
||||
@ -111,7 +111,7 @@ Include dependency graph for sol1.c:</div>
|
||||
</div><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
|
||||
Functions</h2></td></tr>
|
||||
<tr class="memitem:a4650d1d3897633d84253f93433f601d6"><td class="memItemLeft" align="right" valign="top">unsigned long long </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/d91/problem__15_2sol1_8c.html#a4650d1d3897633d84253f93433f601d6">number_of_paths</a> (int <a class="el" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>)</td></tr>
|
||||
<tr class="memitem:a4650d1d3897633d84253f93433f601d6"><td class="memItemLeft" align="right" valign="top">unsigned long long </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/d91/problem__15_2sol1_8c.html#a4650d1d3897633d84253f93433f601d6">number_of_paths</a> (int N)</td></tr>
|
||||
<tr class="memdesc:a4650d1d3897633d84253f93433f601d6"><td class="mdescLeft"> </td><td class="mdescRight">At every node, there are 2 possible ways to move -> down or right. <a href="../../d7/d91/problem__15_2sol1_8c.html#a4650d1d3897633d84253f93433f601d6">More...</a><br /></td></tr>
|
||||
<tr class="separator:a4650d1d3897633d84253f93433f601d6"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a3c04138a5bfe5d72780bb7e82a18e627"><td class="memItemLeft" align="right" valign="top"><a id="a3c04138a5bfe5d72780bb7e82a18e627"></a>
|
||||
@ -143,9 +143,9 @@ int </td><td class="memItemRight" valign="bottom"><a class="el" href="../..
|
||||
<p>Since it is a square grid, there are in all, 2N steps with N down and N right options, without preference for order. Hence, the path can be be traced in N out of 2N number of ways. This is the same as binomial coeeficient. </p>
|
||||
<div class="fragment"><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> {</div>
|
||||
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> <span class="keywordtype">long</span> path = 1;</div>
|
||||
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>; i++)</div>
|
||||
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < N; i++)</div>
|
||||
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span>  {</div>
|
||||
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span>  path *= (<a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> << 1) - i;</div>
|
||||
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span>  path *= (N << 1) - i;</div>
|
||||
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span>  path /= i + 1;</div>
|
||||
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span>  }</div>
|
||||
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span>  </div>
|
||||
@ -156,7 +156,6 @@ int </td><td class="memItemRight" valign="bottom"><a class="el" href="../..
|
||||
</div>
|
||||
</div><!-- contents -->
|
||||
</div><!-- doc-content -->
|
||||
<div class="ttc" id="aproblem__13_2sol1_8c_html_a0240ac851181b84ac374872dc5434ee4"><div class="ttname"><a href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a></div><div class="ttdeci">#define N</div><div class="ttdoc">number of digits of the large number</div><div class="ttdef"><b>Definition:</b> sol1.c:109</div></div>
|
||||
<!-- start footer part -->
|
||||
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
||||
<ul>
|
||||
|
||||
@ -121,7 +121,7 @@ Macros</h2></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:a0daa148091ec953809fc172289f773d3"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/d98/spirograph_8c.html#a0daa148091ec953809fc172289f773d3">spirograph</a> (double *x, double *y, double l, double k, size_t <a class="el" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>, double rot)</td></tr>
|
||||
<tr class="memitem:a0daa148091ec953809fc172289f773d3"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/d98/spirograph_8c.html#a0daa148091ec953809fc172289f773d3">spirograph</a> (double *x, double *y, double l, double k, size_t N, double rot)</td></tr>
|
||||
<tr class="memdesc:a0daa148091ec953809fc172289f773d3"><td class="mdescLeft"> </td><td class="mdescRight">Generate spirograph curve into arrays <code>x</code> and <code>y</code> such that the i^th point in 2D is represented by <code>(x[i],y[i])</code>. <a href="../../d7/d98/spirograph_8c.html#a0daa148091ec953809fc172289f773d3">More...</a><br /></td></tr>
|
||||
<tr class="separator:a0daa148091ec953809fc172289f773d3"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a708a4c1a4d0c4acc4c447310dd4db27f"><td class="memItemLeft" align="right" valign="top"><a id="a708a4c1a4d0c4acc4c447310dd4db27f"></a>
|
||||
@ -215,11 +215,11 @@ int </td><td class="memItemRight" valign="bottom"><a class="el" href="../..
|
||||
</dd>
|
||||
</dl>
|
||||
<div class="fragment"><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> {</div>
|
||||
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="keywordtype">double</span> dt = rot * 2.f * M_PI / <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>;</div>
|
||||
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="keywordtype">double</span> dt = rot * 2.f * M_PI / N;</div>
|
||||
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="keywordtype">double</span> t = 0.f, R = 1.f;</div>
|
||||
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> k1 = 1.f - k;</div>
|
||||
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  </div>
|
||||
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> dk = 0; dk < <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>; dk++, t += dt)</div>
|
||||
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> dk = 0; dk < N; dk++, t += dt)</div>
|
||||
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  {</div>
|
||||
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  x[dk] = R * (k1 * cos(t) + l * k * cos(k1 * t / k));</div>
|
||||
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  y[dk] = R * (k1 * sin(t) - l * k * sin(k1 * t / k));</div>
|
||||
@ -230,7 +230,6 @@ int </td><td class="memItemRight" valign="bottom"><a class="el" href="../..
|
||||
</div>
|
||||
</div><!-- contents -->
|
||||
</div><!-- doc-content -->
|
||||
<div class="ttc" id="aproblem__13_2sol1_8c_html_a0240ac851181b84ac374872dc5434ee4"><div class="ttname"><a href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a></div><div class="ttdeci">#define N</div><div class="ttdoc">number of digits of the large number</div><div class="ttdef"><b>Definition:</b> sol1.c:109</div></div>
|
||||
<!-- start footer part -->
|
||||
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
||||
<ul>
|
||||
|
||||
@ -246,35 +246,34 @@ Here is the call graph for this function:</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_aca7d5718ab8c38506adb3bef2469b319"><div class="ttname"><a href="../../d4/d83/problem__401_2sol1_8c.html#aca7d5718ab8c38506adb3bef2469b319">MOD</a></div><div class="ttdeci">#define MOD</div><div class="ttdoc">modulo limit</div><div class="ttdef"><b>Definition:</b> sol1.c:17</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:87</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:43</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="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__401_2sol1_8c_html_adf2a0717e3307419a9d7c52707f5631e"><div class="ttname"><a href="../../d4/d83/problem__401_2sol1_8c.html#adf2a0717e3307419a9d7c52707f5631e">MAX_L</a></div><div class="ttdeci">#define MAX_L</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="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="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:33</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__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="aproblem__13_2sol1_8c_html_acd864640121c7df2c19f61f7baa507e4"><div class="ttname"><a href="../../db/d01/problem__13_2sol1_8c.html#acd864640121c7df2c19f61f7baa507e4">N2</a></div><div class="ttdeci">#define N2</div><div class="ttdoc">number of digits in output number</div><div class="ttdef"><b>Definition:</b> sol1.c:111</div></div>
|
||||
<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdoc">Kyler Smith, 2017 Stack data structure implementation.</div><div class="ttdef"><b>Definition:</b> binary_search_tree.c:14</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="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__13_2sol1_8c_html_a0240ac851181b84ac374872dc5434ee4"><div class="ttname"><a href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a></div><div class="ttdeci">#define N</div><div class="ttdoc">number of digits of the large number</div><div class="ttdef"><b>Definition:</b> sol1.c:109</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 arbitraty length decimal integers stored in an array.</div><div class="ttdef"><b>Definition:</b> sol1.c:44</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="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>
|
||||
@ -289,23 +288,23 @@ Here is the call graph for this function:</div>
|
||||
<div class="ttc" id="aproblem__5_2sol_8c_html_ae9606f1867e9921867d6572f51377b4c"><div class="ttname"><a href="../../df/de7/problem__5_2sol_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> sol.c:31</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="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:71</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="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:82</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="asol3_8c_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d6/de3/sol3_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="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:108</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="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="athreaded__binary__trees_8c_html_ad8ecdcce462dd8e170ae1f164935aaa6"><div class="ttname"><a href="../../df/d3c/threaded__binary__trees_8c.html#ad8ecdcce462dd8e170ae1f164935aaa6">node</a></div><div class="ttdeci">struct Node node</div><div class="ttdoc">Node, the basic data structure of the tree.</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="aproblem__23_2sol1_8c_html_a337e545af040d754dc012b42523ee1ee"><div class="ttname"><a href="../../d7/ddb/problem__23_2sol1_8c.html#a337e545af040d754dc012b42523ee1ee">MAX_N</a></div><div class="ttdeci">unsigned long MAX_N</div><div class="ttdoc">upper limit of numbers to check</div><div class="ttdef"><b>Definition:</b> sol1.c:13</div></div>
|
||||
<div class="ttc" id="aproblem__5_2sol_8c_html_a59347107cbfdf48d51108e50280e760d"><div class="ttname"><a href="../../df/de7/problem__5_2sol_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> sol.c:11</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="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>
|
||||
@ -320,7 +319,7 @@ Here is the call graph for this function:</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__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 -> 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:85</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="ac__atoi__str__to__integer_8c_html_ad19049ebfc2088bc1e75e7e958f7b60f"><div class="ttname"><a href="../../d7/dd8/c__atoi__str__to__integer_8c.html#ad19049ebfc2088bc1e75e7e958f7b60f">c_atoi</a></div><div class="ttdeci">int c_atoi(const char *str)</div><div class="ttdoc">the function take a string and return an integer</div><div class="ttdef"><b>Definition:</b> c_atoi_str_to_integer.c:16</div></div>
|
||||
@ -329,7 +328,6 @@ Here is the call graph for this function:</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="aproblem__23_2sol2_8c_html_a8c7ddb39906f281b801f2cd58d416c2b"><div class="ttname"><a href="../../d4/dbd/problem__23_2sol2_8c.html#a8c7ddb39906f281b801f2cd58d416c2b">MAX_N</a></div><div class="ttdeci">long MAX_N</div><div class="ttdoc">Limit of numbers to check.</div><div class="ttdef"><b>Definition:</b> sol2.c:17</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="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>
|
||||
@ -341,12 +339,12 @@ Here is the call graph for this function:</div>
|
||||
<div class="ttc" id="ac__atoi__str__to__integer_8c_html_a8c66c03637e48e375b80b5d7791e57be"><div class="ttname"><a href="../../d7/dd8/c__atoi__str__to__integer_8c.html#a8c66c03637e48e375b80b5d7791e57be">test_c_atoi</a></div><div class="ttdeci">void test_c_atoi()</div><div class="ttdoc">test the function implementation</div><div class="ttdef"><b>Definition:</b> c_atoi_str_to_integer.c:56</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="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:21</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="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:69</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="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:26</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! -->
|
||||
|
||||
@ -91,8 +91,7 @@ $(document).ready(function(){initNavTree('d7/ddb/problem__23_2sol1_8c.html','../
|
||||
|
||||
<div class="header">
|
||||
<div class="summary">
|
||||
<a href="#func-members">Functions</a> |
|
||||
<a href="#var-members">Variables</a> </div>
|
||||
<a href="#func-members">Functions</a> </div>
|
||||
<div class="headertitle">
|
||||
<div class="title">sol1.c File Reference</div> </div>
|
||||
</div><!--header-->
|
||||
@ -113,31 +112,24 @@ Include dependency graph for sol1.c:</div>
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
|
||||
Functions</h2></td></tr>
|
||||
<tr class="memitem:a1aca7f530f82b27100262adba9e7556b"><td class="memItemLeft" align="right" valign="top"><a id="a1aca7f530f82b27100262adba9e7556b"></a>
|
||||
char </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/ddb/problem__23_2sol1_8c.html#a1aca7f530f82b27100262adba9e7556b">get_perfect_number</a> (unsigned long <a class="el" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>)</td></tr>
|
||||
char </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/ddb/problem__23_2sol1_8c.html#a1aca7f530f82b27100262adba9e7556b">get_perfect_number</a> (unsigned long N)</td></tr>
|
||||
<tr class="memdesc:a1aca7f530f82b27100262adba9e7556b"><td class="mdescLeft"> </td><td class="mdescRight">Returns: -1 if N is deficient 1 if N is abundant 0 if N is perfect. <br /></td></tr>
|
||||
<tr class="separator:a1aca7f530f82b27100262adba9e7556b"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a4f128410e6582fe26488e2316cc96e17"><td class="memItemLeft" align="right" valign="top"><a id="a4f128410e6582fe26488e2316cc96e17"></a>
|
||||
unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/ddb/problem__23_2sol1_8c.html#a4f128410e6582fe26488e2316cc96e17">is_abundant</a> (unsigned long <a class="el" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>)</td></tr>
|
||||
unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/ddb/problem__23_2sol1_8c.html#a4f128410e6582fe26488e2316cc96e17">is_abundant</a> (unsigned long N)</td></tr>
|
||||
<tr class="memdesc:a4f128410e6582fe26488e2316cc96e17"><td class="mdescLeft"> </td><td class="mdescRight">Is the given number an abundant number (1) or not (0) <br /></td></tr>
|
||||
<tr class="separator:a4f128410e6582fe26488e2316cc96e17"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:ac5d600bf3077f4188afc4c5cd2c40eaf"><td class="memItemLeft" align="right" valign="top"><a id="ac5d600bf3077f4188afc4c5cd2c40eaf"></a>
|
||||
unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/ddb/problem__23_2sol1_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf">get_next_abundant</a> (unsigned long <a class="el" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>)</td></tr>
|
||||
unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/ddb/problem__23_2sol1_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf">get_next_abundant</a> (unsigned long N)</td></tr>
|
||||
<tr class="memdesc:ac5d600bf3077f4188afc4c5cd2c40eaf"><td class="mdescLeft"> </td><td class="mdescRight">Find the next abundant number after N and not including N. <br /></td></tr>
|
||||
<tr class="separator:ac5d600bf3077f4188afc4c5cd2c40eaf"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a3ab61b5a1c4f2288625d160aa0ea8478"><td class="memItemLeft" align="right" valign="top">char </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/ddb/problem__23_2sol1_8c.html#a3ab61b5a1c4f2288625d160aa0ea8478">is_sum_of_abundant</a> (unsigned long <a class="el" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>)</td></tr>
|
||||
<tr class="memitem:a3ab61b5a1c4f2288625d160aa0ea8478"><td class="memItemLeft" align="right" valign="top">char </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/ddb/problem__23_2sol1_8c.html#a3ab61b5a1c4f2288625d160aa0ea8478">is_sum_of_abundant</a> (unsigned long N)</td></tr>
|
||||
<tr class="memdesc:a3ab61b5a1c4f2288625d160aa0ea8478"><td class="mdescLeft"> </td><td class="mdescRight">check if a given number can be represented as a sum of two abundant numbers. <a href="../../d7/ddb/problem__23_2sol1_8c.html#a3ab61b5a1c4f2288625d160aa0ea8478">More...</a><br /></td></tr>
|
||||
<tr class="separator:a3ab61b5a1c4f2288625d160aa0ea8478"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a3c04138a5bfe5d72780bb7e82a18e627"><td class="memItemLeft" align="right" valign="top"><a id="a3c04138a5bfe5d72780bb7e82a18e627"></a>
|
||||
int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/ddb/problem__23_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">main</a> (int argc, char **argv)</td></tr>
|
||||
<tr class="memdesc:a3c04138a5bfe5d72780bb7e82a18e627"><td class="mdescLeft"> </td><td class="mdescRight">Main function. <br /></td></tr>
|
||||
<tr class="separator:a3c04138a5bfe5d72780bb7e82a18e627"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="var-members"></a>
|
||||
Variables</h2></td></tr>
|
||||
<tr class="memitem:a337e545af040d754dc012b42523ee1ee"><td class="memItemLeft" align="right" valign="top"><a id="a337e545af040d754dc012b42523ee1ee"></a>
|
||||
unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/ddb/problem__23_2sol1_8c.html#a337e545af040d754dc012b42523ee1ee">MAX_N</a> = 28123</td></tr>
|
||||
<tr class="memdesc:a337e545af040d754dc012b42523ee1ee"><td class="mdescLeft"> </td><td class="mdescRight">upper limit of numbers to check <br /></td></tr>
|
||||
<tr class="separator:a337e545af040d754dc012b42523ee1ee"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table>
|
||||
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
||||
<div class="textblock"><p><a href="https://projecteuler.net/problem=23">Problem 23</a> solution </p>
|
||||
@ -163,22 +155,24 @@ unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" h
|
||||
<dl class="section return"><dt>Returns</dt><dd>1 - if yes </dd>
|
||||
<dd>
|
||||
0 - if not </dd></dl>
|
||||
<div class="fragment"><div class="line"><a name="l00070"></a><span class="lineno"> 70</span> {</div>
|
||||
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="comment">/* optimized logic:</span></div>
|
||||
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span> <span class="comment"> * i + j = N where both i and j should be abundant</span></div>
|
||||
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span> <span class="comment"> * hence we can simply check for j = N - i as we loop through i</span></div>
|
||||
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span> <span class="comment"> */</span></div>
|
||||
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> i = <a class="code" href="../../d7/ddb/problem__23_2sol1_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf">get_next_abundant</a>(1); i <= (<a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> >> 1);</div>
|
||||
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  i = <a class="code" href="../../d7/ddb/problem__23_2sol1_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf">get_next_abundant</a>(i))</div>
|
||||
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="keywordflow">if</span> (<a class="code" href="../../d7/ddb/problem__23_2sol1_8c.html#a4f128410e6582fe26488e2316cc96e17">is_abundant</a>(<a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> - i))</div>
|
||||
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  {</div>
|
||||
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span> <span class="preprocessor">#ifdef DEBUG</span></div>
|
||||
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  printf(<span class="stringliteral">"\t%4lu + %4lu = %4lu\n"</span>, i, <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> - i, <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>);</div>
|
||||
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span> <span class="preprocessor">#endif</span></div>
|
||||
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="keywordflow">return</span> 1;</div>
|
||||
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  }</div>
|
||||
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span> }</div>
|
||||
<div class="fragment"><div class="line"><a name="l00072"></a><span class="lineno"> 72</span> {</div>
|
||||
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="comment">/* optimized logic:</span></div>
|
||||
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span> <span class="comment"> * i + j = N where both i and j should be abundant</span></div>
|
||||
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span> <span class="comment"> * hence we can simply check for j = N - i as we loop through i</span></div>
|
||||
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span> <span class="comment"> */</span></div>
|
||||
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> i = <a class="code" href="../../d7/ddb/problem__23_2sol1_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf">get_next_abundant</a>(1); i <= (N >> 1);</div>
|
||||
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  i = <a class="code" href="../../d7/ddb/problem__23_2sol1_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf">get_next_abundant</a>(i))</div>
|
||||
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  {</div>
|
||||
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="keywordflow">if</span> (<a class="code" href="../../d7/ddb/problem__23_2sol1_8c.html#a4f128410e6582fe26488e2316cc96e17">is_abundant</a>(N - i))</div>
|
||||
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  {</div>
|
||||
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span> <span class="preprocessor">#ifdef DEBUG</span></div>
|
||||
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  printf(<span class="stringliteral">"\t%4lu + %4lu = %4lu\n"</span>, i, N - i, N);</div>
|
||||
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span> <span class="preprocessor">#endif</span></div>
|
||||
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="keywordflow">return</span> 1;</div>
|
||||
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  }</div>
|
||||
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  }</div>
|
||||
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span> }</div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
@ -191,7 +185,6 @@ Here is the call graph for this function:</div>
|
||||
</div><!-- contents -->
|
||||
</div><!-- doc-content -->
|
||||
<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__13_2sol1_8c_html_a0240ac851181b84ac374872dc5434ee4"><div class="ttname"><a href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a></div><div class="ttdeci">#define N</div><div class="ttdoc">number of digits of the large number</div><div class="ttdef"><b>Definition:</b> sol1.c:109</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>
|
||||
<!-- start footer part -->
|
||||
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
||||
|
||||
@ -4,6 +4,5 @@ var problem__23_2sol1_8c =
|
||||
[ "get_perfect_number", "d7/ddb/problem__23_2sol1_8c.html#a1aca7f530f82b27100262adba9e7556b", null ],
|
||||
[ "is_abundant", "d7/ddb/problem__23_2sol1_8c.html#a4f128410e6582fe26488e2316cc96e17", null ],
|
||||
[ "is_sum_of_abundant", "d7/ddb/problem__23_2sol1_8c.html#a3ab61b5a1c4f2288625d160aa0ea8478", null ],
|
||||
[ "main", "d7/ddb/problem__23_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627", null ],
|
||||
[ "MAX_N", "d7/ddb/problem__23_2sol1_8c.html#a337e545af040d754dc012b42523ee1ee", null ]
|
||||
[ "main", "d7/ddb/problem__23_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627", null ]
|
||||
];
|
||||
@ -121,11 +121,11 @@ Macros</h2></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:af9729befaffc1aab9ac9fedc4706e66c"><td class="memItemLeft" align="right" valign="top">unsigned int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d32/problem__25_2sol1_8c.html#af9729befaffc1aab9ac9fedc4706e66c">add_numbers</a> (unsigned char *a, unsigned char *b, unsigned char *c, int <a class="el" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>)</td></tr>
|
||||
<tr class="memitem:af9729befaffc1aab9ac9fedc4706e66c"><td class="memItemLeft" align="right" valign="top">unsigned int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d32/problem__25_2sol1_8c.html#af9729befaffc1aab9ac9fedc4706e66c">add_numbers</a> (unsigned char *a, unsigned char *b, unsigned char *c, int N)</td></tr>
|
||||
<tr class="memdesc:af9729befaffc1aab9ac9fedc4706e66c"><td class="mdescLeft"> </td><td class="mdescRight">Function to add arbitraty length decimal integers stored in an array. <a href="../../d8/d32/problem__25_2sol1_8c.html#af9729befaffc1aab9ac9fedc4706e66c">More...</a><br /></td></tr>
|
||||
<tr class="separator:af9729befaffc1aab9ac9fedc4706e66c"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:abe5bc1f170b2108a19d0a16d30bd3235"><td class="memItemLeft" align="right" valign="top"><a id="abe5bc1f170b2108a19d0a16d30bd3235"></a>
|
||||
int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d32/problem__25_2sol1_8c.html#abe5bc1f170b2108a19d0a16d30bd3235">print_number</a> (unsigned char *number, int <a class="el" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>)</td></tr>
|
||||
int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d32/problem__25_2sol1_8c.html#abe5bc1f170b2108a19d0a16d30bd3235">print_number</a> (unsigned char *number, int N)</td></tr>
|
||||
<tr class="memdesc:abe5bc1f170b2108a19d0a16d30bd3235"><td class="mdescLeft"> </td><td class="mdescRight">Print a large number. <br /></td></tr>
|
||||
<tr class="separator:abe5bc1f170b2108a19d0a16d30bd3235"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a2b90df6bfbf0d18cd9a19c1a71453783"><td class="memItemLeft" align="right" valign="top"><a id="a2b90df6bfbf0d18cd9a19c1a71453783"></a>
|
||||
@ -186,7 +186,7 @@ a + b = c = new b </p>
|
||||
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> carry = 0;</div>
|
||||
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i;</div>
|
||||
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span>  </div>
|
||||
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span>  <span class="keywordflow">for</span> (i = 0; i < <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>; i++)</div>
|
||||
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span>  <span class="keywordflow">for</span> (i = 0; i < N; i++)</div>
|
||||
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span>  {</div>
|
||||
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span>  <span class="comment">// printf("\t%d + %d + %d ", a[i], b[i], carry);</span></div>
|
||||
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  c[i] = carry + a[i] + b[i];</div>
|
||||
@ -196,33 +196,36 @@ a + b = c = new b </p>
|
||||
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  c[i] -= 10;</div>
|
||||
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  }</div>
|
||||
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  <span class="keywordflow">else</span></div>
|
||||
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  carry = 0;</div>
|
||||
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <span class="comment">// printf("= %d, %d\n", carry, c[i]);</span></div>
|
||||
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  }</div>
|
||||
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  </div>
|
||||
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <span class="keywordflow">while</span> (carry != 0)</div>
|
||||
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  {</div>
|
||||
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  <span class="comment">// printf("\t\t...adding new digit\n");</span></div>
|
||||
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  <span class="comment">// printf("\t0 + %d + %d ", b[i], carry);</span></div>
|
||||
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  c[i] = carry + c[i];</div>
|
||||
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="keywordflow">if</span> (c[i] > 9)</div>
|
||||
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  {</div>
|
||||
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  carry = 1;</div>
|
||||
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  c[i] -= 10;</div>
|
||||
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  }</div>
|
||||
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="keywordflow">else</span></div>
|
||||
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  carry = 0;</div>
|
||||
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="comment">// printf("= %d, %d\n", carry, c[i]);</span></div>
|
||||
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  i++;</div>
|
||||
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  }</div>
|
||||
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="keywordflow">return</span> i;</div>
|
||||
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span> }</div>
|
||||
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  {</div>
|
||||
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  carry = 0;</div>
|
||||
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  }</div>
|
||||
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  <span class="comment">// printf("= %d, %d\n", carry, c[i]);</span></div>
|
||||
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  }</div>
|
||||
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  </div>
|
||||
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  <span class="keywordflow">while</span> (carry != 0)</div>
|
||||
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  {</div>
|
||||
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <span class="comment">// printf("\t\t...adding new digit\n");</span></div>
|
||||
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="comment">// printf("\t0 + %d + %d ", b[i], carry);</span></div>
|
||||
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  c[i] = carry + c[i];</div>
|
||||
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="keywordflow">if</span> (c[i] > 9)</div>
|
||||
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  {</div>
|
||||
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  carry = 1;</div>
|
||||
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  c[i] -= 10;</div>
|
||||
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  }</div>
|
||||
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="keywordflow">else</span></div>
|
||||
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  {</div>
|
||||
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  carry = 0;</div>
|
||||
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  }</div>
|
||||
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="comment">// printf("= %d, %d\n", carry, c[i]);</span></div>
|
||||
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  i++;</div>
|
||||
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  }</div>
|
||||
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="keywordflow">return</span> i;</div>
|
||||
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span> }</div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
</div><!-- contents -->
|
||||
</div><!-- doc-content -->
|
||||
<div class="ttc" id="aproblem__13_2sol1_8c_html_a0240ac851181b84ac374872dc5434ee4"><div class="ttname"><a href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a></div><div class="ttdeci">#define N</div><div class="ttdoc">number of digits of the large number</div><div class="ttdef"><b>Definition:</b> sol1.c:109</div></div>
|
||||
<!-- start footer part -->
|
||||
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
||||
<ul>
|
||||
|
||||
@ -142,7 +142,7 @@ Functions</h2></td></tr>
|
||||
<tr class="memitem:ga20d3642e0a87f36fdb7bf91b023cd166"><td class="memItemLeft" align="right" valign="top">double </td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d2a/group__adaline.html#ga20d3642e0a87f36fdb7bf91b023cd166">adaline_fit_sample</a> (struct <a class="el" href="../../d2/daa/structadaline.html">adaline</a> *ada, const double *x, const int y)</td></tr>
|
||||
<tr class="memdesc:ga20d3642e0a87f36fdb7bf91b023cd166"><td class="mdescLeft"> </td><td class="mdescRight">Update the weights of the model using supervised learning for one feature vector. <a href="../../da/d2a/group__adaline.html#ga20d3642e0a87f36fdb7bf91b023cd166">More...</a><br /></td></tr>
|
||||
<tr class="separator:ga20d3642e0a87f36fdb7bf91b023cd166"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:gaa52120912e32d2893fe1c6d78da5befd"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d2a/group__adaline.html#gaa52120912e32d2893fe1c6d78da5befd">adaline_fit</a> (struct <a class="el" href="../../d2/daa/structadaline.html">adaline</a> *ada, double **X, const int *y, const int <a class="el" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>)</td></tr>
|
||||
<tr class="memitem:gaa52120912e32d2893fe1c6d78da5befd"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d2a/group__adaline.html#gaa52120912e32d2893fe1c6d78da5befd">adaline_fit</a> (struct <a class="el" href="../../d2/daa/structadaline.html">adaline</a> *ada, double **X, const int *y, const int N)</td></tr>
|
||||
<tr class="memdesc:gaa52120912e32d2893fe1c6d78da5befd"><td class="mdescLeft"> </td><td class="mdescRight">Update the weights of the model using supervised learning for an array of vectors. <a href="../../da/d2a/group__adaline.html#gaa52120912e32d2893fe1c6d78da5befd">More...</a><br /></td></tr>
|
||||
<tr class="separator:gaa52120912e32d2893fe1c6d78da5befd"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table>
|
||||
@ -235,12 +235,12 @@ Functions</h2></td></tr>
|
||||
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  avg_pred_error = 0.f;</div>
|
||||
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  </div>
|
||||
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <span class="comment">// perform fit for each sample</span></div>
|
||||
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>; i++)</div>
|
||||
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < N; i++)</div>
|
||||
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  {</div>
|
||||
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="keywordtype">double</span> err = <a class="code" href="../../da/d2a/group__adaline.html#ga20d3642e0a87f36fdb7bf91b023cd166">adaline_fit_sample</a>(ada, X[i], y[i]);</div>
|
||||
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  avg_pred_error += fabs(err);</div>
|
||||
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  }</div>
|
||||
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  avg_pred_error /= <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>;</div>
|
||||
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  avg_pred_error /= N;</div>
|
||||
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  </div>
|
||||
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="comment">// Print updates every 200th iteration</span></div>
|
||||
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <span class="comment">// if (iter % 100 == 0)</span></div>
|
||||
@ -529,7 +529,6 @@ Here is the call graph for this function:</div>
|
||||
</div><!-- doc-content -->
|
||||
<div class="ttc" id="astructadaline_html_a32e58c03fd9258709eae6138ad0ec657"><div class="ttname"><a href="../../d2/daa/structadaline.html#a32e58c03fd9258709eae6138ad0ec657">adaline::weights</a></div><div class="ttdeci">double * weights</div><div class="ttdoc">weights of the neural network</div><div class="ttdef"><b>Definition:</b> adaline_learning.c:46</div></div>
|
||||
<div class="ttc" id="agroup__adaline_html_ga43576566b020c4157d4fb28f0dd45cfa"><div class="ttname"><a href="../../da/d2a/group__adaline.html#ga43576566b020c4157d4fb28f0dd45cfa">adaline_activation</a></div><div class="ttdeci">int adaline_activation(double x)</div><div class="ttdoc">Heaviside activation function</div><div class="ttdef"><b>Definition:</b> adaline_learning.c:105</div></div>
|
||||
<div class="ttc" id="aproblem__13_2sol1_8c_html_a0240ac851181b84ac374872dc5434ee4"><div class="ttname"><a href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a></div><div class="ttdeci">#define N</div><div class="ttdoc">number of digits of the large number</div><div class="ttdef"><b>Definition:</b> sol1.c:109</div></div>
|
||||
<div class="ttc" id="agroup__adaline_html_gab4d49d73dec94c092b7ffadba55fb020"><div class="ttname"><a href="../../da/d2a/group__adaline.html#gab4d49d73dec94c092b7ffadba55fb020">ADALINE_ACCURACY</a></div><div class="ttdeci">#define ADALINE_ACCURACY</div><div class="ttdoc">convergence accuracy</div><div class="ttdef"><b>Definition:</b> adaline_learning.c:51</div></div>
|
||||
<div class="ttc" id="agroup__adaline_html_ga20d3642e0a87f36fdb7bf91b023cd166"><div class="ttname"><a href="../../da/d2a/group__adaline.html#ga20d3642e0a87f36fdb7bf91b023cd166">adaline_fit_sample</a></div><div class="ttdeci">double adaline_fit_sample(struct adaline *ada, const double *x, const int y)</div><div class="ttdoc">Update the weights of the model using supervised learning for one feature vector.</div><div class="ttdef"><b>Definition:</b> adaline_learning.c:158</div></div>
|
||||
<div class="ttc" id="astructadaline_html_a85dbd7cce6195d11ebb388220b96bde2"><div class="ttname"><a href="../../d2/daa/structadaline.html#a85dbd7cce6195d11ebb388220b96bde2">adaline::eta</a></div><div class="ttdeci">double eta</div><div class="ttdoc">learning rate of the algorithm</div><div class="ttdef"><b>Definition:</b> adaline_learning.c:45</div></div>
|
||||
|
||||
@ -91,7 +91,6 @@ $(document).ready(function(){initNavTree('db/d01/problem__13_2sol1_8c.html','../
|
||||
|
||||
<div class="header">
|
||||
<div class="summary">
|
||||
<a href="#define-members">Macros</a> |
|
||||
<a href="#func-members">Functions</a> </div>
|
||||
<div class="headertitle">
|
||||
<div class="title">sol1.c File Reference</div> </div>
|
||||
@ -111,27 +110,16 @@ Include dependency graph for sol1.c:</div>
|
||||
</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:a0240ac851181b84ac374872dc5434ee4"><td class="memItemLeft" align="right" valign="top"><a id="a0240ac851181b84ac374872dc5434ee4"></a>
|
||||
#define </td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>   10</td></tr>
|
||||
<tr class="memdesc:a0240ac851181b84ac374872dc5434ee4"><td class="mdescLeft"> </td><td class="mdescRight">number of digits of the large number <br /></td></tr>
|
||||
<tr class="separator:a0240ac851181b84ac374872dc5434ee4"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:acd864640121c7df2c19f61f7baa507e4"><td class="memItemLeft" align="right" valign="top"><a id="acd864640121c7df2c19f61f7baa507e4"></a>
|
||||
#define </td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d01/problem__13_2sol1_8c.html#acd864640121c7df2c19f61f7baa507e4">N2</a>   (<a class="el" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> + 10)</td></tr>
|
||||
<tr class="memdesc:acd864640121c7df2c19f61f7baa507e4"><td class="mdescLeft"> </td><td class="mdescRight">number of digits in output number <br /></td></tr>
|
||||
<tr class="separator:acd864640121c7df2c19f61f7baa507e4"><td class="memSeparator" colspan="2"> </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:ac260f58785fb20eb09bb35385a7d47f8"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d01/problem__13_2sol1_8c.html#ac260f58785fb20eb09bb35385a7d47f8">get_number</a> (FILE *fp, char *buffer, uint8_t *out_int)</td></tr>
|
||||
<tr class="memdesc:ac260f58785fb20eb09bb35385a7d47f8"><td class="mdescLeft"> </td><td class="mdescRight">Function to read the number from a file and store it in array. <a href="../../db/d01/problem__13_2sol1_8c.html#ac260f58785fb20eb09bb35385a7d47f8">More...</a><br /></td></tr>
|
||||
<tr class="separator:ac260f58785fb20eb09bb35385a7d47f8"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:ad51742ca5a5c99e860bdf30299163bf2"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d01/problem__13_2sol1_8c.html#ad51742ca5a5c99e860bdf30299163bf2">add_numbers</a> (uint8_t *a, uint8_t *b, uint8_t <a class="el" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>)</td></tr>
|
||||
<tr class="memdesc:ad51742ca5a5c99e860bdf30299163bf2"><td class="mdescLeft"> </td><td class="mdescRight">Function to add arbitraty length decimal integers stored in an array. <a href="../../db/d01/problem__13_2sol1_8c.html#ad51742ca5a5c99e860bdf30299163bf2">More...</a><br /></td></tr>
|
||||
<tr class="memitem:ad51742ca5a5c99e860bdf30299163bf2"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d01/problem__13_2sol1_8c.html#ad51742ca5a5c99e860bdf30299163bf2">add_numbers</a> (uint8_t *a, uint8_t *b, uint8_t N)</td></tr>
|
||||
<tr class="memdesc:ad51742ca5a5c99e860bdf30299163bf2"><td class="mdescLeft"> </td><td class="mdescRight">Function to add arbitrary length decimal integers stored in an array. <a href="../../db/d01/problem__13_2sol1_8c.html#ad51742ca5a5c99e860bdf30299163bf2">More...</a><br /></td></tr>
|
||||
<tr class="separator:ad51742ca5a5c99e860bdf30299163bf2"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a248adc917818cc6666d8bc679a660319"><td class="memItemLeft" align="right" valign="top"><a id="a248adc917818cc6666d8bc679a660319"></a>
|
||||
int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d01/problem__13_2sol1_8c.html#a248adc917818cc6666d8bc679a660319">print_number</a> (uint8_t *number, uint8_t <a class="el" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>, int8_t num_digits_to_print)</td></tr>
|
||||
int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d01/problem__13_2sol1_8c.html#a248adc917818cc6666d8bc679a660319">print_number</a> (uint8_t *number, uint8_t N, int8_t num_digits_to_print)</td></tr>
|
||||
<tr class="memdesc:a248adc917818cc6666d8bc679a660319"><td class="mdescLeft"> </td><td class="mdescRight">Function to print a long number. <br /></td></tr>
|
||||
<tr class="separator:a248adc917818cc6666d8bc679a660319"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a840291bc02cba5474a4cb46a9b9566fe"><td class="memItemLeft" align="right" valign="top"><a id="a840291bc02cba5474a4cb46a9b9566fe"></a>
|
||||
@ -175,43 +163,49 @@ int </td><td class="memItemRight" valign="bottom"><a class="el" href="../..
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>Function to add arbitraty length decimal integers stored in an array. </p>
|
||||
<p>Function to add arbitrary length decimal integers stored in an array. </p>
|
||||
<p>a + b = c = new b </p>
|
||||
<div class="fragment"><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> {</div>
|
||||
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="keywordtype">int</span> carry = 0;</div>
|
||||
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  uint8_t *c = b; <span class="comment">/* accumulate the result in the array 'b' */</span></div>
|
||||
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  </div>
|
||||
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>; i++)</div>
|
||||
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  {</div>
|
||||
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="comment">// printf("\t%d + %d + %d ", a[i], b[i], carry);</span></div>
|
||||
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  c[i] = carry + a[i] + b[i];</div>
|
||||
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="keywordflow">if</span> (c[i] > 9) <span class="comment">/* check for carry */</span></div>
|
||||
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  {</div>
|
||||
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  carry = 1;</div>
|
||||
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  c[i] -= 10;</div>
|
||||
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  }</div>
|
||||
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="keywordflow">else</span></div>
|
||||
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  carry = 0;</div>
|
||||
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="comment">// printf("= %d, %d\n", carry, c[i]);</span></div>
|
||||
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  }</div>
|
||||
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  </div>
|
||||
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>; i < <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> + 10; i++)</div>
|
||||
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  {</div>
|
||||
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="keywordflow">if</span> (carry == 0)</div>
|
||||
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="keywordflow">break</span>;</div>
|
||||
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="comment">// printf("\t0 + %d + %d ", b[i], carry);</span></div>
|
||||
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  c[i] = carry + c[i];</div>
|
||||
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keywordflow">if</span> (c[i] > 9)</div>
|
||||
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  {</div>
|
||||
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  carry = 1;</div>
|
||||
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  c[i] -= 10;</div>
|
||||
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  }</div>
|
||||
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="keywordflow">else</span></div>
|
||||
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  carry = 0;</div>
|
||||
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="comment">// printf("= %d, %d\n", carry, c[i]);</span></div>
|
||||
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  }</div>
|
||||
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span> }</div>
|
||||
<div class="fragment"><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> {</div>
|
||||
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="keywordtype">int</span> carry = 0;</div>
|
||||
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  uint8_t *c = b; <span class="comment">/* accumulate the result in the array 'b' */</span></div>
|
||||
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  </div>
|
||||
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < N; i++)</div>
|
||||
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  {</div>
|
||||
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="comment">// printf("\t%d + %d + %d ", a[i], b[i], carry);</span></div>
|
||||
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  c[i] = carry + a[i] + b[i]; <span class="comment">// NOLINT // This is a known false-positive</span></div>
|
||||
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="keywordflow">if</span> (c[i] > 9) <span class="comment">/* check for carry */</span></div>
|
||||
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  {</div>
|
||||
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  carry = 1;</div>
|
||||
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  c[i] -= 10;</div>
|
||||
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  }</div>
|
||||
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="keywordflow">else</span></div>
|
||||
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  {</div>
|
||||
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  carry = 0;</div>
|
||||
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  }</div>
|
||||
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="comment">// printf("= %d, %d\n", carry, c[i]);</span></div>
|
||||
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  }</div>
|
||||
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  </div>
|
||||
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = N; i < N + 10; i++)</div>
|
||||
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  {</div>
|
||||
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="keywordflow">if</span> (carry == 0)</div>
|
||||
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  {</div>
|
||||
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="keywordflow">break</span>;</div>
|
||||
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  }</div>
|
||||
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="comment">// printf("\t0 + %d + %d ", b[i], carry);</span></div>
|
||||
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  c[i] = carry + c[i];</div>
|
||||
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="keywordflow">if</span> (c[i] > 9)</div>
|
||||
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  {</div>
|
||||
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  carry = 1;</div>
|
||||
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  c[i] -= 10;</div>
|
||||
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  }</div>
|
||||
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="keywordflow">else</span></div>
|
||||
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  {</div>
|
||||
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  carry = 0;</div>
|
||||
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  }</div>
|
||||
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="comment">// printf("= %d, %d\n", carry, c[i]);</span></div>
|
||||
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  }</div>
|
||||
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span> }</div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
@ -263,23 +257,26 @@ int </td><td class="memItemRight" valign="bottom"><a class="el" href="../..
|
||||
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span>  <span class="keywordtype">long</span> <a class="code" href="../../df/db3/struct_l.html">L</a> = strlen(buffer);</div>
|
||||
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span>  </div>
|
||||
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="../../df/db3/struct_l.html">L</a>; i++)</div>
|
||||
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  <span class="keywordflow">if</span> (buffer[i] < 0x30 || buffer[i] > 0x39)</div>
|
||||
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span>  {</div>
|
||||
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  perror(<span class="stringliteral">"found inavlid character in the number!"</span>);</div>
|
||||
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  <span class="keywordflow">return</span> -1;</div>
|
||||
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  }</div>
|
||||
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  <span class="keywordflow">else</span></div>
|
||||
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  out_int[<a class="code" href="../../df/db3/struct_l.html">L</a> - i - 1] = buffer[i] - 0x30;</div>
|
||||
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  </div>
|
||||
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span> }</div>
|
||||
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  {</div>
|
||||
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span>  <span class="keywordflow">if</span> (buffer[i] < 0x30 || buffer[i] > 0x39)</div>
|
||||
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  {</div>
|
||||
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  perror(<span class="stringliteral">"found inavlid character in the number!"</span>);</div>
|
||||
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  <span class="keywordflow">return</span> -1;</div>
|
||||
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  }</div>
|
||||
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  <span class="keywordflow">else</span></div>
|
||||
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  {</div>
|
||||
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  out_int[<a class="code" href="../../df/db3/struct_l.html">L</a> - i - 1] = buffer[i] - 0x30;</div>
|
||||
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  }</div>
|
||||
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  }</div>
|
||||
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  </div>
|
||||
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span> }</div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
</div><!-- contents -->
|
||||
</div><!-- doc-content -->
|
||||
<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="aproblem__13_2sol1_8c_html_a0240ac851181b84ac374872dc5434ee4"><div class="ttname"><a href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a></div><div class="ttdeci">#define N</div><div class="ttdoc">number of digits of the large number</div><div class="ttdef"><b>Definition:</b> sol1.c:109</div></div>
|
||||
<!-- start footer part -->
|
||||
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
||||
<ul>
|
||||
|
||||
@ -1,7 +1,5 @@
|
||||
var problem__13_2sol1_8c =
|
||||
[
|
||||
[ "N", "db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4", null ],
|
||||
[ "N2", "db/d01/problem__13_2sol1_8c.html#acd864640121c7df2c19f61f7baa507e4", null ],
|
||||
[ "add_numbers", "db/d01/problem__13_2sol1_8c.html#ad51742ca5a5c99e860bdf30299163bf2", null ],
|
||||
[ "get_number", "db/d01/problem__13_2sol1_8c.html#ac260f58785fb20eb09bb35385a7d47f8", null ],
|
||||
[ "main", "db/d01/problem__13_2sol1_8c.html#a840291bc02cba5474a4cb46a9b9566fe", null ],
|
||||
|
||||
@ -131,7 +131,7 @@ Functions</h2></td></tr>
|
||||
<tr class="memdesc:afc373c28da6b17636528edcc97fb5f86"><td class="mdescLeft"> </td><td class="mdescRight">Function that allocates memory to add another digit at the MSB. <br /></td></tr>
|
||||
<tr class="separator:afc373c28da6b17636528edcc97fb5f86"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a54a02c4b963fdb16f24959e0137763f1"><td class="memItemLeft" align="right" valign="top"><a id="a54a02c4b963fdb16f24959e0137763f1"></a>
|
||||
char </td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d80/problem__20_2sol1_8c.html#a54a02c4b963fdb16f24959e0137763f1">remove_digits</a> (<a class="el" href="../../db/d80/problem__20_2sol1_8c.html#a62cbbd106aad52daadb9403a07d0da32">big_int</a> *digit, int <a class="el" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>)</td></tr>
|
||||
char </td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d80/problem__20_2sol1_8c.html#a54a02c4b963fdb16f24959e0137763f1">remove_digits</a> (<a class="el" href="../../db/d80/problem__20_2sol1_8c.html#a62cbbd106aad52daadb9403a07d0da32">big_int</a> *digit, int N)</td></tr>
|
||||
<tr class="memdesc:a54a02c4b963fdb16f24959e0137763f1"><td class="mdescLeft"> </td><td class="mdescRight">Function to remove digits preceeding the current digit. <br /></td></tr>
|
||||
<tr class="separator:a54a02c4b963fdb16f24959e0137763f1"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a3c04138a5bfe5d72780bb7e82a18e627"><td class="memItemLeft" align="right" valign="top"><a id="a3c04138a5bfe5d72780bb7e82a18e627"></a>
|
||||
|
||||
@ -146,7 +146,6 @@ $(document).ready(function(){initNavTree('db/dfb/hash_8h_source.html','../../');
|
||||
</div><!-- fragment --></div><!-- contents -->
|
||||
</div><!-- doc-content -->
|
||||
<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="aproblem__13_2sol1_8c_html_a0240ac851181b84ac374872dc5434ee4"><div class="ttname"><a href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a></div><div class="ttdeci">#define N</div><div class="ttdoc">number of digits of the large number</div><div class="ttdef"><b>Definition:</b> sol1.c:109</div></div>
|
||||
<div class="ttc" id="aspirograph_8c_html_a0daa148091ec953809fc172289f773d3"><div class="ttname"><a href="../../d7/d98/spirograph_8c.html#a0daa148091ec953809fc172289f773d3">spirograph</a></div><div class="ttdeci">void spirograph(double *x, double *y, double l, double k, size_t N, double rot)</div><div class="ttdoc">Generate spirograph curve into arrays x and y such that the i^th point in 2D is represented by (x[i],...</div><div class="ttdef"><b>Definition:</b> spirograph.c:57</div></div>
|
||||
<div class="ttc" id="aspirograph_8c_html_a708a4c1a4d0c4acc4c447310dd4db27f"><div class="ttname"><a href="../../d7/d98/spirograph_8c.html#a708a4c1a4d0c4acc4c447310dd4db27f">test</a></div><div class="ttdeci">void test(void)</div><div class="ttdoc">Test function to save resulting points to a CSV file.</div><div class="ttdef"><b>Definition:</b> spirograph.c:74</div></div>
|
||||
<div class="ttc" id="ac__atoi__str__to__integer_8c_html_a3c04138a5bfe5d72780bb7e82a18e627"><div class="ttname"><a href="../../d7/dd8/c__atoi__str__to__integer_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">main</a></div><div class="ttdeci">int main(int argc, char **argv)</div><div class="ttdoc">the main function take one argument of type char* example : .</div><div class="ttdef"><b>Definition:</b> c_atoi_str_to_integer.c:72</div></div>
|
||||
|
||||
@ -115,7 +115,7 @@ Functions</h2></td></tr>
|
||||
<tr class="memdesc:aae40b90a8efd645c749128cf8072bbb4"><td class="mdescLeft"> </td><td class="mdescRight">Perform LU decomposition on matrix. <a href="../../dc/d2e/lu__decompose_8c.html#aae40b90a8efd645c749128cf8072bbb4">More...</a><br /></td></tr>
|
||||
<tr class="separator:aae40b90a8efd645c749128cf8072bbb4"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a0789beb8d3396582d77b7aedf5e5554a"><td class="memItemLeft" align="right" valign="top"><a id="a0789beb8d3396582d77b7aedf5e5554a"></a>
|
||||
void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../dc/d2e/lu__decompose_8c.html#a0789beb8d3396582d77b7aedf5e5554a">display</a> (double **A, int <a class="el" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>)</td></tr>
|
||||
void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../dc/d2e/lu__decompose_8c.html#a0789beb8d3396582d77b7aedf5e5554a">display</a> (double **A, int N)</td></tr>
|
||||
<tr class="memdesc:a0789beb8d3396582d77b7aedf5e5554a"><td class="mdescLeft"> </td><td class="mdescRight">Function to display square matrix. <br /></td></tr>
|
||||
<tr class="separator:a0789beb8d3396582d77b7aedf5e5554a"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a3c04138a5bfe5d72780bb7e82a18e627"><td class="memItemLeft" align="right" valign="top"><a id="a3c04138a5bfe5d72780bb7e82a18e627"></a>
|
||||
|
||||
@ -152,7 +152,7 @@ Functions</h2></td></tr>
|
||||
<tr class="memitem:ga20d3642e0a87f36fdb7bf91b023cd166"><td class="memItemLeft" align="right" valign="top">double </td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d2a/group__adaline.html#ga20d3642e0a87f36fdb7bf91b023cd166">adaline_fit_sample</a> (struct <a class="el" href="../../d2/daa/structadaline.html">adaline</a> *ada, const double *x, const int y)</td></tr>
|
||||
<tr class="memdesc:ga20d3642e0a87f36fdb7bf91b023cd166"><td class="mdescLeft"> </td><td class="mdescRight">Update the weights of the model using supervised learning for one feature vector. <a href="../../da/d2a/group__adaline.html#ga20d3642e0a87f36fdb7bf91b023cd166">More...</a><br /></td></tr>
|
||||
<tr class="separator:ga20d3642e0a87f36fdb7bf91b023cd166"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:gaa52120912e32d2893fe1c6d78da5befd"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d2a/group__adaline.html#gaa52120912e32d2893fe1c6d78da5befd">adaline_fit</a> (struct <a class="el" href="../../d2/daa/structadaline.html">adaline</a> *ada, double **X, const int *y, const int <a class="el" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>)</td></tr>
|
||||
<tr class="memitem:gaa52120912e32d2893fe1c6d78da5befd"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d2a/group__adaline.html#gaa52120912e32d2893fe1c6d78da5befd">adaline_fit</a> (struct <a class="el" href="../../d2/daa/structadaline.html">adaline</a> *ada, double **X, const int *y, const int N)</td></tr>
|
||||
<tr class="memdesc:gaa52120912e32d2893fe1c6d78da5befd"><td class="mdescLeft"> </td><td class="mdescRight">Update the weights of the model using supervised learning for an array of vectors. <a href="../../da/d2a/group__adaline.html#gaa52120912e32d2893fe1c6d78da5befd">More...</a><br /></td></tr>
|
||||
<tr class="separator:gaa52120912e32d2893fe1c6d78da5befd"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:ab4ecb3accf5d9e0263087e7265bbe3a9"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d8c/adaline__learning_8c.html#ab4ecb3accf5d9e0263087e7265bbe3a9">test1</a> (double eta)</td></tr>
|
||||
@ -202,15 +202,15 @@ int </td><td class="memItemRight" valign="bottom"><a class="el" href="../..
|
||||
<div class="fragment"><div class="line"><a name="l00226"></a><span class="lineno"> 226</span> {</div>
|
||||
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <span class="keyword">struct </span><a class="code" href="../../d2/daa/structadaline.html">adaline</a> ada = <a class="code" href="../../da/d2a/group__adaline.html#gacd88962c5f6341e43cbc69b4a7d3485b">new_adaline</a>(2, <a class="code" href="../../d2/daa/structadaline.html#a85dbd7cce6195d11ebb388220b96bde2">eta</a>); <span class="comment">// 2 features</span></div>
|
||||
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  </div>
|
||||
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> = 10; <span class="comment">// number of sample points</span></div>
|
||||
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> N = 10; <span class="comment">// number of sample points</span></div>
|
||||
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> saved_X[10][2] = {{0, 1}, {1, -2}, {2, 3}, {3, -1},</div>
|
||||
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  {4, 1}, {6, -5}, {-7, -3}, {-8, 5},</div>
|
||||
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  {-9, 2}, {-10, -15}};</div>
|
||||
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  </div>
|
||||
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <span class="keywordtype">double</span> **X = (<span class="keywordtype">double</span> **)malloc(<a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> * <span class="keyword">sizeof</span>(<span class="keywordtype">double</span> *));</div>
|
||||
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <span class="keywordtype">double</span> **X = (<span class="keywordtype">double</span> **)malloc(N * <span class="keyword">sizeof</span>(<span class="keywordtype">double</span> *));</div>
|
||||
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> Y[10] = {1, -1, 1, -1, -1,</div>
|
||||
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  -1, 1, 1, 1, -1}; <span class="comment">// corresponding y-values</span></div>
|
||||
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>; i++)</div>
|
||||
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < N; i++)</div>
|
||||
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  {</div>
|
||||
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  X[i] = (<span class="keywordtype">double</span> *)saved_X[i];</div>
|
||||
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  }</div>
|
||||
@ -218,7 +218,7 @@ int </td><td class="memItemRight" valign="bottom"><a class="el" href="../..
|
||||
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  printf(<span class="stringliteral">"------- Test 1 -------\n"</span>);</div>
|
||||
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  printf(<span class="stringliteral">"Model before fit: %s"</span>, <a class="code" href="../../da/d2a/group__adaline.html#ga251695a79baa885cafdcf6d8ed4ac120">adaline_get_weights_str</a>(&ada));</div>
|
||||
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  </div>
|
||||
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <a class="code" href="../../da/d2a/group__adaline.html#gaa52120912e32d2893fe1c6d78da5befd">adaline_fit</a>(&ada, X, Y, <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>);</div>
|
||||
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <a class="code" href="../../da/d2a/group__adaline.html#gaa52120912e32d2893fe1c6d78da5befd">adaline_fit</a>(&ada, X, Y, N);</div>
|
||||
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  printf(<span class="stringliteral">"Model after fit: %s\n"</span>, <a class="code" href="../../da/d2a/group__adaline.html#ga251695a79baa885cafdcf6d8ed4ac120">adaline_get_weights_str</a>(&ada));</div>
|
||||
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  </div>
|
||||
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <span class="keywordtype">double</span> test_x[] = {5, -3};</div>
|
||||
@ -273,17 +273,17 @@ Here is the call graph for this function:</div>
|
||||
<div class="fragment"><div class="line"><a name="l00274"></a><span class="lineno"> 274</span> {</div>
|
||||
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="keyword">struct </span><a class="code" href="../../d2/daa/structadaline.html">adaline</a> ada = <a class="code" href="../../da/d2a/group__adaline.html#gacd88962c5f6341e43cbc69b4a7d3485b">new_adaline</a>(2, <a class="code" href="../../d2/daa/structadaline.html#a85dbd7cce6195d11ebb388220b96bde2">eta</a>); <span class="comment">// 2 features</span></div>
|
||||
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  </div>
|
||||
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> = 50; <span class="comment">// number of sample points</span></div>
|
||||
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> N = 50; <span class="comment">// number of sample points</span></div>
|
||||
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  </div>
|
||||
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="keywordtype">double</span> **X = (<span class="keywordtype">double</span> **)malloc(<a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> * <span class="keyword">sizeof</span>(<span class="keywordtype">double</span> *));</div>
|
||||
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <span class="keywordtype">int</span> *Y = (<span class="keywordtype">int</span> *)malloc(<a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> * <span class="keyword">sizeof</span>(<span class="keywordtype">int</span>)); <span class="comment">// corresponding y-values</span></div>
|
||||
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>; i++) X[i] = (<span class="keywordtype">double</span> *)malloc(2 * <span class="keyword">sizeof</span>(<span class="keywordtype">double</span>));</div>
|
||||
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="keywordtype">double</span> **X = (<span class="keywordtype">double</span> **)malloc(N * <span class="keyword">sizeof</span>(<span class="keywordtype">double</span> *));</div>
|
||||
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <span class="keywordtype">int</span> *Y = (<span class="keywordtype">int</span> *)malloc(N * <span class="keyword">sizeof</span>(<span class="keywordtype">int</span>)); <span class="comment">// corresponding y-values</span></div>
|
||||
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < N; i++) X[i] = (<span class="keywordtype">double</span> *)malloc(2 * <span class="keyword">sizeof</span>(<span class="keywordtype">double</span>));</div>
|
||||
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  </div>
|
||||
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  <span class="comment">// generate sample points in the interval</span></div>
|
||||
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  <span class="comment">// [-range2/100 , (range2-1)/100]</span></div>
|
||||
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="keywordtype">int</span> <a class="code" href="../../df/dea/structdata.html">range</a> = 500; <span class="comment">// sample points full-range</span></div>
|
||||
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <span class="keywordtype">int</span> range2 = <a class="code" href="../../df/dea/structdata.html">range</a> >> 1; <span class="comment">// sample points half-range</span></div>
|
||||
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>; i++)</div>
|
||||
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < N; i++)</div>
|
||||
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  {</div>
|
||||
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <span class="keywordtype">double</span> x0 = ((rand() % <a class="code" href="../../df/dea/structdata.html">range</a>) - range2) / 100.f;</div>
|
||||
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  <span class="keywordtype">double</span> x1 = ((rand() % <a class="code" href="../../df/dea/structdata.html">range</a>) - range2) / 100.f;</div>
|
||||
@ -295,7 +295,7 @@ Here is the call graph for this function:</div>
|
||||
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  printf(<span class="stringliteral">"------- Test 2 -------\n"</span>);</div>
|
||||
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  printf(<span class="stringliteral">"Model before fit: %s"</span>, <a class="code" href="../../da/d2a/group__adaline.html#ga251695a79baa885cafdcf6d8ed4ac120">adaline_get_weights_str</a>(&ada));</div>
|
||||
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  </div>
|
||||
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <a class="code" href="../../da/d2a/group__adaline.html#gaa52120912e32d2893fe1c6d78da5befd">adaline_fit</a>(&ada, X, Y, <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>);</div>
|
||||
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <a class="code" href="../../da/d2a/group__adaline.html#gaa52120912e32d2893fe1c6d78da5befd">adaline_fit</a>(&ada, X, Y, N);</div>
|
||||
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  printf(<span class="stringliteral">"Model after fit: %s\n"</span>, <a class="code" href="../../da/d2a/group__adaline.html#ga251695a79baa885cafdcf6d8ed4ac120">adaline_get_weights_str</a>(&ada));</div>
|
||||
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  </div>
|
||||
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  <span class="keywordtype">int</span> N_test_cases = 5;</div>
|
||||
@ -315,7 +315,7 @@ Here is the call graph for this function:</div>
|
||||
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  printf(<span class="stringliteral">" ...passed\n"</span>);</div>
|
||||
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  }</div>
|
||||
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  </div>
|
||||
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>; i++) free(X[i]);</div>
|
||||
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < N; i++) free(X[i]);</div>
|
||||
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  free(X);</div>
|
||||
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  free(Y);</div>
|
||||
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  <a class="code" href="../../da/d2a/group__adaline.html#ga6f35caa3084772cc126ac7b20f67f665">delete_adaline</a>(&ada);</div>
|
||||
@ -356,17 +356,17 @@ Here is the call graph for this function:</div>
|
||||
<div class="fragment"><div class="line"><a name="l00337"></a><span class="lineno"> 337</span> {</div>
|
||||
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  <span class="keyword">struct </span><a class="code" href="../../d2/daa/structadaline.html">adaline</a> ada = <a class="code" href="../../da/d2a/group__adaline.html#gacd88962c5f6341e43cbc69b4a7d3485b">new_adaline</a>(6, <a class="code" href="../../d2/daa/structadaline.html#a85dbd7cce6195d11ebb388220b96bde2">eta</a>); <span class="comment">// 2 features</span></div>
|
||||
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  </div>
|
||||
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> = 50; <span class="comment">// number of sample points</span></div>
|
||||
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> N = 50; <span class="comment">// number of sample points</span></div>
|
||||
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  </div>
|
||||
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  <span class="keywordtype">double</span> **X = (<span class="keywordtype">double</span> **)malloc(<a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> * <span class="keyword">sizeof</span>(<span class="keywordtype">double</span> *));</div>
|
||||
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  <span class="keywordtype">int</span> *Y = (<span class="keywordtype">int</span> *)malloc(<a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> * <span class="keyword">sizeof</span>(<span class="keywordtype">int</span>)); <span class="comment">// corresponding y-values</span></div>
|
||||
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>; i++) X[i] = (<span class="keywordtype">double</span> *)malloc(6 * <span class="keyword">sizeof</span>(<span class="keywordtype">double</span>));</div>
|
||||
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  <span class="keywordtype">double</span> **X = (<span class="keywordtype">double</span> **)malloc(N * <span class="keyword">sizeof</span>(<span class="keywordtype">double</span> *));</div>
|
||||
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  <span class="keywordtype">int</span> *Y = (<span class="keywordtype">int</span> *)malloc(N * <span class="keyword">sizeof</span>(<span class="keywordtype">int</span>)); <span class="comment">// corresponding y-values</span></div>
|
||||
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < N; i++) X[i] = (<span class="keywordtype">double</span> *)malloc(6 * <span class="keyword">sizeof</span>(<span class="keywordtype">double</span>));</div>
|
||||
<div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  </div>
|
||||
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <span class="comment">// generate sample points in the interval</span></div>
|
||||
<div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  <span class="comment">// [-range2/100 , (range2-1)/100]</span></div>
|
||||
<div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  <span class="keywordtype">int</span> <a class="code" href="../../df/dea/structdata.html">range</a> = 200; <span class="comment">// sample points full-range</span></div>
|
||||
<div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  <span class="keywordtype">int</span> range2 = <a class="code" href="../../df/dea/structdata.html">range</a> >> 1; <span class="comment">// sample points half-range</span></div>
|
||||
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>; i++)</div>
|
||||
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < N; i++)</div>
|
||||
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  {</div>
|
||||
<div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  <span class="keywordtype">double</span> x0 = ((rand() % <a class="code" href="../../df/dea/structdata.html">range</a>) - range2) / 100.f;</div>
|
||||
<div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  <span class="keywordtype">double</span> x1 = ((rand() % <a class="code" href="../../df/dea/structdata.html">range</a>) - range2) / 100.f;</div>
|
||||
@ -383,7 +383,7 @@ Here is the call graph for this function:</div>
|
||||
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  printf(<span class="stringliteral">"------- Test 3 -------\n"</span>);</div>
|
||||
<div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  printf(<span class="stringliteral">"Model before fit: %s"</span>, <a class="code" href="../../da/d2a/group__adaline.html#ga251695a79baa885cafdcf6d8ed4ac120">adaline_get_weights_str</a>(&ada));</div>
|
||||
<div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  </div>
|
||||
<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  <a class="code" href="../../da/d2a/group__adaline.html#gaa52120912e32d2893fe1c6d78da5befd">adaline_fit</a>(&ada, X, Y, <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>);</div>
|
||||
<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  <a class="code" href="../../da/d2a/group__adaline.html#gaa52120912e32d2893fe1c6d78da5befd">adaline_fit</a>(&ada, X, Y, N);</div>
|
||||
<div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  printf(<span class="stringliteral">"Model after fit: %s\n"</span>, <a class="code" href="../../da/d2a/group__adaline.html#ga251695a79baa885cafdcf6d8ed4ac120">adaline_get_weights_str</a>(&ada));</div>
|
||||
<div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  </div>
|
||||
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  <span class="keywordtype">int</span> N_test_cases = 5;</div>
|
||||
@ -407,7 +407,7 @@ Here is the call graph for this function:</div>
|
||||
<div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  printf(<span class="stringliteral">" ...passed\n"</span>);</div>
|
||||
<div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  }</div>
|
||||
<div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  </div>
|
||||
<div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>; i++) free(X[i]);</div>
|
||||
<div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < N; i++) free(X[i]);</div>
|
||||
<div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  free(X);</div>
|
||||
<div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  free(Y);</div>
|
||||
<div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  <a class="code" href="../../da/d2a/group__adaline.html#ga6f35caa3084772cc126ac7b20f67f665">delete_adaline</a>(&ada);</div>
|
||||
@ -425,7 +425,6 @@ Here is the call graph for this function:</div>
|
||||
</div><!-- doc-content -->
|
||||
<div class="ttc" id="agroup__adaline_html_gaa52120912e32d2893fe1c6d78da5befd"><div class="ttname"><a href="../../da/d2a/group__adaline.html#gaa52120912e32d2893fe1c6d78da5befd">adaline_fit</a></div><div class="ttdeci">void adaline_fit(struct adaline *ada, double **X, const int *y, const int N)</div><div class="ttdoc">Update the weights of the model using supervised learning for an array of vectors.</div><div class="ttdef"><b>Definition:</b> adaline_learning.c:184</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="aproblem__13_2sol1_8c_html_a0240ac851181b84ac374872dc5434ee4"><div class="ttname"><a href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a></div><div class="ttdeci">#define N</div><div class="ttdoc">number of digits of the large number</div><div class="ttdef"><b>Definition:</b> sol1.c:109</div></div>
|
||||
<div class="ttc" id="astructadaline_html_a85dbd7cce6195d11ebb388220b96bde2"><div class="ttname"><a href="../../d2/daa/structadaline.html#a85dbd7cce6195d11ebb388220b96bde2">adaline::eta</a></div><div class="ttdeci">double eta</div><div class="ttdoc">learning rate of the algorithm</div><div class="ttdef"><b>Definition:</b> adaline_learning.c:45</div></div>
|
||||
<div class="ttc" id="agroup__adaline_html_ga6f35caa3084772cc126ac7b20f67f665"><div class="ttname"><a href="../../da/d2a/group__adaline.html#ga6f35caa3084772cc126ac7b20f67f665">delete_adaline</a></div><div class="ttdeci">void delete_adaline(struct adaline *ada)</div><div class="ttdoc">delete dynamically allocated memory</div><div class="ttdef"><b>Definition:</b> adaline_learning.c:89</div></div>
|
||||
<div class="ttc" id="agroup__adaline_html_gac70b578aee679005fd336073969c3d94"><div class="ttname"><a href="../../da/d2a/group__adaline.html#gac70b578aee679005fd336073969c3d94">adaline_predict</a></div><div class="ttdeci">int adaline_predict(struct adaline *ada, const double *x, double *out)</div><div class="ttdoc">predict the output of the model for given set of features</div><div class="ttdef"><b>Definition:</b> adaline_learning.c:136</div></div>
|
||||
|
||||
@ -112,7 +112,7 @@ Include dependency graph for sol1.c:</div>
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
|
||||
Functions</h2></td></tr>
|
||||
<tr class="memitem:aacf4b7e708651d2164e86958f2c29c93"><td class="memItemLeft" align="right" valign="top"><a id="aacf4b7e708651d2164e86958f2c29c93"></a>
|
||||
unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/d1a/problem__21_2sol1_8c.html#aacf4b7e708651d2164e86958f2c29c93">sum_of_divisors</a> (unsigned int <a class="el" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>)</td></tr>
|
||||
unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/d1a/problem__21_2sol1_8c.html#aacf4b7e708651d2164e86958f2c29c93">sum_of_divisors</a> (unsigned int N)</td></tr>
|
||||
<tr class="memdesc:aacf4b7e708651d2164e86958f2c29c93"><td class="mdescLeft"> </td><td class="mdescRight">function to return the sum of proper divisors of N <br /></td></tr>
|
||||
<tr class="separator:aacf4b7e708651d2164e86958f2c29c93"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a3c04138a5bfe5d72780bb7e82a18e627"><td class="memItemLeft" align="right" valign="top"><a id="a3c04138a5bfe5d72780bb7e82a18e627"></a>
|
||||
|
||||
@ -93,9 +93,9 @@ $(document).ready(function(){initNavTree('globals_defs.html',''); initResizable(
|
||||
 <ul>
|
||||
<li>_USE_MATH_DEFINES
|
||||
: <a class="el" href="d7/d98/spirograph_8c.html#a525335710b53cb064ca56b936120431e">spirograph.c</a>
|
||||
, <a class="el" href="d2/df6/kohonen__som__topology_8c.html#a525335710b53cb064ca56b936120431e">kohonen_som_topology.c</a>
|
||||
, <a class="el" href="d0/d46/kohonen__som__trace_8c.html#a525335710b53cb064ca56b936120431e">kohonen_som_trace.c</a>
|
||||
, <a class="el" href="d6/d2e/cartesian__to__polar_8c.html#a525335710b53cb064ca56b936120431e">cartesian_to_polar.c</a>
|
||||
, <a class="el" href="d0/d46/kohonen__som__trace_8c.html#a525335710b53cb064ca56b936120431e">kohonen_som_trace.c</a>
|
||||
, <a class="el" href="d2/df6/kohonen__som__topology_8c.html#a525335710b53cb064ca56b936120431e">kohonen_som_topology.c</a>
|
||||
</li>
|
||||
<li>ACCURACY
|
||||
: <a class="el" href="da/d38/durand__kerner__roots_8c.html#af270a96662132d0385cb6b4637c5a689">durand_kerner_roots.c</a>
|
||||
@ -126,12 +126,12 @@ $(document).ready(function(){initNavTree('globals_defs.html',''); initResizable(
|
||||
<li>MAX_DIGITS
|
||||
: <a class="el" href="d8/d32/problem__25_2sol1_8c.html#a001791a21d538b8b9176287ae60d9b61">sol1.c</a>
|
||||
</li>
|
||||
<li>MAX_L
|
||||
: <a class="el" href="d4/d83/problem__401_2sol1_8c.html#adf2a0717e3307419a9d7c52707f5631e">sol1.c</a>
|
||||
</li>
|
||||
<li>MAX_LEN
|
||||
: <a class="el" href="d1/df9/problem__26_2sol1_8c.html#aabf4f709c8199e41cf279c77112345fe">sol1.c</a>
|
||||
</li>
|
||||
<li>MAX_LENGTH
|
||||
: <a class="el" href="d4/d83/problem__401_2sol1_8c.html#a7a9a231e30b47bc0345749c8bd1e5077">sol1.c</a>
|
||||
</li>
|
||||
<li>MAX_NAME_LEN
|
||||
: <a class="el" href="dd/d8b/problem__22_2sol1_8c.html#afd709f201d7643c3909621f620ea648a">sol1.c</a>
|
||||
</li>
|
||||
@ -142,23 +142,17 @@ $(document).ready(function(){initNavTree('globals_defs.html',''); initResizable(
|
||||
: <a class="el" href="df/df3/union__find_8c.html#a0592dba56693fad79136250c11e5a7fe">union_find.c</a>
|
||||
</li>
|
||||
<li>min
|
||||
: <a class="el" href="d6/d7b/jump__search_8c.html#a8195a86b6d75b9a3939505e8bb50021e">jump_search.c</a>
|
||||
: <a class="el" href="d0/dcb/group__kohonen__1d.html#gac6afabdc09a49a433ee19d8a9486056d">kohonen_som_trace.c</a>
|
||||
, <a class="el" href="d6/d7b/jump__search_8c.html#a8195a86b6d75b9a3939505e8bb50021e">jump_search.c</a>
|
||||
, <a class="el" href="d1/d6b/group__kohonen__2d.html#gac6afabdc09a49a433ee19d8a9486056d">kohonen_som_topology.c</a>
|
||||
, <a class="el" href="d0/dcb/group__kohonen__1d.html#gac6afabdc09a49a433ee19d8a9486056d">kohonen_som_trace.c</a>
|
||||
</li>
|
||||
<li>MOD
|
||||
: <a class="el" href="d4/d83/problem__401_2sol1_8c.html#aca7d5718ab8c38506adb3bef2469b319">sol1.c</a>
|
||||
</li>
|
||||
<li>N
|
||||
: <a class="el" href="db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">sol1.c</a>
|
||||
</li>
|
||||
<li>N2
|
||||
: <a class="el" href="db/d01/problem__13_2sol1_8c.html#acd864640121c7df2c19f61f7baa507e4">sol1.c</a>
|
||||
<li>MOD_LIMIT
|
||||
: <a class="el" href="d4/d83/problem__401_2sol1_8c.html#ade1bdf2529e3c58f53bfb4d844f3a9d3">sol1.c</a>
|
||||
</li>
|
||||
<li>order
|
||||
: <a class="el" href="d4/d07/ode__forward__euler_8c.html#a9ceb646336224ee890a269d0b4600d09">ode_forward_euler.c</a>
|
||||
, <a class="el" href="d1/dc2/ode__midpoint__euler_8c.html#a9ceb646336224ee890a269d0b4600d09">ode_midpoint_euler.c</a>
|
||||
, <a class="el" href="d4/d99/ode__semi__implicit__euler_8c.html#a9ceb646336224ee890a269d0b4600d09">ode_semi_implicit_euler.c</a>
|
||||
, <a class="el" href="d1/dc2/ode__midpoint__euler_8c.html#a9ceb646336224ee890a269d0b4600d09">ode_midpoint_euler.c</a>
|
||||
</li>
|
||||
</ul>
|
||||
</div><!-- contents -->
|
||||
|
||||
@ -113,8 +113,6 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
|
||||
, <a class="el" href="d4/d99/ode__semi__implicit__euler_8c.html#a0ddf1224851353fc92bfbff6f499fa97">ode_semi_implicit_euler.c</a>
|
||||
, <a class="el" href="d7/ddb/problem__23_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">sol1.c</a>
|
||||
, <a class="el" href="d4/dbd/problem__23_2sol2_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">sol2.c</a>
|
||||
, <a class="el" href="d5/d23/qr__decomposition_8c.html#a840291bc02cba5474a4cb46a9b9566fe">qr_decomposition.c</a>
|
||||
, <a class="el" href="d8/d32/problem__25_2sol1_8c.html#a0ddf1224851353fc92bfbff6f499fa97">sol1.c</a>
|
||||
, <a class="el" href="d6/ded/shell__sort2_8c.html#a0ddf1224851353fc92bfbff6f499fa97">shell_sort2.c</a>
|
||||
, <a class="el" href="d2/d83/merge__sort_8c.html#a840291bc02cba5474a4cb46a9b9566fe">merge_sort.c</a>
|
||||
, <a class="el" href="d2/da8/bead__sort_8c.html#ac0f2228420376f4db7e1274f2b41667c">bead_sort.c</a>
|
||||
@ -129,10 +127,11 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
|
||||
, <a class="el" href="d4/d83/problem__401_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">sol1.c</a>
|
||||
, <a class="el" href="d0/d6c/problem__4_2sol_8c.html#a840291bc02cba5474a4cb46a9b9566fe">sol.c</a>
|
||||
, <a class="el" href="d2/dbc/problem__3_2sol2_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">sol2.c</a>
|
||||
, <a class="el" href="d1/df9/problem__26_2sol1_8c.html#a0ddf1224851353fc92bfbff6f499fa97">sol1.c</a>
|
||||
, <a class="el" href="d7/dd3/problem__3_2sol1_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">sol1.c</a>
|
||||
, <a class="el" href="d5/d23/qr__decomposition_8c.html#a840291bc02cba5474a4cb46a9b9566fe">qr_decomposition.c</a>
|
||||
, <a class="el" href="d8/d32/problem__25_2sol1_8c.html#a0ddf1224851353fc92bfbff6f499fa97">sol1.c</a>
|
||||
, <a class="el" href="d4/d99/fibonacci__fast_8c.html#a0ddf1224851353fc92bfbff6f499fa97">fibonacci_fast.c</a>
|
||||
, <a class="el" href="d7/d50/qr__eigen__values_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">qr_eigen_values.c</a>
|
||||
, <a class="el" href="d7/dd3/problem__3_2sol1_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">sol1.c</a>
|
||||
, <a class="el" href="dc/d47/realtime__stats_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">realtime_stats.c</a>
|
||||
, <a class="el" href="d7/d98/spirograph_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">spirograph.c</a>
|
||||
, <a class="el" href="d0/d46/kohonen__som__trace_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">kohonen_som_trace.c</a>
|
||||
@ -140,13 +139,13 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
|
||||
, <a class="el" href="da/d35/problem__1_2sol1_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">sol1.c</a>
|
||||
, <a class="el" href="d2/dae/problem__1_2sol2_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">sol2.c</a>
|
||||
, <a class="el" href="de/dac/sudoku__solver_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">sudoku_solver.c</a>
|
||||
, <a class="el" href="d6/de3/sol3_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">sol3.c</a>
|
||||
, <a class="el" href="d6/d1b/sol4_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">sol4.c</a>
|
||||
, <a class="el" href="db/d01/problem__13_2sol1_8c.html#a840291bc02cba5474a4cb46a9b9566fe">sol1.c</a>
|
||||
, <a class="el" href="d9/da7/problem__10_2sol2_8c.html#a0ddf1224851353fc92bfbff6f499fa97">sol2.c</a>
|
||||
, <a class="el" href="d0/d6d/problem__10_2sol1_8c.html#a0ddf1224851353fc92bfbff6f499fa97">sol1.c</a>
|
||||
, <a class="el" href="d6/de3/sol3_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">sol3.c</a>
|
||||
, <a class="el" href="d6/d1b/sol4_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">sol4.c</a>
|
||||
, <a class="el" href="dc/d80/cantor__set_8c.html#abf9e6b7e6f15df4b525a2e7705ba3089">cantor_set.c</a>
|
||||
, <a class="el" href="df/df3/union__find_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">union_find.c</a>
|
||||
, <a class="el" href="d0/d6d/problem__10_2sol1_8c.html#a0ddf1224851353fc92bfbff6f499fa97">sol1.c</a>
|
||||
, <a class="el" href="da/d38/durand__kerner__roots_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">durand_kerner_roots.c</a>
|
||||
</li>
|
||||
<li>mat_mul()
|
||||
@ -165,15 +164,11 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
|
||||
<li>MAX_DIGITS
|
||||
: <a class="el" href="d8/d32/problem__25_2sol1_8c.html#a001791a21d538b8b9176287ae60d9b61">sol1.c</a>
|
||||
</li>
|
||||
<li>MAX_L
|
||||
: <a class="el" href="d4/d83/problem__401_2sol1_8c.html#adf2a0717e3307419a9d7c52707f5631e">sol1.c</a>
|
||||
</li>
|
||||
<li>MAX_LEN
|
||||
: <a class="el" href="d1/df9/problem__26_2sol1_8c.html#aabf4f709c8199e41cf279c77112345fe">sol1.c</a>
|
||||
</li>
|
||||
<li>MAX_N
|
||||
: <a class="el" href="d7/ddb/problem__23_2sol1_8c.html#a337e545af040d754dc012b42523ee1ee">sol1.c</a>
|
||||
, <a class="el" href="d4/dbd/problem__23_2sol2_8c.html#a8c7ddb39906f281b801f2cd58d416c2b">sol2.c</a>
|
||||
<li>MAX_LENGTH
|
||||
: <a class="el" href="d4/d83/problem__401_2sol1_8c.html#a7a9a231e30b47bc0345749c8bd1e5077">sol1.c</a>
|
||||
</li>
|
||||
<li>MAX_NAME_LEN
|
||||
: <a class="el" href="dd/d8b/problem__22_2sol1_8c.html#afd709f201d7643c3909621f620ea648a">sol1.c</a>
|
||||
@ -201,8 +196,8 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
|
||||
, <a class="el" href="d0/dcb/group__kohonen__1d.html#gac6afabdc09a49a433ee19d8a9486056d">kohonen_som_trace.c</a>
|
||||
, <a class="el" href="d1/d6b/group__kohonen__2d.html#gac6afabdc09a49a433ee19d8a9486056d">kohonen_som_topology.c</a>
|
||||
</li>
|
||||
<li>MOD
|
||||
: <a class="el" href="d4/d83/problem__401_2sol1_8c.html#aca7d5718ab8c38506adb3bef2469b319">sol1.c</a>
|
||||
<li>MOD_LIMIT
|
||||
: <a class="el" href="d4/d83/problem__401_2sol1_8c.html#ade1bdf2529e3c58f53bfb4d844f3a9d3">sol1.c</a>
|
||||
</li>
|
||||
<li>modifiedBinarySearch()
|
||||
: <a class="el" href="d3/d47/modified__binary__search_8c.html#a7df9a198e30cded6229d79bef7591f8f">modified_binary_search.c</a>
|
||||
|
||||
@ -93,12 +93,6 @@ $(document).ready(function(){initNavTree('globals_n.html',''); initResizable();
|
||||
<div class="textblock">Here is a list of all documented functions, variables, defines, enums, and typedefs with links to the documentation:</div>
|
||||
|
||||
<h3><a id="index_n"></a>- n -</h3><ul>
|
||||
<li>N
|
||||
: <a class="el" href="db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">sol1.c</a>
|
||||
</li>
|
||||
<li>N2
|
||||
: <a class="el" href="db/d01/problem__13_2sol1_8c.html#acd864640121c7df2c19f61f7baa507e4">sol1.c</a>
|
||||
</li>
|
||||
<li>new_adaline()
|
||||
: <a class="el" href="da/d2a/group__adaline.html#gacd88962c5f6341e43cbc69b4a7d3485b">adaline_learning.c</a>
|
||||
</li>
|
||||
|
||||
@ -94,10 +94,6 @@ $(document).ready(function(){initNavTree('globals_vars.html',''); initResizable(
|
||||
<li>abundant_flags
|
||||
: <a class="el" href="d4/dbd/problem__23_2sol2_8c.html#af920a16d6ef69dd604b283f427892e06">sol2.c</a>
|
||||
</li>
|
||||
<li>MAX_N
|
||||
: <a class="el" href="d7/ddb/problem__23_2sol1_8c.html#a337e545af040d754dc012b42523ee1ee">sol1.c</a>
|
||||
, <a class="el" href="d4/dbd/problem__23_2sol2_8c.html#a8c7ddb39906f281b801f2cd58d416c2b">sol2.c</a>
|
||||
</li>
|
||||
</ul>
|
||||
</div><!-- contents -->
|
||||
</div><!-- doc-content -->
|
||||
|
||||
@ -86,8 +86,8 @@ var NAVTREE =
|
||||
var NAVTREEINDEX =
|
||||
[
|
||||
"annotated.html",
|
||||
"d5/da1/structnode.html#a1aa632fdf50713d86192a96f8191851b",
|
||||
"de/dac/sudoku__solver_8c.html"
|
||||
"d5/da1/structnode.html#a2783f1aec750191646305988f7e28756",
|
||||
"de/dce/structmin__heap.html#a456c6372c103c6d1bb430f581f5d3c71"
|
||||
];
|
||||
|
||||
var SYNCONMSG = 'click to disable panel synchronisation';
|
||||
|
||||
@ -170,10 +170,10 @@ var NAVTREEINDEX0 =
|
||||
"d4/d83/problem__401_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[12,0,8,17,0,5],
|
||||
"d4/d83/problem__401_2sol1_8c.html#a4441a6d27134cf3aed05727800d99456":[12,0,8,17,0,4],
|
||||
"d4/d83/problem__401_2sol1_8c.html#a7380e14d595d560007b02ce516b6b215":[12,0,8,17,0,3],
|
||||
"d4/d83/problem__401_2sol1_8c.html#a7a9a231e30b47bc0345749c8bd1e5077":[12,0,8,17,0,1],
|
||||
"d4/d83/problem__401_2sol1_8c.html#aacbb9e1f38be71e22df1584a37c56693":[12,0,8,17,0,0],
|
||||
"d4/d83/problem__401_2sol1_8c.html#aaf964739be92adc2f500e7da11e3f6be":[12,0,8,17,0,6],
|
||||
"d4/d83/problem__401_2sol1_8c.html#aca7d5718ab8c38506adb3bef2469b319":[12,0,8,17,0,2],
|
||||
"d4/d83/problem__401_2sol1_8c.html#adf2a0717e3307419a9d7c52707f5631e":[12,0,8,17,0,1],
|
||||
"d4/d83/problem__401_2sol1_8c.html#ade1bdf2529e3c58f53bfb4d844f3a9d3":[12,0,8,17,0,2],
|
||||
"d4/d99/fibonacci__fast_8c.html":[12,0,6,4],
|
||||
"d4/d99/fibonacci__fast_8c.html#a0ddf1224851353fc92bfbff6f499fa97":[12,0,6,4,1],
|
||||
"d4/d99/fibonacci__fast_8c.html#a7a3d55bd19854075cba2eed6b63cb2d3":[12,0,6,4,0],
|
||||
@ -189,7 +189,6 @@ var NAVTREEINDEX0 =
|
||||
"d4/dbd/problem__23_2sol2_8c.html#a34f4ad85151e3a43368ae67f42347f56":[12,0,8,12,1,2],
|
||||
"d4/dbd/problem__23_2sol2_8c.html#a3ab61b5a1c4f2288625d160aa0ea8478":[12,0,8,12,1,3],
|
||||
"d4/dbd/problem__23_2sol2_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[12,0,8,12,1,4],
|
||||
"d4/dbd/problem__23_2sol2_8c.html#a8c7ddb39906f281b801f2cd58d416c2b":[12,0,8,12,1,6],
|
||||
"d4/dbd/problem__23_2sol2_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf":[12,0,8,12,1,0],
|
||||
"d4/dbd/problem__23_2sol2_8c.html#af920a16d6ef69dd604b283f427892e06":[12,0,8,12,1,5],
|
||||
"d4/dcb/md_hash__r_e_a_d_m_e.html":[7],
|
||||
@ -249,5 +248,6 @@ var NAVTREEINDEX0 =
|
||||
"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md26":[5,12],
|
||||
"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md27":[5,13],
|
||||
"d5/da1/structnode.html":[11,0,20],
|
||||
"d5/da1/structnode.html#a111a569ab2765add9b91c9f94cf9f063":[11,0,20,7]
|
||||
"d5/da1/structnode.html#a111a569ab2765add9b91c9f94cf9f063":[11,0,20,7],
|
||||
"d5/da1/structnode.html#a1aa632fdf50713d86192a96f8191851b":[11,0,20,6]
|
||||
};
|
||||
|
||||
@ -1,6 +1,5 @@
|
||||
var NAVTREEINDEX1 =
|
||||
{
|
||||
"d5/da1/structnode.html#a1aa632fdf50713d86192a96f8191851b":[11,0,20,6],
|
||||
"d5/da1/structnode.html#a2783f1aec750191646305988f7e28756":[11,0,20,5],
|
||||
"d5/da1/structnode.html#a2d890bb9f6af0ffd73fe79b21124c2a2":[11,0,20,2],
|
||||
"d5/da1/structnode.html#a310a09cb5a882788781a5287096ad425":[11,0,20,0],
|
||||
@ -99,7 +98,6 @@ var NAVTREEINDEX1 =
|
||||
"d7/dd8/c__atoi__str__to__integer_8c.html#ad19049ebfc2088bc1e75e7e958f7b60f":[12,0,0,0,0],
|
||||
"d7/ddb/problem__23_2sol1_8c.html":[12,0,8,12,0],
|
||||
"d7/ddb/problem__23_2sol1_8c.html#a1aca7f530f82b27100262adba9e7556b":[12,0,8,12,0,1],
|
||||
"d7/ddb/problem__23_2sol1_8c.html#a337e545af040d754dc012b42523ee1ee":[12,0,8,12,0,5],
|
||||
"d7/ddb/problem__23_2sol1_8c.html#a3ab61b5a1c4f2288625d160aa0ea8478":[12,0,8,12,0,3],
|
||||
"d7/ddb/problem__23_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[12,0,8,12,0,4],
|
||||
"d7/ddb/problem__23_2sol1_8c.html#a4f128410e6582fe26488e2316cc96e17":[12,0,8,12,0,2],
|
||||
@ -149,8 +147,8 @@ var NAVTREEINDEX1 =
|
||||
"da/d2a/group__adaline.html#ga555ba960994e9bccb2029764588f694f":[10,0,5,2],
|
||||
"da/d2a/group__adaline.html#ga6f35caa3084772cc126ac7b20f67f665":[12,0,5,0,7],
|
||||
"da/d2a/group__adaline.html#ga6f35caa3084772cc126ac7b20f67f665":[10,0,5,8],
|
||||
"da/d2a/group__adaline.html#gaa52120912e32d2893fe1c6d78da5befd":[12,0,5,0,3],
|
||||
"da/d2a/group__adaline.html#gaa52120912e32d2893fe1c6d78da5befd":[10,0,5,4],
|
||||
"da/d2a/group__adaline.html#gaa52120912e32d2893fe1c6d78da5befd":[12,0,5,0,3],
|
||||
"da/d2a/group__adaline.html#gab4d49d73dec94c092b7ffadba55fb020":[12,0,5,0,0],
|
||||
"da/d2a/group__adaline.html#gab4d49d73dec94c092b7ffadba55fb020":[10,0,5,1],
|
||||
"da/d2a/group__adaline.html#gac70b578aee679005fd336073969c3d94":[12,0,5,0,6],
|
||||
@ -171,12 +169,10 @@ var NAVTREEINDEX1 =
|
||||
"da/d9b/struct_trie_node.html#a9dc2a9bc247486fac3e4b350c73a3060":[11,0,29,1],
|
||||
"da/d9b/struct_trie_node.html#ab2732ce1e141346865d997859836d663":[11,0,29,2],
|
||||
"db/d01/problem__13_2sol1_8c.html":[12,0,8,3,0],
|
||||
"db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4":[12,0,8,3,0,0],
|
||||
"db/d01/problem__13_2sol1_8c.html#a248adc917818cc6666d8bc679a660319":[12,0,8,3,0,5],
|
||||
"db/d01/problem__13_2sol1_8c.html#a840291bc02cba5474a4cb46a9b9566fe":[12,0,8,3,0,4],
|
||||
"db/d01/problem__13_2sol1_8c.html#ac260f58785fb20eb09bb35385a7d47f8":[12,0,8,3,0,3],
|
||||
"db/d01/problem__13_2sol1_8c.html#acd864640121c7df2c19f61f7baa507e4":[12,0,8,3,0,1],
|
||||
"db/d01/problem__13_2sol1_8c.html#ad51742ca5a5c99e860bdf30299163bf2":[12,0,8,3,0,2],
|
||||
"db/d01/problem__13_2sol1_8c.html#a248adc917818cc6666d8bc679a660319":[12,0,8,3,0,3],
|
||||
"db/d01/problem__13_2sol1_8c.html#a840291bc02cba5474a4cb46a9b9566fe":[12,0,8,3,0,2],
|
||||
"db/d01/problem__13_2sol1_8c.html#ac260f58785fb20eb09bb35385a7d47f8":[12,0,8,3,0,1],
|
||||
"db/d01/problem__13_2sol1_8c.html#ad51742ca5a5c99e860bdf30299163bf2":[12,0,8,3,0,0],
|
||||
"db/d80/problem__20_2sol1_8c.html":[12,0,8,9,0],
|
||||
"db/d80/problem__20_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[12,0,8,9,0,3],
|
||||
"db/d80/problem__20_2sol1_8c.html#a54a02c4b963fdb16f24959e0137763f1":[12,0,8,9,0,4],
|
||||
@ -249,5 +245,9 @@ var NAVTREEINDEX1 =
|
||||
"dd/df0/problem__19_2sol1_8c.html#a6561b1adc8a19c092679b9874da24e2e":[12,0,8,7,0,1],
|
||||
"dd/df0/problem__19_2sol1_8c.html#ab7f9ad087f124b8e0615aa535b4c8a75":[12,0,8,7,0,0],
|
||||
"de/d20/md_data_structures_dictionary__r_e_a_d_m_e.html":[3],
|
||||
"de/d20/md_data_structures_dictionary__r_e_a_d_m_e.html#autotoc_md9":[0]
|
||||
"de/d20/md_data_structures_dictionary__r_e_a_d_m_e.html#autotoc_md9":[0],
|
||||
"de/dac/sudoku__solver_8c.html":[12,0,6,6],
|
||||
"de/dac/sudoku__solver_8c.html#ae1a3968e7947464bee7714f6d43b7002":[12,0,6,6,8],
|
||||
"de/dac/sudoku__solver_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[12,0,6,6,1],
|
||||
"de/dce/structmin__heap.html":[11,0,18]
|
||||
};
|
||||
|
||||
@ -1,9 +1,5 @@
|
||||
var NAVTREEINDEX2 =
|
||||
{
|
||||
"de/dac/sudoku__solver_8c.html":[12,0,6,6],
|
||||
"de/dac/sudoku__solver_8c.html#ae1a3968e7947464bee7714f6d43b7002":[12,0,6,6,8],
|
||||
"de/dac/sudoku__solver_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[12,0,6,6,1],
|
||||
"de/dce/structmin__heap.html":[11,0,18],
|
||||
"de/dce/structmin__heap.html#a456c6372c103c6d1bb430f581f5d3c71":[11,0,18,2],
|
||||
"de/dce/structmin__heap.html#a9fd34546dad4dfd9e6a456936b766123":[11,0,18,0],
|
||||
"de/dce/structmin__heap.html#ad960bfacd24fb843208db83f113ebc8f":[11,0,18,1],
|
||||
@ -102,8 +98,8 @@ var NAVTREEINDEX2 =
|
||||
"files.html":[12,0],
|
||||
"functions.html":[11,2,0],
|
||||
"functions_vars.html":[11,2,1],
|
||||
"globals.html":[12,1,0],
|
||||
"globals.html":[12,1,0,0],
|
||||
"globals.html":[12,1,0],
|
||||
"globals_a.html":[12,1,0,1],
|
||||
"globals_b.html":[12,1,0,2],
|
||||
"globals_c.html":[12,1,0,3],
|
||||
@ -111,8 +107,8 @@ var NAVTREEINDEX2 =
|
||||
"globals_defs.html":[12,1,4],
|
||||
"globals_e.html":[12,1,0,5],
|
||||
"globals_f.html":[12,1,0,6],
|
||||
"globals_func.html":[12,1,1],
|
||||
"globals_func.html":[12,1,1,0],
|
||||
"globals_func.html":[12,1,1],
|
||||
"globals_func_a.html":[12,1,1,1],
|
||||
"globals_func_b.html":[12,1,1,2],
|
||||
"globals_func_c.html":[12,1,1,3],
|
||||
|
||||
@ -1,15 +1,15 @@
|
||||
var searchData=
|
||||
[
|
||||
['projecteuler_166',['ProjectEuler',['../d8/d81/md_project_euler__r_e_a_d_m_e.html',1,'']]],
|
||||
['palindrome_2ec_167',['palindrome.c',['../df/d16/palindrome_8c.html',1,'']]],
|
||||
['pid_168',['pid',['../d0/d43/structpid.html',1,'']]],
|
||||
['poly_5ffunction_169',['poly_function',['../da/d38/durand__kerner__roots_8c.html#a321f9781a9744ccdaf0aba89f35ec29c',1,'durand_kerner_roots.c']]],
|
||||
['postorder_5fdisplay_170',['postorder_display',['../df/d3c/threaded__binary__trees_8c.html#a5a82ae0ee13788be51ca4ba6cddb0719',1,'threaded_binary_trees.c']]],
|
||||
['preorder_5fdisplay_171',['preorder_display',['../df/d3c/threaded__binary__trees_8c.html#a8169ba0dfd5b8183672e444d1434bf9c',1,'threaded_binary_trees.c']]],
|
||||
['prev_5fdigit_172',['prev_digit',['../dc/d77/struct__big__int.html#ad8405989a924410942b39ec0e9fef30b',1,'_big_int']]],
|
||||
['print_173',['print',['../dc/d80/cantor__set_8c.html#a75ee530cd7148a63249784ad3dda8fab',1,'print(CantorSet *head): cantor_set.c'],['../d5/df4/group__sudoku.html#ga702ff4f95dde780c7d04fcdd1021b6c1',1,'print(const struct sudoku *a): sudoku_solver.c']]],
|
||||
['print_5fmatrix_174',['print_matrix',['../d4/d68/qr__decompose_8h.html#a90562ce8c3707401e9c5809dece68d6a',1,'qr_decompose.h']]],
|
||||
['print_5fnumber_175',['print_number',['../db/d01/problem__13_2sol1_8c.html#a248adc917818cc6666d8bc679a660319',1,'print_number(uint8_t *number, uint8_t N, int8_t num_digits_to_print): sol1.c'],['../d8/d32/problem__25_2sol1_8c.html#abe5bc1f170b2108a19d0a16d30bd3235',1,'print_number(unsigned char *number, int N): sol1.c']]],
|
||||
['problem_176',['problem',['../d4/d07/ode__forward__euler_8c.html#a97075291390a68c262ed66e157a57eb4',1,'problem(const double *x, double *y, double *dy): ode_forward_euler.c'],['../d1/dc2/ode__midpoint__euler_8c.html#a97075291390a68c262ed66e157a57eb4',1,'problem(const double *x, double *y, double *dy): ode_midpoint_euler.c'],['../d4/d99/ode__semi__implicit__euler_8c.html#a97075291390a68c262ed66e157a57eb4',1,'problem(const double *x, double *y, double *dy): ode_semi_implicit_euler.c']]],
|
||||
['propagate_177',['propagate',['../dc/d80/cantor__set_8c.html#a1f156d2b53b80305bd2fa3ff5fdf3c97',1,'cantor_set.c']]]
|
||||
['projecteuler_165',['ProjectEuler',['../d8/d81/md_project_euler__r_e_a_d_m_e.html',1,'']]],
|
||||
['palindrome_2ec_166',['palindrome.c',['../df/d16/palindrome_8c.html',1,'']]],
|
||||
['pid_167',['pid',['../d0/d43/structpid.html',1,'']]],
|
||||
['poly_5ffunction_168',['poly_function',['../da/d38/durand__kerner__roots_8c.html#a321f9781a9744ccdaf0aba89f35ec29c',1,'durand_kerner_roots.c']]],
|
||||
['postorder_5fdisplay_169',['postorder_display',['../df/d3c/threaded__binary__trees_8c.html#a5a82ae0ee13788be51ca4ba6cddb0719',1,'threaded_binary_trees.c']]],
|
||||
['preorder_5fdisplay_170',['preorder_display',['../df/d3c/threaded__binary__trees_8c.html#a8169ba0dfd5b8183672e444d1434bf9c',1,'threaded_binary_trees.c']]],
|
||||
['prev_5fdigit_171',['prev_digit',['../dc/d77/struct__big__int.html#ad8405989a924410942b39ec0e9fef30b',1,'_big_int']]],
|
||||
['print_172',['print',['../dc/d80/cantor__set_8c.html#a75ee530cd7148a63249784ad3dda8fab',1,'print(CantorSet *head): cantor_set.c'],['../d5/df4/group__sudoku.html#ga702ff4f95dde780c7d04fcdd1021b6c1',1,'print(const struct sudoku *a): sudoku_solver.c']]],
|
||||
['print_5fmatrix_173',['print_matrix',['../d4/d68/qr__decompose_8h.html#a90562ce8c3707401e9c5809dece68d6a',1,'qr_decompose.h']]],
|
||||
['print_5fnumber_174',['print_number',['../db/d01/problem__13_2sol1_8c.html#a248adc917818cc6666d8bc679a660319',1,'print_number(uint8_t *number, uint8_t N, int8_t num_digits_to_print): sol1.c'],['../d8/d32/problem__25_2sol1_8c.html#abe5bc1f170b2108a19d0a16d30bd3235',1,'print_number(unsigned char *number, int N): sol1.c']]],
|
||||
['problem_175',['problem',['../d4/d07/ode__forward__euler_8c.html#a97075291390a68c262ed66e157a57eb4',1,'problem(const double *x, double *y, double *dy): ode_forward_euler.c'],['../d1/dc2/ode__midpoint__euler_8c.html#a97075291390a68c262ed66e157a57eb4',1,'problem(const double *x, double *y, double *dy): ode_midpoint_euler.c'],['../d4/d99/ode__semi__implicit__euler_8c.html#a97075291390a68c262ed66e157a57eb4',1,'problem(const double *x, double *y, double *dy): ode_semi_implicit_euler.c']]],
|
||||
['propagate_176',['propagate',['../dc/d80/cantor__set_8c.html#a1f156d2b53b80305bd2fa3ff5fdf3c97',1,'cantor_set.c']]]
|
||||
];
|
||||
|
||||
@ -1,9 +1,9 @@
|
||||
var searchData=
|
||||
[
|
||||
['qr_5fdecompose_178',['qr_decompose',['../d4/d68/qr__decompose_8h.html#a45c7640d9d22c89c11beb1f567843c56',1,'qr_decompose.h']]],
|
||||
['qr_5fdecompose_2eh_179',['qr_decompose.h',['../d4/d68/qr__decompose_8h.html',1,'']]],
|
||||
['qr_5fdecomposition_2ec_180',['qr_decomposition.c',['../d5/d23/qr__decomposition_8c.html',1,'']]],
|
||||
['qr_5feigen_5fvalues_2ec_181',['qr_eigen_values.c',['../d7/d50/qr__eigen__values_8c.html',1,'']]],
|
||||
['queue_182',['queue',['../d2/d36/structqueue.html',1,'']]],
|
||||
['queuerep_183',['QueueRep',['../d0/d10/struct_queue_rep.html',1,'']]]
|
||||
['qr_5fdecompose_177',['qr_decompose',['../d4/d68/qr__decompose_8h.html#a45c7640d9d22c89c11beb1f567843c56',1,'qr_decompose.h']]],
|
||||
['qr_5fdecompose_2eh_178',['qr_decompose.h',['../d4/d68/qr__decompose_8h.html',1,'']]],
|
||||
['qr_5fdecomposition_2ec_179',['qr_decomposition.c',['../d5/d23/qr__decomposition_8c.html',1,'']]],
|
||||
['qr_5feigen_5fvalues_2ec_180',['qr_eigen_values.c',['../d7/d50/qr__eigen__values_8c.html',1,'']]],
|
||||
['queue_181',['queue',['../d2/d36/structqueue.html',1,'']]],
|
||||
['queuerep_182',['QueueRep',['../d0/d10/struct_queue_rep.html',1,'']]]
|
||||
];
|
||||
|
||||
@ -1,6 +1,6 @@
|
||||
var searchData=
|
||||
[
|
||||
['realtime_5fstats_2ec_184',['realtime_stats.c',['../dc/d47/realtime__stats_8c.html',1,'']]],
|
||||
['remove_5fdigits_185',['remove_digits',['../db/d80/problem__20_2sol1_8c.html#a54a02c4b963fdb16f24959e0137763f1',1,'sol1.c']]],
|
||||
['rlink_186',['rlink',['../db/d8b/struct_node.html#a0ed3c7305b43527f0f237bbfd438b8f7',1,'Node']]]
|
||||
['realtime_5fstats_2ec_183',['realtime_stats.c',['../dc/d47/realtime__stats_8c.html',1,'']]],
|
||||
['remove_5fdigits_184',['remove_digits',['../db/d80/problem__20_2sol1_8c.html#a54a02c4b963fdb16f24959e0137763f1',1,'sol1.c']]],
|
||||
['rlink_185',['rlink',['../db/d8b/struct_node.html#a0ed3c7305b43527f0f237bbfd438b8f7',1,'Node']]]
|
||||
];
|
||||
|
||||
@ -1,36 +1,36 @@
|
||||
var searchData=
|
||||
[
|
||||
['simple_20generic_20stack_187',['Simple generic Stack',['../d1/d12/md_data_structures_stack__r_e_a_d_m_e.html',1,'']]],
|
||||
['sample_20solutions_20for_20_3ca_20href_3d_22http_3a_2f_2fexercism_2eio_2f_22_3eexercism_2eio_3c_2fa_3e_188',['Sample solutions for <a href="http://exercism.io/">exercism.io</a>',['../d7/db5/md_exercism__r_e_a_d_m_e.html',1,'']]],
|
||||
['save_5f2d_5fdata_189',['save_2d_data',['../d1/d6b/group__kohonen__2d.html#ga6824dc6d973eb3339af7aef5fea78b0c',1,'kohonen_som_topology.c']]],
|
||||
['save_5fnd_5fdata_190',['save_nd_data',['../d0/dcb/group__kohonen__1d.html#ga7b84b14e60f47812b581d1f93057c85a',1,'kohonen_som_trace.c']]],
|
||||
['save_5fu_5fmatrix_191',['save_u_matrix',['../d1/d6b/group__kohonen__2d.html#ga49d35f68f5d11d8ef6f8cce0d0e7bcba',1,'kohonen_som_topology.c']]],
|
||||
['search_192',['search',['../df/d3c/threaded__binary__trees_8c.html#a306d567466f22e1e927aaed97d8bb58c',1,'threaded_binary_trees.c']]],
|
||||
['semi_5fimplicit_5feuler_193',['semi_implicit_euler',['../d4/d99/ode__semi__implicit__euler_8c.html#ad80059877222f885b549f2d0a3dc6b55',1,'ode_semi_implicit_euler.c']]],
|
||||
['semi_5fimplicit_5feuler_5fstep_194',['semi_implicit_euler_step',['../d4/d99/ode__semi__implicit__euler_8c.html#a720b7e995d2bbc615f94a2c7dbcf84eb',1,'ode_semi_implicit_euler.c']]],
|
||||
['shell_5fsort_195',['shell_sort',['../dd/d8b/problem__22_2sol1_8c.html#a5bc3659aa0949ea33118c95b1dee5f63',1,'shell_sort(char data[][MAX_NAME_LEN], int LEN): sol1.c'],['../d5/d4c/group__sorting.html#ga5bc16eaf3ffe6a6ab66780dd445904c0',1,'shell_sort(int *array, long LEN): shell_sort2.c']]],
|
||||
['shell_5fsort2_2ec_196',['shell_sort2.c',['../d6/ded/shell__sort2_8c.html',1,'']]],
|
||||
['show_5fdata_197',['show_data',['../d5/d4c/group__sorting.html#gaeccaf61ff47279384d1dba8d869d5c2f',1,'shell_sort2.c']]],
|
||||
['sigma_198',['sigma',['../d4/d83/problem__401_2sol1_8c.html#aaf964739be92adc2f500e7da11e3f6be',1,'sol1.c']]],
|
||||
['sigma2_199',['sigma2',['../d4/d83/problem__401_2sol1_8c.html#a236548478af932f1115a71f601a68788',1,'sol1.c']]],
|
||||
['so1_2ec_200',['so1.c',['../d0/d7f/so1_8c.html',1,'']]],
|
||||
['sol_2ec_201',['sol.c',['../d0/d6c/problem__4_2sol_8c.html',1,'(Global Namespace)'],['../df/de7/problem__5_2sol_8c.html',1,'(Global Namespace)'],['../d4/d7b/problem__6_2sol_8c.html',1,'(Global Namespace)'],['../d1/d2f/problem__7_2sol_8c.html',1,'(Global Namespace)']]],
|
||||
['sol1_2ec_202',['sol1.c',['../da/d35/problem__1_2sol1_8c.html',1,'(Global Namespace)'],['../d0/d6d/problem__10_2sol1_8c.html',1,'(Global Namespace)'],['../d7/d1f/problem__12_2sol1_8c.html',1,'(Global Namespace)'],['../db/d01/problem__13_2sol1_8c.html',1,'(Global Namespace)'],['../d4/dea/problem__14_2sol1_8c.html',1,'(Global Namespace)'],['../d7/d91/problem__15_2sol1_8c.html',1,'(Global Namespace)'],['../d6/d88/problem__16_2sol1_8c.html',1,'(Global Namespace)'],['../dd/df0/problem__19_2sol1_8c.html',1,'(Global Namespace)'],['../db/d80/problem__20_2sol1_8c.html',1,'(Global Namespace)'],['../df/d1a/problem__21_2sol1_8c.html',1,'(Global Namespace)'],['../dd/d8b/problem__22_2sol1_8c.html',1,'(Global Namespace)'],['../d7/ddb/problem__23_2sol1_8c.html',1,'(Global Namespace)'],['../d8/d32/problem__25_2sol1_8c.html',1,'(Global Namespace)'],['../d1/df9/problem__26_2sol1_8c.html',1,'(Global Namespace)'],['../d7/dd3/problem__3_2sol1_8c.html',1,'(Global Namespace)'],['../d4/d83/problem__401_2sol1_8c.html',1,'(Global Namespace)'],['../dc/d63/problem__8_2sol1_8c.html',1,'(Global Namespace)'],['../df/da5/problem__9_2sol1_8c.html',1,'(Global Namespace)']]],
|
||||
['sol2_2ec_203',['sol2.c',['../d2/dae/problem__1_2sol2_8c.html',1,'(Global Namespace)'],['../d9/da7/problem__10_2sol2_8c.html',1,'(Global Namespace)'],['../d4/dbd/problem__23_2sol2_8c.html',1,'(Global Namespace)'],['../d2/dbc/problem__3_2sol2_8c.html',1,'(Global Namespace)'],['../d2/d93/problem__8_2sol2_8c.html',1,'(Global Namespace)'],['../d8/de0/problem__9_2sol2_8c.html',1,'(Global Namespace)']]],
|
||||
['sol3_2ec_204',['sol3.c',['../d6/de3/sol3_8c.html',1,'']]],
|
||||
['sol4_2ec_205',['sol4.c',['../d6/d1b/sol4_8c.html',1,'']]],
|
||||
['solve_206',['solve',['../d5/df4/group__sudoku.html#gadfe0ed5085b4775d8fa00b434cc0fdfc',1,'sudoku_solver.c']]],
|
||||
['sorting_20algorithms_207',['Sorting algorithms',['../d5/d4c/group__sorting.html',1,'']]],
|
||||
['spirograph_208',['spirograph',['../d7/d98/spirograph_8c.html#a0daa148091ec953809fc172289f773d3',1,'spirograph.c']]],
|
||||
['spirograph_2ec_209',['spirograph.c',['../d7/d98/spirograph_8c.html',1,'']]],
|
||||
['stack_210',['Stack',['../dd/d10/struct_stack.html',1,'']]],
|
||||
['start_211',['start',['../d9/dd7/struct__cantor__set.html#abd2176c3cc3a1d85d15bbeaace35fa03',1,'_cantor_set']]],
|
||||
['stats_5fcomputer1_212',['stats_computer1',['../dc/d47/realtime__stats_8c.html#a63ddcdaab24f722f0963fa2fbe0ae628',1,'realtime_stats.c']]],
|
||||
['stats_5fcomputer2_213',['stats_computer2',['../dc/d47/realtime__stats_8c.html#a34be233a9200ee2065f6b7b27e2d9a96',1,'realtime_stats.c']]],
|
||||
['subset_214',['subset',['../dc/de5/structsubset.html',1,'']]],
|
||||
['sudoku_215',['sudoku',['../dc/d18/structsudoku.html',1,'sudoku'],['../d5/df4/group__sudoku.html',1,'(Global Namespace)']]],
|
||||
['sudoku_5fsolver_2ec_216',['sudoku_solver.c',['../de/dac/sudoku__solver_8c.html',1,'']]],
|
||||
['sum_5fof_5fdivisors_217',['sum_of_divisors',['../df/d1a/problem__21_2sol1_8c.html#aacf4b7e708651d2164e86958f2c29c93',1,'sol1.c']]],
|
||||
['sum_5fof_5fprimes_218',['sum_of_primes',['../d0/d6d/problem__10_2sol1_8c.html#ae3d987cb2ad0ddb0c3caa4c2506a20e5',1,'sol1.c']]],
|
||||
['swap_219',['swap',['../d5/d4c/group__sorting.html#ga4b9708d87be7a409eff20e5e7e8b43c8',1,'merge_sort.c']]]
|
||||
['simple_20generic_20stack_186',['Simple generic Stack',['../d1/d12/md_data_structures_stack__r_e_a_d_m_e.html',1,'']]],
|
||||
['sample_20solutions_20for_20_3ca_20href_3d_22http_3a_2f_2fexercism_2eio_2f_22_3eexercism_2eio_3c_2fa_3e_187',['Sample solutions for <a href="http://exercism.io/">exercism.io</a>',['../d7/db5/md_exercism__r_e_a_d_m_e.html',1,'']]],
|
||||
['save_5f2d_5fdata_188',['save_2d_data',['../d1/d6b/group__kohonen__2d.html#ga6824dc6d973eb3339af7aef5fea78b0c',1,'kohonen_som_topology.c']]],
|
||||
['save_5fnd_5fdata_189',['save_nd_data',['../d0/dcb/group__kohonen__1d.html#ga7b84b14e60f47812b581d1f93057c85a',1,'kohonen_som_trace.c']]],
|
||||
['save_5fu_5fmatrix_190',['save_u_matrix',['../d1/d6b/group__kohonen__2d.html#ga49d35f68f5d11d8ef6f8cce0d0e7bcba',1,'kohonen_som_topology.c']]],
|
||||
['search_191',['search',['../df/d3c/threaded__binary__trees_8c.html#a306d567466f22e1e927aaed97d8bb58c',1,'threaded_binary_trees.c']]],
|
||||
['semi_5fimplicit_5feuler_192',['semi_implicit_euler',['../d4/d99/ode__semi__implicit__euler_8c.html#ad80059877222f885b549f2d0a3dc6b55',1,'ode_semi_implicit_euler.c']]],
|
||||
['semi_5fimplicit_5feuler_5fstep_193',['semi_implicit_euler_step',['../d4/d99/ode__semi__implicit__euler_8c.html#a720b7e995d2bbc615f94a2c7dbcf84eb',1,'ode_semi_implicit_euler.c']]],
|
||||
['shell_5fsort_194',['shell_sort',['../dd/d8b/problem__22_2sol1_8c.html#a5bc3659aa0949ea33118c95b1dee5f63',1,'shell_sort(char data[][MAX_NAME_LEN], int LEN): sol1.c'],['../d5/d4c/group__sorting.html#ga5bc16eaf3ffe6a6ab66780dd445904c0',1,'shell_sort(int *array, long LEN): shell_sort2.c']]],
|
||||
['shell_5fsort2_2ec_195',['shell_sort2.c',['../d6/ded/shell__sort2_8c.html',1,'']]],
|
||||
['show_5fdata_196',['show_data',['../d5/d4c/group__sorting.html#gaeccaf61ff47279384d1dba8d869d5c2f',1,'shell_sort2.c']]],
|
||||
['sigma_197',['sigma',['../d4/d83/problem__401_2sol1_8c.html#aaf964739be92adc2f500e7da11e3f6be',1,'sol1.c']]],
|
||||
['sigma2_198',['sigma2',['../d4/d83/problem__401_2sol1_8c.html#a236548478af932f1115a71f601a68788',1,'sol1.c']]],
|
||||
['so1_2ec_199',['so1.c',['../d0/d7f/so1_8c.html',1,'']]],
|
||||
['sol_2ec_200',['sol.c',['../d0/d6c/problem__4_2sol_8c.html',1,'(Global Namespace)'],['../df/de7/problem__5_2sol_8c.html',1,'(Global Namespace)'],['../d4/d7b/problem__6_2sol_8c.html',1,'(Global Namespace)'],['../d1/d2f/problem__7_2sol_8c.html',1,'(Global Namespace)']]],
|
||||
['sol1_2ec_201',['sol1.c',['../da/d35/problem__1_2sol1_8c.html',1,'(Global Namespace)'],['../d0/d6d/problem__10_2sol1_8c.html',1,'(Global Namespace)'],['../d7/d1f/problem__12_2sol1_8c.html',1,'(Global Namespace)'],['../db/d01/problem__13_2sol1_8c.html',1,'(Global Namespace)'],['../d4/dea/problem__14_2sol1_8c.html',1,'(Global Namespace)'],['../d7/d91/problem__15_2sol1_8c.html',1,'(Global Namespace)'],['../d6/d88/problem__16_2sol1_8c.html',1,'(Global Namespace)'],['../dd/df0/problem__19_2sol1_8c.html',1,'(Global Namespace)'],['../db/d80/problem__20_2sol1_8c.html',1,'(Global Namespace)'],['../df/d1a/problem__21_2sol1_8c.html',1,'(Global Namespace)'],['../dd/d8b/problem__22_2sol1_8c.html',1,'(Global Namespace)'],['../d7/ddb/problem__23_2sol1_8c.html',1,'(Global Namespace)'],['../d8/d32/problem__25_2sol1_8c.html',1,'(Global Namespace)'],['../d1/df9/problem__26_2sol1_8c.html',1,'(Global Namespace)'],['../d7/dd3/problem__3_2sol1_8c.html',1,'(Global Namespace)'],['../d4/d83/problem__401_2sol1_8c.html',1,'(Global Namespace)'],['../dc/d63/problem__8_2sol1_8c.html',1,'(Global Namespace)'],['../df/da5/problem__9_2sol1_8c.html',1,'(Global Namespace)']]],
|
||||
['sol2_2ec_202',['sol2.c',['../d2/dae/problem__1_2sol2_8c.html',1,'(Global Namespace)'],['../d9/da7/problem__10_2sol2_8c.html',1,'(Global Namespace)'],['../d4/dbd/problem__23_2sol2_8c.html',1,'(Global Namespace)'],['../d2/dbc/problem__3_2sol2_8c.html',1,'(Global Namespace)'],['../d2/d93/problem__8_2sol2_8c.html',1,'(Global Namespace)'],['../d8/de0/problem__9_2sol2_8c.html',1,'(Global Namespace)']]],
|
||||
['sol3_2ec_203',['sol3.c',['../d6/de3/sol3_8c.html',1,'']]],
|
||||
['sol4_2ec_204',['sol4.c',['../d6/d1b/sol4_8c.html',1,'']]],
|
||||
['solve_205',['solve',['../d5/df4/group__sudoku.html#gadfe0ed5085b4775d8fa00b434cc0fdfc',1,'sudoku_solver.c']]],
|
||||
['sorting_20algorithms_206',['Sorting algorithms',['../d5/d4c/group__sorting.html',1,'']]],
|
||||
['spirograph_207',['spirograph',['../d7/d98/spirograph_8c.html#a0daa148091ec953809fc172289f773d3',1,'spirograph.c']]],
|
||||
['spirograph_2ec_208',['spirograph.c',['../d7/d98/spirograph_8c.html',1,'']]],
|
||||
['stack_209',['Stack',['../dd/d10/struct_stack.html',1,'']]],
|
||||
['start_210',['start',['../d9/dd7/struct__cantor__set.html#abd2176c3cc3a1d85d15bbeaace35fa03',1,'_cantor_set']]],
|
||||
['stats_5fcomputer1_211',['stats_computer1',['../dc/d47/realtime__stats_8c.html#a63ddcdaab24f722f0963fa2fbe0ae628',1,'realtime_stats.c']]],
|
||||
['stats_5fcomputer2_212',['stats_computer2',['../dc/d47/realtime__stats_8c.html#a34be233a9200ee2065f6b7b27e2d9a96',1,'realtime_stats.c']]],
|
||||
['subset_213',['subset',['../dc/de5/structsubset.html',1,'']]],
|
||||
['sudoku_214',['sudoku',['../dc/d18/structsudoku.html',1,'sudoku'],['../d5/df4/group__sudoku.html',1,'(Global Namespace)']]],
|
||||
['sudoku_5fsolver_2ec_215',['sudoku_solver.c',['../de/dac/sudoku__solver_8c.html',1,'']]],
|
||||
['sum_5fof_5fdivisors_216',['sum_of_divisors',['../df/d1a/problem__21_2sol1_8c.html#aacf4b7e708651d2164e86958f2c29c93',1,'sol1.c']]],
|
||||
['sum_5fof_5fprimes_217',['sum_of_primes',['../d0/d6d/problem__10_2sol1_8c.html#ae3d987cb2ad0ddb0c3caa4c2506a20e5',1,'sol1.c']]],
|
||||
['swap_218',['swap',['../d5/d4c/group__sorting.html#ga4b9708d87be7a409eff20e5e7e8b43c8',1,'merge_sort.c']]]
|
||||
];
|
||||
|
||||
@ -1,21 +1,21 @@
|
||||
var searchData=
|
||||
[
|
||||
['the_20algorithms_20_2d_20c_220',['The Algorithms - C',['../index.html',1,'']]],
|
||||
['t_221',['T',['../d5/d7e/struct_t.html',1,'']]],
|
||||
['test_222',['test',['../d7/d98/spirograph_8c.html#a708a4c1a4d0c4acc4c447310dd4db27f',1,'test(void): spirograph.c'],['../d6/d2e/cartesian__to__polar_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): cartesian_to_polar.c'],['../df/d3b/binary__search_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): binary_search.c'],['../d6/d7b/jump__search_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): jump_search.c']]],
|
||||
['test1_223',['test1',['../dd/d8c/adaline__learning_8c.html#ab4ecb3accf5d9e0263087e7265bbe3a9',1,'test1(double eta): adaline_learning.c'],['../d2/df6/kohonen__som__topology_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): kohonen_som_trace.c'],['../d7/d50/qr__eigen__values_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): qr_eigen_values.c']]],
|
||||
['test2_224',['test2',['../dd/d8c/adaline__learning_8c.html#a05cc9a0acb524fde727a4d7b4a747ee6',1,'test2(double eta): adaline_learning.c'],['../d2/df6/kohonen__som__topology_8c.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): kohonen_som_trace.c'],['../d7/d50/qr__eigen__values_8c.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): qr_eigen_values.c']]],
|
||||
['test3_225',['test3',['../dd/d8c/adaline__learning_8c.html#a3f37b9f073f7e57fd0b39d70718af1b1',1,'test3(double eta): adaline_learning.c'],['../d2/df6/kohonen__som__topology_8c.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3(): kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3(): kohonen_som_trace.c']]],
|
||||
['test_5f2d_5fclasses_226',['test_2d_classes',['../d2/df6/kohonen__som__topology_8c.html#adb5ded007be1fd666fab9affe6764018',1,'kohonen_som_topology.c']]],
|
||||
['test_5f3d_5fclasses_227',['test_3d_classes',['../d0/d46/kohonen__som__trace_8c.html#a41ae16442e3e5b891a58d2e5932a2cd0',1,'kohonen_som_trace.c']]],
|
||||
['test_5f3d_5fclasses1_228',['test_3d_classes1',['../d2/df6/kohonen__som__topology_8c.html#ad9e25202bb8b481461f932668f249dbc',1,'kohonen_som_topology.c']]],
|
||||
['test_5f3d_5fclasses2_229',['test_3d_classes2',['../d2/df6/kohonen__som__topology_8c.html#a5bb02a8322d717ead1b11182c5f02a3a',1,'kohonen_som_topology.c']]],
|
||||
['test_5fc_5fatoi_230',['test_c_atoi',['../d7/dd8/c__atoi__str__to__integer_8c.html#a8c66c03637e48e375b80b5d7791e57be',1,'c_atoi_str_to_integer.c']]],
|
||||
['test_5fcircle_231',['test_circle',['../d0/d46/kohonen__som__trace_8c.html#a107f00650b8041f77767927073ddddb8',1,'kohonen_som_trace.c']]],
|
||||
['test_5ffunction_232',['test_function',['../dc/d47/realtime__stats_8c.html#aa54c915581fcc495489175a4386d59fd',1,'realtime_stats.c']]],
|
||||
['test_5flamniscate_233',['test_lamniscate',['../d0/d46/kohonen__som__trace_8c.html#aa2246f940155472084ee461f3685d614',1,'kohonen_som_trace.c']]],
|
||||
['threaded_5fbinary_5ftrees_2ec_234',['threaded_binary_trees.c',['../df/d3c/threaded__binary__trees_8c.html',1,'']]],
|
||||
['tnode_235',['tnode',['../d8/d7a/structtnode.html',1,'']]],
|
||||
['to_5fpolar_236',['to_polar',['../d6/d2e/cartesian__to__polar_8c.html#afb80d77f0c994240309ccddcc9525e70',1,'cartesian_to_polar.c']]],
|
||||
['trienode_237',['TrieNode',['../da/d9b/struct_trie_node.html',1,'']]]
|
||||
['the_20algorithms_20_2d_20c_219',['The Algorithms - C',['../index.html',1,'']]],
|
||||
['t_220',['T',['../d5/d7e/struct_t.html',1,'']]],
|
||||
['test_221',['test',['../d7/d98/spirograph_8c.html#a708a4c1a4d0c4acc4c447310dd4db27f',1,'test(void): spirograph.c'],['../d6/d2e/cartesian__to__polar_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): cartesian_to_polar.c'],['../df/d3b/binary__search_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): binary_search.c'],['../d6/d7b/jump__search_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): jump_search.c']]],
|
||||
['test1_222',['test1',['../dd/d8c/adaline__learning_8c.html#ab4ecb3accf5d9e0263087e7265bbe3a9',1,'test1(double eta): adaline_learning.c'],['../d2/df6/kohonen__som__topology_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): kohonen_som_trace.c'],['../d7/d50/qr__eigen__values_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): qr_eigen_values.c']]],
|
||||
['test2_223',['test2',['../dd/d8c/adaline__learning_8c.html#a05cc9a0acb524fde727a4d7b4a747ee6',1,'test2(double eta): adaline_learning.c'],['../d2/df6/kohonen__som__topology_8c.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): kohonen_som_trace.c'],['../d7/d50/qr__eigen__values_8c.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): qr_eigen_values.c']]],
|
||||
['test3_224',['test3',['../dd/d8c/adaline__learning_8c.html#a3f37b9f073f7e57fd0b39d70718af1b1',1,'test3(double eta): adaline_learning.c'],['../d2/df6/kohonen__som__topology_8c.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3(): kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3(): kohonen_som_trace.c']]],
|
||||
['test_5f2d_5fclasses_225',['test_2d_classes',['../d2/df6/kohonen__som__topology_8c.html#adb5ded007be1fd666fab9affe6764018',1,'kohonen_som_topology.c']]],
|
||||
['test_5f3d_5fclasses_226',['test_3d_classes',['../d0/d46/kohonen__som__trace_8c.html#a41ae16442e3e5b891a58d2e5932a2cd0',1,'kohonen_som_trace.c']]],
|
||||
['test_5f3d_5fclasses1_227',['test_3d_classes1',['../d2/df6/kohonen__som__topology_8c.html#ad9e25202bb8b481461f932668f249dbc',1,'kohonen_som_topology.c']]],
|
||||
['test_5f3d_5fclasses2_228',['test_3d_classes2',['../d2/df6/kohonen__som__topology_8c.html#a5bb02a8322d717ead1b11182c5f02a3a',1,'kohonen_som_topology.c']]],
|
||||
['test_5fc_5fatoi_229',['test_c_atoi',['../d7/dd8/c__atoi__str__to__integer_8c.html#a8c66c03637e48e375b80b5d7791e57be',1,'c_atoi_str_to_integer.c']]],
|
||||
['test_5fcircle_230',['test_circle',['../d0/d46/kohonen__som__trace_8c.html#a107f00650b8041f77767927073ddddb8',1,'kohonen_som_trace.c']]],
|
||||
['test_5ffunction_231',['test_function',['../dc/d47/realtime__stats_8c.html#aa54c915581fcc495489175a4386d59fd',1,'realtime_stats.c']]],
|
||||
['test_5flamniscate_232',['test_lamniscate',['../d0/d46/kohonen__som__trace_8c.html#aa2246f940155472084ee461f3685d614',1,'kohonen_som_trace.c']]],
|
||||
['threaded_5fbinary_5ftrees_2ec_233',['threaded_binary_trees.c',['../df/d3c/threaded__binary__trees_8c.html',1,'']]],
|
||||
['tnode_234',['tnode',['../d8/d7a/structtnode.html',1,'']]],
|
||||
['to_5fpolar_235',['to_polar',['../d6/d2e/cartesian__to__polar_8c.html#afb80d77f0c994240309ccddcc9525e70',1,'cartesian_to_polar.c']]],
|
||||
['trienode_236',['TrieNode',['../da/d9b/struct_trie_node.html',1,'']]]
|
||||
];
|
||||
|
||||
@ -1,4 +1,4 @@
|
||||
var searchData=
|
||||
[
|
||||
['union_5ffind_2ec_238',['union_find.c',['../df/df3/union__find_8c.html',1,'']]]
|
||||
['union_5ffind_2ec_237',['union_find.c',['../df/df3/union__find_8c.html',1,'']]]
|
||||
];
|
||||
|
||||
@ -1,8 +1,8 @@
|
||||
var searchData=
|
||||
[
|
||||
['value_239',['value',['../dc/d77/struct__big__int.html#a273ee73fd755f2a99512cca5f0e09008',1,'_big_int']]],
|
||||
['vector_5fdot_240',['vector_dot',['../d4/d68/qr__decompose_8h.html#a3a584b79941a43d775f9d4ce446dbe05',1,'qr_decompose.h']]],
|
||||
['vector_5fmag_241',['vector_mag',['../d4/d68/qr__decompose_8h.html#abeec1f78a7a7e7251687e75340331212',1,'qr_decompose.h']]],
|
||||
['vector_5fproj_242',['vector_proj',['../d4/d68/qr__decompose_8h.html#a82b20e027437df768d7e994cf4cae29f',1,'qr_decompose.h']]],
|
||||
['vector_5fsub_243',['vector_sub',['../d4/d68/qr__decompose_8h.html#a6b6a0e75e75ff7919057dd275bb69145',1,'qr_decompose.h']]]
|
||||
['value_238',['value',['../dc/d77/struct__big__int.html#a273ee73fd755f2a99512cca5f0e09008',1,'_big_int']]],
|
||||
['vector_5fdot_239',['vector_dot',['../d4/d68/qr__decompose_8h.html#a3a584b79941a43d775f9d4ce446dbe05',1,'qr_decompose.h']]],
|
||||
['vector_5fmag_240',['vector_mag',['../d4/d68/qr__decompose_8h.html#abeec1f78a7a7e7251687e75340331212',1,'qr_decompose.h']]],
|
||||
['vector_5fproj_241',['vector_proj',['../d4/d68/qr__decompose_8h.html#a82b20e027437df768d7e994cf4cae29f',1,'qr_decompose.h']]],
|
||||
['vector_5fsub_242',['vector_sub',['../d4/d68/qr__decompose_8h.html#a6b6a0e75e75ff7919057dd275bb69145',1,'qr_decompose.h']]]
|
||||
];
|
||||
|
||||
@ -1,5 +1,5 @@
|
||||
var searchData=
|
||||
[
|
||||
['weights_244',['weights',['../d2/daa/structadaline.html#a32e58c03fd9258709eae6138ad0ec657',1,'adaline']]],
|
||||
['word_5fcount_5fword_245',['word_count_word',['../df/ddb/structword__count__word.html',1,'']]]
|
||||
['weights_243',['weights',['../d2/daa/structadaline.html#a32e58c03fd9258709eae6138ad0ec657',1,'adaline']]],
|
||||
['word_5fcount_5fword_244',['word_count_word',['../df/ddb/structword__count__word.html',1,'']]]
|
||||
];
|
||||
|
||||
@ -8,21 +8,20 @@ var searchData=
|
||||
['max_5fdeno_127',['MAX_DENO',['../d1/df9/problem__26_2sol1_8c.html#a619eec3220cebd7c5e455edbb14e9b12',1,'sol1.c']]],
|
||||
['max_5fdigits_128',['MAX_DIGITS',['../d8/d32/problem__25_2sol1_8c.html#a001791a21d538b8b9176287ae60d9b61',1,'sol1.c']]],
|
||||
['max_5fheap_129',['max_heap',['../d0/d8a/structmax__heap.html',1,'']]],
|
||||
['max_5fl_130',['MAX_L',['../d4/d83/problem__401_2sol1_8c.html#adf2a0717e3307419a9d7c52707f5631e',1,'sol1.c']]],
|
||||
['max_5flen_131',['MAX_LEN',['../d1/df9/problem__26_2sol1_8c.html#aabf4f709c8199e41cf279c77112345fe',1,'sol1.c']]],
|
||||
['max_5fn_132',['MAX_N',['../d7/ddb/problem__23_2sol1_8c.html#a337e545af040d754dc012b42523ee1ee',1,'MAX_N(): sol1.c'],['../d4/dbd/problem__23_2sol2_8c.html#a8c7ddb39906f281b801f2cd58d416c2b',1,'MAX_N(): sol2.c']]],
|
||||
['max_5fname_5flen_133',['MAX_NAME_LEN',['../dd/d8b/problem__22_2sol1_8c.html#afd709f201d7643c3909621f620ea648a',1,'sol1.c']]],
|
||||
['max_5fnames_134',['MAX_NAMES',['../dd/d8b/problem__22_2sol1_8c.html#a6cb9b08aacb61416795ee78bfceacd38',1,'sol1.c']]],
|
||||
['max_5fsize_135',['MAX_SIZE',['../df/df3/union__find_8c.html#a0592dba56693fad79136250c11e5a7fe',1,'union_find.c']]],
|
||||
['merge_136',['merge',['../d5/d4c/group__sorting.html#ga8dc3ec66cb3350313fdb34bfd1674729',1,'merge_sort.c']]],
|
||||
['merge_5fsort_137',['merge_sort',['../d5/d4c/group__sorting.html#gab99b8a397bdd0bf2903d66c22ba4ba43',1,'merge_sort.c']]],
|
||||
['merge_5fsort_2ec_138',['merge_sort.c',['../d2/d83/merge__sort_8c.html',1,'']]],
|
||||
['midpoint_5feuler_139',['midpoint_euler',['../d1/dc2/ode__midpoint__euler_8c.html#a148003d8b261d040c1c41e73b40af1dd',1,'ode_midpoint_euler.c']]],
|
||||
['midpoint_5feuler_5fstep_140',['midpoint_euler_step',['../d1/dc2/ode__midpoint__euler_8c.html#affe6cc2ab040b94a29e6c41782f72d51',1,'ode_midpoint_euler.c']]],
|
||||
['min_141',['min',['../d1/d6b/group__kohonen__2d.html#gac6afabdc09a49a433ee19d8a9486056d',1,'min(): kohonen_som_topology.c'],['../d0/dcb/group__kohonen__1d.html#gac6afabdc09a49a433ee19d8a9486056d',1,'min(): kohonen_som_trace.c'],['../d6/d7b/jump__search_8c.html#a8195a86b6d75b9a3939505e8bb50021e',1,'min(): jump_search.c']]],
|
||||
['min_5fheap_142',['min_heap',['../de/dce/structmin__heap.html',1,'']]],
|
||||
['mod_143',['MOD',['../d4/d83/problem__401_2sol1_8c.html#aca7d5718ab8c38506adb3bef2469b319',1,'sol1.c']]],
|
||||
['modified_5fbinary_5fsearch_2ec_144',['modified_binary_search.c',['../d3/d47/modified__binary__search_8c.html',1,'']]],
|
||||
['modifiedbinarysearch_145',['modifiedBinarySearch',['../d3/d47/modified__binary__search_8c.html#a7df9a198e30cded6229d79bef7591f8f',1,'modified_binary_search.c']]],
|
||||
['multiply_146',['multiply',['../d6/d3d/factorial__large__number_8c.html#ad398ddbd594ca69a5e6dfc894925341e',1,'factorial_large_number.c']]]
|
||||
['max_5flen_130',['MAX_LEN',['../d1/df9/problem__26_2sol1_8c.html#aabf4f709c8199e41cf279c77112345fe',1,'sol1.c']]],
|
||||
['max_5flength_131',['MAX_LENGTH',['../d4/d83/problem__401_2sol1_8c.html#a7a9a231e30b47bc0345749c8bd1e5077',1,'sol1.c']]],
|
||||
['max_5fname_5flen_132',['MAX_NAME_LEN',['../dd/d8b/problem__22_2sol1_8c.html#afd709f201d7643c3909621f620ea648a',1,'sol1.c']]],
|
||||
['max_5fnames_133',['MAX_NAMES',['../dd/d8b/problem__22_2sol1_8c.html#a6cb9b08aacb61416795ee78bfceacd38',1,'sol1.c']]],
|
||||
['max_5fsize_134',['MAX_SIZE',['../df/df3/union__find_8c.html#a0592dba56693fad79136250c11e5a7fe',1,'union_find.c']]],
|
||||
['merge_135',['merge',['../d5/d4c/group__sorting.html#ga8dc3ec66cb3350313fdb34bfd1674729',1,'merge_sort.c']]],
|
||||
['merge_5fsort_136',['merge_sort',['../d5/d4c/group__sorting.html#gab99b8a397bdd0bf2903d66c22ba4ba43',1,'merge_sort.c']]],
|
||||
['merge_5fsort_2ec_137',['merge_sort.c',['../d2/d83/merge__sort_8c.html',1,'']]],
|
||||
['midpoint_5feuler_138',['midpoint_euler',['../d1/dc2/ode__midpoint__euler_8c.html#a148003d8b261d040c1c41e73b40af1dd',1,'ode_midpoint_euler.c']]],
|
||||
['midpoint_5feuler_5fstep_139',['midpoint_euler_step',['../d1/dc2/ode__midpoint__euler_8c.html#affe6cc2ab040b94a29e6c41782f72d51',1,'ode_midpoint_euler.c']]],
|
||||
['min_140',['min',['../d1/d6b/group__kohonen__2d.html#gac6afabdc09a49a433ee19d8a9486056d',1,'min(): kohonen_som_topology.c'],['../d0/dcb/group__kohonen__1d.html#gac6afabdc09a49a433ee19d8a9486056d',1,'min(): kohonen_som_trace.c'],['../d6/d7b/jump__search_8c.html#a8195a86b6d75b9a3939505e8bb50021e',1,'min(): jump_search.c']]],
|
||||
['min_5fheap_141',['min_heap',['../de/dce/structmin__heap.html',1,'']]],
|
||||
['mod_5flimit_142',['MOD_LIMIT',['../d4/d83/problem__401_2sol1_8c.html#ade1bdf2529e3c58f53bfb4d844f3a9d3',1,'sol1.c']]],
|
||||
['modified_5fbinary_5fsearch_2ec_143',['modified_binary_search.c',['../d3/d47/modified__binary__search_8c.html',1,'']]],
|
||||
['modifiedbinarysearch_144',['modifiedBinarySearch',['../d3/d47/modified__binary__search_8c.html#a7df9a198e30cded6229d79bef7591f8f',1,'modified_binary_search.c']]],
|
||||
['multiply_145',['multiply',['../d6/d3d/factorial__large__number_8c.html#ad398ddbd594ca69a5e6dfc894925341e',1,'factorial_large_number.c']]]
|
||||
];
|
||||
|
||||
@ -1,14 +1,14 @@
|
||||
var searchData=
|
||||
[
|
||||
['n_147',['N',['../dc/d18/structsudoku.html#a160365012280c3e10f1b31e914e8f129',1,'sudoku::N()'],['../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4',1,'N(): sol1.c']]],
|
||||
['n2_148',['N2',['../dc/d18/structsudoku.html#a0f01e2782e82306e6fab9a8578006f56',1,'sudoku::N2()'],['../db/d01/problem__13_2sol1_8c.html#acd864640121c7df2c19f61f7baa507e4',1,'N2(): sol1.c']]],
|
||||
['new_5fadaline_149',['new_adaline',['../da/d2a/group__adaline.html#gacd88962c5f6341e43cbc69b4a7d3485b',1,'adaline_learning.c']]],
|
||||
['new_5fnumber_150',['new_number',['../d6/d3d/factorial__large__number_8c.html#ad8101f58545bd891ae8b6e11caadd7eb',1,'factorial_large_number.c']]],
|
||||
['newton_5fraphson_5froot_2ec_151',['newton_raphson_root.c',['../dd/d08/newton__raphson__root_8c.html',1,'']]],
|
||||
['next_152',['next',['../d9/dd7/struct__cantor__set.html#a2f7f9f19125725d3e5673fdb4ac8cfb1',1,'_cantor_set']]],
|
||||
['next_5fdigit_153',['next_digit',['../dc/d77/struct__big__int.html#a187538b984c86d7cfdb13e297e7f3564',1,'_big_int']]],
|
||||
['node_154',['Node',['../db/d8b/struct_node.html',1,'Node'],['../d5/da1/structnode.html',1,'node'],['../df/d3c/threaded__binary__trees_8c.html#ad8ecdcce462dd8e170ae1f164935aaa6',1,'node(): threaded_binary_trees.c']]],
|
||||
['num_5fdigits_155',['num_digits',['../d3/d5a/struct__large__num.html#a3fd11c0b413bbabfb8737d4ae73e5aa0',1,'_large_num']]],
|
||||
['num_5fweights_156',['num_weights',['../d2/daa/structadaline.html#a53314e737a0a5ff4552a03bcc9dafbc1',1,'adaline']]],
|
||||
['number_5fof_5fpaths_157',['number_of_paths',['../d7/d91/problem__15_2sol1_8c.html#a4650d1d3897633d84253f93433f601d6',1,'sol1.c']]]
|
||||
['n_146',['N',['../dc/d18/structsudoku.html#a160365012280c3e10f1b31e914e8f129',1,'sudoku']]],
|
||||
['n2_147',['N2',['../dc/d18/structsudoku.html#a0f01e2782e82306e6fab9a8578006f56',1,'sudoku']]],
|
||||
['new_5fadaline_148',['new_adaline',['../da/d2a/group__adaline.html#gacd88962c5f6341e43cbc69b4a7d3485b',1,'adaline_learning.c']]],
|
||||
['new_5fnumber_149',['new_number',['../d6/d3d/factorial__large__number_8c.html#ad8101f58545bd891ae8b6e11caadd7eb',1,'factorial_large_number.c']]],
|
||||
['newton_5fraphson_5froot_2ec_150',['newton_raphson_root.c',['../dd/d08/newton__raphson__root_8c.html',1,'']]],
|
||||
['next_151',['next',['../d9/dd7/struct__cantor__set.html#a2f7f9f19125725d3e5673fdb4ac8cfb1',1,'_cantor_set']]],
|
||||
['next_5fdigit_152',['next_digit',['../dc/d77/struct__big__int.html#a187538b984c86d7cfdb13e297e7f3564',1,'_big_int']]],
|
||||
['node_153',['Node',['../db/d8b/struct_node.html',1,'Node'],['../d5/da1/structnode.html',1,'node'],['../df/d3c/threaded__binary__trees_8c.html#ad8ecdcce462dd8e170ae1f164935aaa6',1,'node(): threaded_binary_trees.c']]],
|
||||
['num_5fdigits_154',['num_digits',['../d3/d5a/struct__large__num.html#a3fd11c0b413bbabfb8737d4ae73e5aa0',1,'_large_num']]],
|
||||
['num_5fweights_155',['num_weights',['../d2/daa/structadaline.html#a53314e737a0a5ff4552a03bcc9dafbc1',1,'adaline']]],
|
||||
['number_5fof_5fpaths_156',['number_of_paths',['../d7/d91/problem__15_2sol1_8c.html#a4650d1d3897633d84253f93433f601d6',1,'sol1.c']]]
|
||||
];
|
||||
|
||||
@ -1,11 +1,11 @@
|
||||
var searchData=
|
||||
[
|
||||
['ode_5fforward_5feuler_2ec_158',['ode_forward_euler.c',['../d4/d07/ode__forward__euler_8c.html',1,'']]],
|
||||
['ode_5fmidpoint_5feuler_2ec_159',['ode_midpoint_euler.c',['../d1/dc2/ode__midpoint__euler_8c.html',1,'']]],
|
||||
['ode_5fsemi_5fimplicit_5feuler_2ec_160',['ode_semi_implicit_euler.c',['../d4/d99/ode__semi__implicit__euler_8c.html',1,'']]],
|
||||
['ok_161',['OK',['../d5/df4/group__sudoku.html#ga3a0ec150ac9d0cb6b28279d36d95d72f',1,'sudoku_solver.c']]],
|
||||
['okbox_162',['OKbox',['../d5/df4/group__sudoku.html#ga1cd43df3f4187845ce186042fe53e6f1',1,'sudoku_solver.c']]],
|
||||
['okcol_163',['OKcol',['../d5/df4/group__sudoku.html#ga6503128d4f5ce0a0826f72f73f9e0b2a',1,'sudoku_solver.c']]],
|
||||
['okrow_164',['OKrow',['../d5/df4/group__sudoku.html#ga85d25d3b40017436f264a103685e4c55',1,'sudoku_solver.c']]],
|
||||
['order_165',['order',['../d4/d07/ode__forward__euler_8c.html#a9ceb646336224ee890a269d0b4600d09',1,'order(): ode_forward_euler.c'],['../d1/dc2/ode__midpoint__euler_8c.html#a9ceb646336224ee890a269d0b4600d09',1,'order(): ode_midpoint_euler.c'],['../d4/d99/ode__semi__implicit__euler_8c.html#a9ceb646336224ee890a269d0b4600d09',1,'order(): ode_semi_implicit_euler.c']]]
|
||||
['ode_5fforward_5feuler_2ec_157',['ode_forward_euler.c',['../d4/d07/ode__forward__euler_8c.html',1,'']]],
|
||||
['ode_5fmidpoint_5feuler_2ec_158',['ode_midpoint_euler.c',['../d1/dc2/ode__midpoint__euler_8c.html',1,'']]],
|
||||
['ode_5fsemi_5fimplicit_5feuler_2ec_159',['ode_semi_implicit_euler.c',['../d4/d99/ode__semi__implicit__euler_8c.html',1,'']]],
|
||||
['ok_160',['OK',['../d5/df4/group__sudoku.html#ga3a0ec150ac9d0cb6b28279d36d95d72f',1,'sudoku_solver.c']]],
|
||||
['okbox_161',['OKbox',['../d5/df4/group__sudoku.html#ga1cd43df3f4187845ce186042fe53e6f1',1,'sudoku_solver.c']]],
|
||||
['okcol_162',['OKcol',['../d5/df4/group__sudoku.html#ga6503128d4f5ce0a0826f72f73f9e0b2a',1,'sudoku_solver.c']]],
|
||||
['okrow_163',['OKrow',['../d5/df4/group__sudoku.html#ga85d25d3b40017436f264a103685e4c55',1,'sudoku_solver.c']]],
|
||||
['order_164',['order',['../d4/d07/ode__forward__euler_8c.html#a9ceb646336224ee890a269d0b4600d09',1,'order(): ode_forward_euler.c'],['../d1/dc2/ode__midpoint__euler_8c.html#a9ceb646336224ee890a269d0b4600d09',1,'order(): ode_midpoint_euler.c'],['../d4/d99/ode__semi__implicit__euler_8c.html#a9ceb646336224ee890a269d0b4600d09',1,'order(): ode_semi_implicit_euler.c']]]
|
||||
];
|
||||
|
||||
@ -1,6 +1,6 @@
|
||||
var searchData=
|
||||
[
|
||||
['_5fbig_5fint_246',['_big_int',['../dc/d77/struct__big__int.html',1,'']]],
|
||||
['_5fcantor_5fset_247',['_cantor_set',['../d9/dd7/struct__cantor__set.html',1,'']]],
|
||||
['_5flarge_5fnum_248',['_large_num',['../d3/d5a/struct__large__num.html',1,'']]]
|
||||
['_5fbig_5fint_245',['_big_int',['../dc/d77/struct__big__int.html',1,'']]],
|
||||
['_5fcantor_5fset_246',['_cantor_set',['../d9/dd7/struct__cantor__set.html',1,'']]],
|
||||
['_5flarge_5fnum_247',['_large_num',['../d3/d5a/struct__large__num.html',1,'']]]
|
||||
];
|
||||
|
||||
@ -1,5 +1,5 @@
|
||||
var searchData=
|
||||
[
|
||||
['adaline_249',['adaline',['../d2/daa/structadaline.html',1,'']]],
|
||||
['avlnode_250',['AVLnode',['../d2/d71/struct_a_v_lnode.html',1,'']]]
|
||||
['adaline_248',['adaline',['../d2/daa/structadaline.html',1,'']]],
|
||||
['avlnode_249',['AVLnode',['../d2/d71/struct_a_v_lnode.html',1,'']]]
|
||||
];
|
||||
|
||||
@ -1,4 +1,4 @@
|
||||
var searchData=
|
||||
[
|
||||
['word_5fcount_5fword_275',['word_count_word',['../df/ddb/structword__count__word.html',1,'']]]
|
||||
['word_5fcount_5fword_274',['word_count_word',['../df/ddb/structword__count__word.html',1,'']]]
|
||||
];
|
||||
|
||||
@ -1,4 +1,4 @@
|
||||
var searchData=
|
||||
[
|
||||
['bstiterator_251',['BSTIterator',['../d4/d02/struct_b_s_t_iterator.html',1,'']]]
|
||||
['bstiterator_250',['BSTIterator',['../d4/d02/struct_b_s_t_iterator.html',1,'']]]
|
||||
];
|
||||
|
||||
@ -1,4 +1,4 @@
|
||||
var searchData=
|
||||
[
|
||||
['carray_252',['CArray',['../d4/d2d/struct_c_array.html',1,'']]]
|
||||
['carray_251',['CArray',['../d4/d2d/struct_c_array.html',1,'']]]
|
||||
];
|
||||
|
||||
@ -1,6 +1,6 @@
|
||||
var searchData=
|
||||
[
|
||||
['data_253',['data',['../df/dea/structdata.html',1,'']]],
|
||||
['dict_254',['Dict',['../d4/dfe/struct_dict.html',1,'']]],
|
||||
['dynamic_5farray_255',['dynamic_array',['../d6/d42/structdynamic__array.html',1,'']]]
|
||||
['data_252',['data',['../df/dea/structdata.html',1,'']]],
|
||||
['dict_253',['Dict',['../d4/dfe/struct_dict.html',1,'']]],
|
||||
['dynamic_5farray_254',['dynamic_array',['../d6/d42/structdynamic__array.html',1,'']]]
|
||||
];
|
||||
|
||||
@ -1,5 +1,5 @@
|
||||
var searchData=
|
||||
[
|
||||
['edge_256',['Edge',['../d5/db4/struct_edge.html',1,'']]],
|
||||
['elem_257',['elem',['../d0/d6b/structelem.html',1,'']]]
|
||||
['edge_255',['Edge',['../d5/db4/struct_edge.html',1,'']]],
|
||||
['elem_256',['elem',['../d0/d6b/structelem.html',1,'']]]
|
||||
];
|
||||
|
||||
@ -1,5 +1,5 @@
|
||||
var searchData=
|
||||
[
|
||||
['graph_258',['Graph',['../d4/dd4/struct_graph.html',1,'']]],
|
||||
['graphrep_259',['GraphRep',['../d2/d6a/struct_graph_rep.html',1,'']]]
|
||||
['graph_257',['Graph',['../d4/dd4/struct_graph.html',1,'']]],
|
||||
['graphrep_258',['GraphRep',['../d2/d6a/struct_graph_rep.html',1,'']]]
|
||||
];
|
||||
|
||||
@ -1,4 +1,4 @@
|
||||
var searchData=
|
||||
[
|
||||
['hash_5fset_5ft_260',['hash_set_t',['../d0/df1/structhash__set__t.html',1,'']]]
|
||||
['hash_5fset_5ft_259',['hash_set_t',['../d0/df1/structhash__set__t.html',1,'']]]
|
||||
];
|
||||
|
||||
@ -1,4 +1,4 @@
|
||||
var searchData=
|
||||
[
|
||||
['kohonen_5farray_5f3d_261',['kohonen_array_3d',['../d8/db8/structkohonen__array__3d.html',1,'']]]
|
||||
['kohonen_5farray_5f3d_260',['kohonen_array_3d',['../d8/db8/structkohonen__array__3d.html',1,'']]]
|
||||
];
|
||||
|
||||
@ -1,4 +1,4 @@
|
||||
var searchData=
|
||||
[
|
||||
['l_262',['L',['../df/db3/struct_l.html',1,'']]]
|
||||
['l_261',['L',['../df/db3/struct_l.html',1,'']]]
|
||||
];
|
||||
|
||||
@ -1,5 +1,5 @@
|
||||
var searchData=
|
||||
[
|
||||
['max_5fheap_263',['max_heap',['../d0/d8a/structmax__heap.html',1,'']]],
|
||||
['min_5fheap_264',['min_heap',['../de/dce/structmin__heap.html',1,'']]]
|
||||
['max_5fheap_262',['max_heap',['../d0/d8a/structmax__heap.html',1,'']]],
|
||||
['min_5fheap_263',['min_heap',['../de/dce/structmin__heap.html',1,'']]]
|
||||
];
|
||||
|
||||
@ -1,4 +1,4 @@
|
||||
var searchData=
|
||||
[
|
||||
['node_265',['Node',['../db/d8b/struct_node.html',1,'Node'],['../d5/da1/structnode.html',1,'node']]]
|
||||
['node_264',['Node',['../db/d8b/struct_node.html',1,'Node'],['../d5/da1/structnode.html',1,'node']]]
|
||||
];
|
||||
|
||||
@ -1,4 +1,4 @@
|
||||
var searchData=
|
||||
[
|
||||
['pid_266',['pid',['../d0/d43/structpid.html',1,'']]]
|
||||
['pid_265',['pid',['../d0/d43/structpid.html',1,'']]]
|
||||
];
|
||||
|
||||
@ -1,5 +1,5 @@
|
||||
var searchData=
|
||||
[
|
||||
['queue_267',['queue',['../d2/d36/structqueue.html',1,'']]],
|
||||
['queuerep_268',['QueueRep',['../d0/d10/struct_queue_rep.html',1,'']]]
|
||||
['queue_266',['queue',['../d2/d36/structqueue.html',1,'']]],
|
||||
['queuerep_267',['QueueRep',['../d0/d10/struct_queue_rep.html',1,'']]]
|
||||
];
|
||||
|
||||
@ -1,6 +1,6 @@
|
||||
var searchData=
|
||||
[
|
||||
['stack_269',['Stack',['../dd/d10/struct_stack.html',1,'']]],
|
||||
['subset_270',['subset',['../dc/de5/structsubset.html',1,'']]],
|
||||
['sudoku_271',['sudoku',['../dc/d18/structsudoku.html',1,'']]]
|
||||
['stack_268',['Stack',['../dd/d10/struct_stack.html',1,'']]],
|
||||
['subset_269',['subset',['../dc/de5/structsubset.html',1,'']]],
|
||||
['sudoku_270',['sudoku',['../dc/d18/structsudoku.html',1,'']]]
|
||||
];
|
||||
|
||||
@ -1,6 +1,6 @@
|
||||
var searchData=
|
||||
[
|
||||
['t_272',['T',['../d5/d7e/struct_t.html',1,'']]],
|
||||
['tnode_273',['tnode',['../d8/d7a/structtnode.html',1,'']]],
|
||||
['trienode_274',['TrieNode',['../da/d9b/struct_trie_node.html',1,'']]]
|
||||
['t_271',['T',['../d5/d7e/struct_t.html',1,'']]],
|
||||
['tnode_272',['tnode',['../d8/d7a/structtnode.html',1,'']]],
|
||||
['trienode_273',['TrieNode',['../da/d9b/struct_trie_node.html',1,'']]]
|
||||
];
|
||||
|
||||
@ -1,4 +1,4 @@
|
||||
var searchData=
|
||||
[
|
||||
['_5fuse_5fmath_5fdefines_462',['_USE_MATH_DEFINES',['../d7/d98/spirograph_8c.html#a525335710b53cb064ca56b936120431e',1,'_USE_MATH_DEFINES(): spirograph.c'],['../d2/df6/kohonen__som__topology_8c.html#a525335710b53cb064ca56b936120431e',1,'_USE_MATH_DEFINES(): kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a525335710b53cb064ca56b936120431e',1,'_USE_MATH_DEFINES(): kohonen_som_trace.c'],['../d6/d2e/cartesian__to__polar_8c.html#a525335710b53cb064ca56b936120431e',1,'_USE_MATH_DEFINES(): cartesian_to_polar.c']]]
|
||||
['_5fuse_5fmath_5fdefines_460',['_USE_MATH_DEFINES',['../d7/d98/spirograph_8c.html#a525335710b53cb064ca56b936120431e',1,'_USE_MATH_DEFINES(): spirograph.c'],['../d2/df6/kohonen__som__topology_8c.html#a525335710b53cb064ca56b936120431e',1,'_USE_MATH_DEFINES(): kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a525335710b53cb064ca56b936120431e',1,'_USE_MATH_DEFINES(): kohonen_som_trace.c'],['../d6/d2e/cartesian__to__polar_8c.html#a525335710b53cb064ca56b936120431e',1,'_USE_MATH_DEFINES(): cartesian_to_polar.c']]]
|
||||
];
|
||||
|
||||
@ -1,4 +1,4 @@
|
||||
var searchData=
|
||||
[
|
||||
['accuracy_463',['ACCURACY',['../da/d38/durand__kerner__roots_8c.html#af270a96662132d0385cb6b4637c5a689',1,'ACCURACY(): durand_kerner_roots.c'],['../dd/d08/newton__raphson__root_8c.html#af270a96662132d0385cb6b4637c5a689',1,'ACCURACY(): newton_raphson_root.c']]]
|
||||
['accuracy_461',['ACCURACY',['../da/d38/durand__kerner__roots_8c.html#af270a96662132d0385cb6b4637c5a689',1,'ACCURACY(): durand_kerner_roots.c'],['../dd/d08/newton__raphson__root_8c.html#af270a96662132d0385cb6b4637c5a689',1,'ACCURACY(): newton_raphson_root.c']]]
|
||||
];
|
||||
|
||||
@ -1,4 +1,4 @@
|
||||
var searchData=
|
||||
[
|
||||
['epsilon_464',['EPSILON',['../d7/d50/qr__eigen__values_8c.html#a002b2f4894492820fe708b1b7e7c5e70',1,'qr_eigen_values.c']]]
|
||||
['epsilon_462',['EPSILON',['../d7/d50/qr__eigen__values_8c.html#a002b2f4894492820fe708b1b7e7c5e70',1,'qr_eigen_values.c']]]
|
||||
];
|
||||
|
||||
@ -1,4 +1,4 @@
|
||||
var searchData=
|
||||
[
|
||||
['lims_465',['LIMS',['../d7/d50/qr__eigen__values_8c.html#aee57a411f07599034f5ceb8cc7d65b40',1,'qr_eigen_values.c']]]
|
||||
['lims_463',['LIMS',['../d7/d50/qr__eigen__values_8c.html#aee57a411f07599034f5ceb8cc7d65b40',1,'qr_eigen_values.c']]]
|
||||
];
|
||||
|
||||
@ -1,12 +1,12 @@
|
||||
var searchData=
|
||||
[
|
||||
['max_5fdeno_466',['MAX_DENO',['../d1/df9/problem__26_2sol1_8c.html#a619eec3220cebd7c5e455edbb14e9b12',1,'sol1.c']]],
|
||||
['max_5fdigits_467',['MAX_DIGITS',['../d8/d32/problem__25_2sol1_8c.html#a001791a21d538b8b9176287ae60d9b61',1,'sol1.c']]],
|
||||
['max_5fl_468',['MAX_L',['../d4/d83/problem__401_2sol1_8c.html#adf2a0717e3307419a9d7c52707f5631e',1,'sol1.c']]],
|
||||
['max_5flen_469',['MAX_LEN',['../d1/df9/problem__26_2sol1_8c.html#aabf4f709c8199e41cf279c77112345fe',1,'sol1.c']]],
|
||||
['max_5fname_5flen_470',['MAX_NAME_LEN',['../dd/d8b/problem__22_2sol1_8c.html#afd709f201d7643c3909621f620ea648a',1,'sol1.c']]],
|
||||
['max_5fnames_471',['MAX_NAMES',['../dd/d8b/problem__22_2sol1_8c.html#a6cb9b08aacb61416795ee78bfceacd38',1,'sol1.c']]],
|
||||
['max_5fsize_472',['MAX_SIZE',['../df/df3/union__find_8c.html#a0592dba56693fad79136250c11e5a7fe',1,'union_find.c']]],
|
||||
['min_473',['min',['../d6/d7b/jump__search_8c.html#a8195a86b6d75b9a3939505e8bb50021e',1,'jump_search.c']]],
|
||||
['mod_474',['MOD',['../d4/d83/problem__401_2sol1_8c.html#aca7d5718ab8c38506adb3bef2469b319',1,'sol1.c']]]
|
||||
['max_5fdeno_464',['MAX_DENO',['../d1/df9/problem__26_2sol1_8c.html#a619eec3220cebd7c5e455edbb14e9b12',1,'sol1.c']]],
|
||||
['max_5fdigits_465',['MAX_DIGITS',['../d8/d32/problem__25_2sol1_8c.html#a001791a21d538b8b9176287ae60d9b61',1,'sol1.c']]],
|
||||
['max_5flen_466',['MAX_LEN',['../d1/df9/problem__26_2sol1_8c.html#aabf4f709c8199e41cf279c77112345fe',1,'sol1.c']]],
|
||||
['max_5flength_467',['MAX_LENGTH',['../d4/d83/problem__401_2sol1_8c.html#a7a9a231e30b47bc0345749c8bd1e5077',1,'sol1.c']]],
|
||||
['max_5fname_5flen_468',['MAX_NAME_LEN',['../dd/d8b/problem__22_2sol1_8c.html#afd709f201d7643c3909621f620ea648a',1,'sol1.c']]],
|
||||
['max_5fnames_469',['MAX_NAMES',['../dd/d8b/problem__22_2sol1_8c.html#a6cb9b08aacb61416795ee78bfceacd38',1,'sol1.c']]],
|
||||
['max_5fsize_470',['MAX_SIZE',['../df/df3/union__find_8c.html#a0592dba56693fad79136250c11e5a7fe',1,'union_find.c']]],
|
||||
['min_471',['min',['../d6/d7b/jump__search_8c.html#a8195a86b6d75b9a3939505e8bb50021e',1,'jump_search.c']]],
|
||||
['mod_5flimit_472',['MOD_LIMIT',['../d4/d83/problem__401_2sol1_8c.html#ade1bdf2529e3c58f53bfb4d844f3a9d3',1,'sol1.c']]]
|
||||
];
|
||||
|
||||
@ -1,5 +1,4 @@
|
||||
var searchData=
|
||||
[
|
||||
['n_475',['N',['../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4',1,'sol1.c']]],
|
||||
['n2_476',['N2',['../db/d01/problem__13_2sol1_8c.html#acd864640121c7df2c19f61f7baa507e4',1,'sol1.c']]]
|
||||
['order_473',['order',['../d4/d07/ode__forward__euler_8c.html#a9ceb646336224ee890a269d0b4600d09',1,'order(): ode_forward_euler.c'],['../d1/dc2/ode__midpoint__euler_8c.html#a9ceb646336224ee890a269d0b4600d09',1,'order(): ode_midpoint_euler.c'],['../d4/d99/ode__semi__implicit__euler_8c.html#a9ceb646336224ee890a269d0b4600d09',1,'order(): ode_semi_implicit_euler.c']]]
|
||||
];
|
||||
|
||||
@ -1,4 +1,4 @@
|
||||
var searchData=
|
||||
[
|
||||
['adaline_5flearning_2ec_276',['adaline_learning.c',['../dd/d8c/adaline__learning_8c.html',1,'']]]
|
||||
['adaline_5flearning_2ec_275',['adaline_learning.c',['../dd/d8c/adaline__learning_8c.html',1,'']]]
|
||||
];
|
||||
|
||||
@ -1,5 +1,5 @@
|
||||
var searchData=
|
||||
[
|
||||
['bead_5fsort_2ec_277',['bead_sort.c',['../d2/da8/bead__sort_8c.html',1,'']]],
|
||||
['binary_5fsearch_2ec_278',['binary_search.c',['../df/d3b/binary__search_8c.html',1,'']]]
|
||||
['bead_5fsort_2ec_276',['bead_sort.c',['../d2/da8/bead__sort_8c.html',1,'']]],
|
||||
['binary_5fsearch_2ec_277',['binary_search.c',['../df/d3b/binary__search_8c.html',1,'']]]
|
||||
];
|
||||
|
||||
@ -1,4 +1,4 @@
|
||||
var searchData=
|
||||
[
|
||||
['union_5ffind_2ec_311',['union_find.c',['../df/df3/union__find_8c.html',1,'']]]
|
||||
['union_5ffind_2ec_310',['union_find.c',['../df/df3/union__find_8c.html',1,'']]]
|
||||
];
|
||||
|
||||
@ -1,7 +1,7 @@
|
||||
var searchData=
|
||||
[
|
||||
['c_5fatoi_5fstr_5fto_5finteger_2ec_279',['c_atoi_str_to_integer.c',['../d7/dd8/c__atoi__str__to__integer_8c.html',1,'']]],
|
||||
['cantor_5fset_2ec_280',['cantor_set.c',['../dc/d80/cantor__set_8c.html',1,'']]],
|
||||
['cartesian_5fto_5fpolar_2ec_281',['cartesian_to_polar.c',['../d6/d2e/cartesian__to__polar_8c.html',1,'']]],
|
||||
['collatz_2ec_282',['collatz.c',['../dc/d80/collatz_8c.html',1,'']]]
|
||||
['c_5fatoi_5fstr_5fto_5finteger_2ec_278',['c_atoi_str_to_integer.c',['../d7/dd8/c__atoi__str__to__integer_8c.html',1,'']]],
|
||||
['cantor_5fset_2ec_279',['cantor_set.c',['../dc/d80/cantor__set_8c.html',1,'']]],
|
||||
['cartesian_5fto_5fpolar_2ec_280',['cartesian_to_polar.c',['../d6/d2e/cartesian__to__polar_8c.html',1,'']]],
|
||||
['collatz_2ec_281',['collatz.c',['../dc/d80/collatz_8c.html',1,'']]]
|
||||
];
|
||||
|
||||
@ -1,4 +1,4 @@
|
||||
var searchData=
|
||||
[
|
||||
['durand_5fkerner_5froots_2ec_283',['durand_kerner_roots.c',['../da/d38/durand__kerner__roots_8c.html',1,'']]]
|
||||
['durand_5fkerner_5froots_2ec_282',['durand_kerner_roots.c',['../da/d38/durand__kerner__roots_8c.html',1,'']]]
|
||||
];
|
||||
|
||||
@ -1,5 +1,5 @@
|
||||
var searchData=
|
||||
[
|
||||
['factorial_5flarge_5fnumber_2ec_284',['factorial_large_number.c',['../d6/d3d/factorial__large__number_8c.html',1,'']]],
|
||||
['fibonacci_5ffast_2ec_285',['fibonacci_fast.c',['../d4/d99/fibonacci__fast_8c.html',1,'']]]
|
||||
['factorial_5flarge_5fnumber_2ec_283',['factorial_large_number.c',['../d6/d3d/factorial__large__number_8c.html',1,'']]],
|
||||
['fibonacci_5ffast_2ec_284',['fibonacci_fast.c',['../d4/d99/fibonacci__fast_8c.html',1,'']]]
|
||||
];
|
||||
|
||||
@ -1,4 +1,4 @@
|
||||
var searchData=
|
||||
[
|
||||
['jump_5fsearch_2ec_286',['jump_search.c',['../d6/d7b/jump__search_8c.html',1,'']]]
|
||||
['jump_5fsearch_2ec_285',['jump_search.c',['../d6/d7b/jump__search_8c.html',1,'']]]
|
||||
];
|
||||
|
||||
@ -1,5 +1,5 @@
|
||||
var searchData=
|
||||
[
|
||||
['kohonen_5fsom_5ftopology_2ec_287',['kohonen_som_topology.c',['../d2/df6/kohonen__som__topology_8c.html',1,'']]],
|
||||
['kohonen_5fsom_5ftrace_2ec_288',['kohonen_som_trace.c',['../d0/d46/kohonen__som__trace_8c.html',1,'']]]
|
||||
['kohonen_5fsom_5ftopology_2ec_286',['kohonen_som_topology.c',['../d2/df6/kohonen__som__topology_8c.html',1,'']]],
|
||||
['kohonen_5fsom_5ftrace_2ec_287',['kohonen_som_trace.c',['../d0/d46/kohonen__som__trace_8c.html',1,'']]]
|
||||
];
|
||||
|
||||
@ -1,4 +1,4 @@
|
||||
var searchData=
|
||||
[
|
||||
['lu_5fdecompose_2ec_289',['lu_decompose.c',['../dc/d2e/lu__decompose_8c.html',1,'']]]
|
||||
['lu_5fdecompose_2ec_288',['lu_decompose.c',['../dc/d2e/lu__decompose_8c.html',1,'']]]
|
||||
];
|
||||
|
||||
@ -1,5 +1,5 @@
|
||||
var searchData=
|
||||
[
|
||||
['merge_5fsort_2ec_290',['merge_sort.c',['../d2/d83/merge__sort_8c.html',1,'']]],
|
||||
['modified_5fbinary_5fsearch_2ec_291',['modified_binary_search.c',['../d3/d47/modified__binary__search_8c.html',1,'']]]
|
||||
['merge_5fsort_2ec_289',['merge_sort.c',['../d2/d83/merge__sort_8c.html',1,'']]],
|
||||
['modified_5fbinary_5fsearch_2ec_290',['modified_binary_search.c',['../d3/d47/modified__binary__search_8c.html',1,'']]]
|
||||
];
|
||||
|
||||
@ -1,4 +1,4 @@
|
||||
var searchData=
|
||||
[
|
||||
['newton_5fraphson_5froot_2ec_292',['newton_raphson_root.c',['../dd/d08/newton__raphson__root_8c.html',1,'']]]
|
||||
['newton_5fraphson_5froot_2ec_291',['newton_raphson_root.c',['../dd/d08/newton__raphson__root_8c.html',1,'']]]
|
||||
];
|
||||
|
||||
@ -1,6 +1,6 @@
|
||||
var searchData=
|
||||
[
|
||||
['ode_5fforward_5feuler_2ec_293',['ode_forward_euler.c',['../d4/d07/ode__forward__euler_8c.html',1,'']]],
|
||||
['ode_5fmidpoint_5feuler_2ec_294',['ode_midpoint_euler.c',['../d1/dc2/ode__midpoint__euler_8c.html',1,'']]],
|
||||
['ode_5fsemi_5fimplicit_5feuler_2ec_295',['ode_semi_implicit_euler.c',['../d4/d99/ode__semi__implicit__euler_8c.html',1,'']]]
|
||||
['ode_5fforward_5feuler_2ec_292',['ode_forward_euler.c',['../d4/d07/ode__forward__euler_8c.html',1,'']]],
|
||||
['ode_5fmidpoint_5feuler_2ec_293',['ode_midpoint_euler.c',['../d1/dc2/ode__midpoint__euler_8c.html',1,'']]],
|
||||
['ode_5fsemi_5fimplicit_5feuler_2ec_294',['ode_semi_implicit_euler.c',['../d4/d99/ode__semi__implicit__euler_8c.html',1,'']]]
|
||||
];
|
||||
|
||||
@ -1,4 +1,4 @@
|
||||
var searchData=
|
||||
[
|
||||
['palindrome_2ec_296',['palindrome.c',['../df/d16/palindrome_8c.html',1,'']]]
|
||||
['palindrome_2ec_295',['palindrome.c',['../df/d16/palindrome_8c.html',1,'']]]
|
||||
];
|
||||
|
||||
@ -1,6 +1,6 @@
|
||||
var searchData=
|
||||
[
|
||||
['qr_5fdecompose_2eh_297',['qr_decompose.h',['../d4/d68/qr__decompose_8h.html',1,'']]],
|
||||
['qr_5fdecomposition_2ec_298',['qr_decomposition.c',['../d5/d23/qr__decomposition_8c.html',1,'']]],
|
||||
['qr_5feigen_5fvalues_2ec_299',['qr_eigen_values.c',['../d7/d50/qr__eigen__values_8c.html',1,'']]]
|
||||
['qr_5fdecompose_2eh_296',['qr_decompose.h',['../d4/d68/qr__decompose_8h.html',1,'']]],
|
||||
['qr_5fdecomposition_2ec_297',['qr_decomposition.c',['../d5/d23/qr__decomposition_8c.html',1,'']]],
|
||||
['qr_5feigen_5fvalues_2ec_298',['qr_eigen_values.c',['../d7/d50/qr__eigen__values_8c.html',1,'']]]
|
||||
];
|
||||
|
||||
@ -1,4 +1,4 @@
|
||||
var searchData=
|
||||
[
|
||||
['realtime_5fstats_2ec_300',['realtime_stats.c',['../dc/d47/realtime__stats_8c.html',1,'']]]
|
||||
['realtime_5fstats_2ec_299',['realtime_stats.c',['../dc/d47/realtime__stats_8c.html',1,'']]]
|
||||
];
|
||||
|
||||
@ -1,12 +1,12 @@
|
||||
var searchData=
|
||||
[
|
||||
['shell_5fsort2_2ec_301',['shell_sort2.c',['../d6/ded/shell__sort2_8c.html',1,'']]],
|
||||
['so1_2ec_302',['so1.c',['../d0/d7f/so1_8c.html',1,'']]],
|
||||
['sol_2ec_303',['sol.c',['../d0/d6c/problem__4_2sol_8c.html',1,'(Global Namespace)'],['../df/de7/problem__5_2sol_8c.html',1,'(Global Namespace)'],['../d4/d7b/problem__6_2sol_8c.html',1,'(Global Namespace)'],['../d1/d2f/problem__7_2sol_8c.html',1,'(Global Namespace)']]],
|
||||
['sol1_2ec_304',['sol1.c',['../da/d35/problem__1_2sol1_8c.html',1,'(Global Namespace)'],['../d0/d6d/problem__10_2sol1_8c.html',1,'(Global Namespace)'],['../d7/d1f/problem__12_2sol1_8c.html',1,'(Global Namespace)'],['../db/d01/problem__13_2sol1_8c.html',1,'(Global Namespace)'],['../d4/dea/problem__14_2sol1_8c.html',1,'(Global Namespace)'],['../d7/d91/problem__15_2sol1_8c.html',1,'(Global Namespace)'],['../d6/d88/problem__16_2sol1_8c.html',1,'(Global Namespace)'],['../dd/df0/problem__19_2sol1_8c.html',1,'(Global Namespace)'],['../db/d80/problem__20_2sol1_8c.html',1,'(Global Namespace)'],['../df/d1a/problem__21_2sol1_8c.html',1,'(Global Namespace)'],['../dd/d8b/problem__22_2sol1_8c.html',1,'(Global Namespace)'],['../d7/ddb/problem__23_2sol1_8c.html',1,'(Global Namespace)'],['../d8/d32/problem__25_2sol1_8c.html',1,'(Global Namespace)'],['../d1/df9/problem__26_2sol1_8c.html',1,'(Global Namespace)'],['../d7/dd3/problem__3_2sol1_8c.html',1,'(Global Namespace)'],['../d4/d83/problem__401_2sol1_8c.html',1,'(Global Namespace)'],['../dc/d63/problem__8_2sol1_8c.html',1,'(Global Namespace)'],['../df/da5/problem__9_2sol1_8c.html',1,'(Global Namespace)']]],
|
||||
['sol2_2ec_305',['sol2.c',['../d2/dae/problem__1_2sol2_8c.html',1,'(Global Namespace)'],['../d9/da7/problem__10_2sol2_8c.html',1,'(Global Namespace)'],['../d4/dbd/problem__23_2sol2_8c.html',1,'(Global Namespace)'],['../d2/dbc/problem__3_2sol2_8c.html',1,'(Global Namespace)'],['../d2/d93/problem__8_2sol2_8c.html',1,'(Global Namespace)'],['../d8/de0/problem__9_2sol2_8c.html',1,'(Global Namespace)']]],
|
||||
['sol3_2ec_306',['sol3.c',['../d6/de3/sol3_8c.html',1,'']]],
|
||||
['sol4_2ec_307',['sol4.c',['../d6/d1b/sol4_8c.html',1,'']]],
|
||||
['spirograph_2ec_308',['spirograph.c',['../d7/d98/spirograph_8c.html',1,'']]],
|
||||
['sudoku_5fsolver_2ec_309',['sudoku_solver.c',['../de/dac/sudoku__solver_8c.html',1,'']]]
|
||||
['shell_5fsort2_2ec_300',['shell_sort2.c',['../d6/ded/shell__sort2_8c.html',1,'']]],
|
||||
['so1_2ec_301',['so1.c',['../d0/d7f/so1_8c.html',1,'']]],
|
||||
['sol_2ec_302',['sol.c',['../d0/d6c/problem__4_2sol_8c.html',1,'(Global Namespace)'],['../df/de7/problem__5_2sol_8c.html',1,'(Global Namespace)'],['../d4/d7b/problem__6_2sol_8c.html',1,'(Global Namespace)'],['../d1/d2f/problem__7_2sol_8c.html',1,'(Global Namespace)']]],
|
||||
['sol1_2ec_303',['sol1.c',['../da/d35/problem__1_2sol1_8c.html',1,'(Global Namespace)'],['../d0/d6d/problem__10_2sol1_8c.html',1,'(Global Namespace)'],['../d7/d1f/problem__12_2sol1_8c.html',1,'(Global Namespace)'],['../db/d01/problem__13_2sol1_8c.html',1,'(Global Namespace)'],['../d4/dea/problem__14_2sol1_8c.html',1,'(Global Namespace)'],['../d7/d91/problem__15_2sol1_8c.html',1,'(Global Namespace)'],['../d6/d88/problem__16_2sol1_8c.html',1,'(Global Namespace)'],['../dd/df0/problem__19_2sol1_8c.html',1,'(Global Namespace)'],['../db/d80/problem__20_2sol1_8c.html',1,'(Global Namespace)'],['../df/d1a/problem__21_2sol1_8c.html',1,'(Global Namespace)'],['../dd/d8b/problem__22_2sol1_8c.html',1,'(Global Namespace)'],['../d7/ddb/problem__23_2sol1_8c.html',1,'(Global Namespace)'],['../d8/d32/problem__25_2sol1_8c.html',1,'(Global Namespace)'],['../d1/df9/problem__26_2sol1_8c.html',1,'(Global Namespace)'],['../d7/dd3/problem__3_2sol1_8c.html',1,'(Global Namespace)'],['../d4/d83/problem__401_2sol1_8c.html',1,'(Global Namespace)'],['../dc/d63/problem__8_2sol1_8c.html',1,'(Global Namespace)'],['../df/da5/problem__9_2sol1_8c.html',1,'(Global Namespace)']]],
|
||||
['sol2_2ec_304',['sol2.c',['../d2/dae/problem__1_2sol2_8c.html',1,'(Global Namespace)'],['../d9/da7/problem__10_2sol2_8c.html',1,'(Global Namespace)'],['../d4/dbd/problem__23_2sol2_8c.html',1,'(Global Namespace)'],['../d2/dbc/problem__3_2sol2_8c.html',1,'(Global Namespace)'],['../d2/d93/problem__8_2sol2_8c.html',1,'(Global Namespace)'],['../d8/de0/problem__9_2sol2_8c.html',1,'(Global Namespace)']]],
|
||||
['sol3_2ec_305',['sol3.c',['../d6/de3/sol3_8c.html',1,'']]],
|
||||
['sol4_2ec_306',['sol4.c',['../d6/d1b/sol4_8c.html',1,'']]],
|
||||
['spirograph_2ec_307',['spirograph.c',['../d7/d98/spirograph_8c.html',1,'']]],
|
||||
['sudoku_5fsolver_2ec_308',['sudoku_solver.c',['../de/dac/sudoku__solver_8c.html',1,'']]]
|
||||
];
|
||||
|
||||
@ -1,4 +1,4 @@
|
||||
var searchData=
|
||||
[
|
||||
['threaded_5fbinary_5ftrees_2ec_310',['threaded_binary_trees.c',['../df/d3c/threaded__binary__trees_8c.html',1,'']]]
|
||||
['threaded_5fbinary_5ftrees_2ec_309',['threaded_binary_trees.c',['../df/d3c/threaded__binary__trees_8c.html',1,'']]]
|
||||
];
|
||||
|
||||
@ -1,4 +1,4 @@
|
||||
var searchData=
|
||||
[
|
||||
['_5frandom_312',['_random',['../d1/d6b/group__kohonen__2d.html#gaf5ce14f026d6d231bef29161bac2b485',1,'_random(double a, double b): kohonen_som_topology.c'],['../d0/dcb/group__kohonen__1d.html#gaf5ce14f026d6d231bef29161bac2b485',1,'_random(double a, double b): kohonen_som_trace.c']]]
|
||||
['_5frandom_311',['_random',['../d1/d6b/group__kohonen__2d.html#gaf5ce14f026d6d231bef29161bac2b485',1,'_random(double a, double b): kohonen_som_topology.c'],['../d0/dcb/group__kohonen__1d.html#gaf5ce14f026d6d231bef29161bac2b485',1,'_random(double a, double b): kohonen_som_trace.c']]]
|
||||
];
|
||||
|
||||
@ -1,10 +1,10 @@
|
||||
var searchData=
|
||||
[
|
||||
['adaline_5factivation_313',['adaline_activation',['../da/d2a/group__adaline.html#ga43576566b020c4157d4fb28f0dd45cfa',1,'adaline_learning.c']]],
|
||||
['adaline_5ffit_314',['adaline_fit',['../da/d2a/group__adaline.html#gaa52120912e32d2893fe1c6d78da5befd',1,'adaline_learning.c']]],
|
||||
['adaline_5ffit_5fsample_315',['adaline_fit_sample',['../da/d2a/group__adaline.html#ga20d3642e0a87f36fdb7bf91b023cd166',1,'adaline_learning.c']]],
|
||||
['adaline_5fget_5fweights_5fstr_316',['adaline_get_weights_str',['../da/d2a/group__adaline.html#ga251695a79baa885cafdcf6d8ed4ac120',1,'adaline_learning.c']]],
|
||||
['adaline_5fpredict_317',['adaline_predict',['../da/d2a/group__adaline.html#gac70b578aee679005fd336073969c3d94',1,'adaline_learning.c']]],
|
||||
['add_5fdigit_318',['add_digit',['../d6/d3d/factorial__large__number_8c.html#af2869d36c22a2b8f93d3166a84e124b3',1,'add_digit(large_num *num, unsigned int value): factorial_large_number.c'],['../db/d80/problem__20_2sol1_8c.html#afc373c28da6b17636528edcc97fb5f86',1,'add_digit(big_int *digit, char value): sol1.c']]],
|
||||
['add_5fnumbers_319',['add_numbers',['../db/d01/problem__13_2sol1_8c.html#ad51742ca5a5c99e860bdf30299163bf2',1,'add_numbers(uint8_t *a, uint8_t *b, uint8_t N): sol1.c'],['../d8/d32/problem__25_2sol1_8c.html#af9729befaffc1aab9ac9fedc4706e66c',1,'add_numbers(unsigned char *a, unsigned char *b, unsigned char *c, int N): sol1.c']]]
|
||||
['adaline_5factivation_312',['adaline_activation',['../da/d2a/group__adaline.html#ga43576566b020c4157d4fb28f0dd45cfa',1,'adaline_learning.c']]],
|
||||
['adaline_5ffit_313',['adaline_fit',['../da/d2a/group__adaline.html#gaa52120912e32d2893fe1c6d78da5befd',1,'adaline_learning.c']]],
|
||||
['adaline_5ffit_5fsample_314',['adaline_fit_sample',['../da/d2a/group__adaline.html#ga20d3642e0a87f36fdb7bf91b023cd166',1,'adaline_learning.c']]],
|
||||
['adaline_5fget_5fweights_5fstr_315',['adaline_get_weights_str',['../da/d2a/group__adaline.html#ga251695a79baa885cafdcf6d8ed4ac120',1,'adaline_learning.c']]],
|
||||
['adaline_5fpredict_316',['adaline_predict',['../da/d2a/group__adaline.html#gac70b578aee679005fd336073969c3d94',1,'adaline_learning.c']]],
|
||||
['add_5fdigit_317',['add_digit',['../d6/d3d/factorial__large__number_8c.html#af2869d36c22a2b8f93d3166a84e124b3',1,'add_digit(large_num *num, unsigned int value): factorial_large_number.c'],['../db/d80/problem__20_2sol1_8c.html#afc373c28da6b17636528edcc97fb5f86',1,'add_digit(big_int *digit, char value): sol1.c']]],
|
||||
['add_5fnumbers_318',['add_numbers',['../db/d01/problem__13_2sol1_8c.html#ad51742ca5a5c99e860bdf30299163bf2',1,'add_numbers(uint8_t *a, uint8_t *b, uint8_t N): sol1.c'],['../d8/d32/problem__25_2sol1_8c.html#af9729befaffc1aab9ac9fedc4706e66c',1,'add_numbers(unsigned char *a, unsigned char *b, unsigned char *c, int N): sol1.c']]]
|
||||
];
|
||||
|
||||
@ -1,4 +1,4 @@
|
||||
var searchData=
|
||||
[
|
||||
['qr_5fdecompose_400',['qr_decompose',['../d4/d68/qr__decompose_8h.html#a45c7640d9d22c89c11beb1f567843c56',1,'qr_decompose.h']]]
|
||||
['qr_5fdecompose_399',['qr_decompose',['../d4/d68/qr__decompose_8h.html#a45c7640d9d22c89c11beb1f567843c56',1,'qr_decompose.h']]]
|
||||
];
|
||||
|
||||
@ -1,4 +1,4 @@
|
||||
var searchData=
|
||||
[
|
||||
['remove_5fdigits_401',['remove_digits',['../db/d80/problem__20_2sol1_8c.html#a54a02c4b963fdb16f24959e0137763f1',1,'sol1.c']]]
|
||||
['remove_5fdigits_400',['remove_digits',['../db/d80/problem__20_2sol1_8c.html#a54a02c4b963fdb16f24959e0137763f1',1,'sol1.c']]]
|
||||
];
|
||||
|
||||
@ -1,20 +1,20 @@
|
||||
var searchData=
|
||||
[
|
||||
['save_5f2d_5fdata_402',['save_2d_data',['../d1/d6b/group__kohonen__2d.html#ga6824dc6d973eb3339af7aef5fea78b0c',1,'kohonen_som_topology.c']]],
|
||||
['save_5fnd_5fdata_403',['save_nd_data',['../d0/dcb/group__kohonen__1d.html#ga7b84b14e60f47812b581d1f93057c85a',1,'kohonen_som_trace.c']]],
|
||||
['save_5fu_5fmatrix_404',['save_u_matrix',['../d1/d6b/group__kohonen__2d.html#ga49d35f68f5d11d8ef6f8cce0d0e7bcba',1,'kohonen_som_topology.c']]],
|
||||
['search_405',['search',['../df/d3c/threaded__binary__trees_8c.html#a306d567466f22e1e927aaed97d8bb58c',1,'threaded_binary_trees.c']]],
|
||||
['semi_5fimplicit_5feuler_406',['semi_implicit_euler',['../d4/d99/ode__semi__implicit__euler_8c.html#ad80059877222f885b549f2d0a3dc6b55',1,'ode_semi_implicit_euler.c']]],
|
||||
['semi_5fimplicit_5feuler_5fstep_407',['semi_implicit_euler_step',['../d4/d99/ode__semi__implicit__euler_8c.html#a720b7e995d2bbc615f94a2c7dbcf84eb',1,'ode_semi_implicit_euler.c']]],
|
||||
['shell_5fsort_408',['shell_sort',['../dd/d8b/problem__22_2sol1_8c.html#a5bc3659aa0949ea33118c95b1dee5f63',1,'shell_sort(char data[][MAX_NAME_LEN], int LEN): sol1.c'],['../d5/d4c/group__sorting.html#ga5bc16eaf3ffe6a6ab66780dd445904c0',1,'shell_sort(int *array, long LEN): shell_sort2.c']]],
|
||||
['show_5fdata_409',['show_data',['../d5/d4c/group__sorting.html#gaeccaf61ff47279384d1dba8d869d5c2f',1,'shell_sort2.c']]],
|
||||
['sigma_410',['sigma',['../d4/d83/problem__401_2sol1_8c.html#aaf964739be92adc2f500e7da11e3f6be',1,'sol1.c']]],
|
||||
['sigma2_411',['sigma2',['../d4/d83/problem__401_2sol1_8c.html#a236548478af932f1115a71f601a68788',1,'sol1.c']]],
|
||||
['solve_412',['solve',['../d5/df4/group__sudoku.html#gadfe0ed5085b4775d8fa00b434cc0fdfc',1,'sudoku_solver.c']]],
|
||||
['spirograph_413',['spirograph',['../d7/d98/spirograph_8c.html#a0daa148091ec953809fc172289f773d3',1,'spirograph.c']]],
|
||||
['stats_5fcomputer1_414',['stats_computer1',['../dc/d47/realtime__stats_8c.html#a63ddcdaab24f722f0963fa2fbe0ae628',1,'realtime_stats.c']]],
|
||||
['stats_5fcomputer2_415',['stats_computer2',['../dc/d47/realtime__stats_8c.html#a34be233a9200ee2065f6b7b27e2d9a96',1,'realtime_stats.c']]],
|
||||
['sum_5fof_5fdivisors_416',['sum_of_divisors',['../df/d1a/problem__21_2sol1_8c.html#aacf4b7e708651d2164e86958f2c29c93',1,'sol1.c']]],
|
||||
['sum_5fof_5fprimes_417',['sum_of_primes',['../d0/d6d/problem__10_2sol1_8c.html#ae3d987cb2ad0ddb0c3caa4c2506a20e5',1,'sol1.c']]],
|
||||
['swap_418',['swap',['../d5/d4c/group__sorting.html#ga4b9708d87be7a409eff20e5e7e8b43c8',1,'merge_sort.c']]]
|
||||
['save_5f2d_5fdata_401',['save_2d_data',['../d1/d6b/group__kohonen__2d.html#ga6824dc6d973eb3339af7aef5fea78b0c',1,'kohonen_som_topology.c']]],
|
||||
['save_5fnd_5fdata_402',['save_nd_data',['../d0/dcb/group__kohonen__1d.html#ga7b84b14e60f47812b581d1f93057c85a',1,'kohonen_som_trace.c']]],
|
||||
['save_5fu_5fmatrix_403',['save_u_matrix',['../d1/d6b/group__kohonen__2d.html#ga49d35f68f5d11d8ef6f8cce0d0e7bcba',1,'kohonen_som_topology.c']]],
|
||||
['search_404',['search',['../df/d3c/threaded__binary__trees_8c.html#a306d567466f22e1e927aaed97d8bb58c',1,'threaded_binary_trees.c']]],
|
||||
['semi_5fimplicit_5feuler_405',['semi_implicit_euler',['../d4/d99/ode__semi__implicit__euler_8c.html#ad80059877222f885b549f2d0a3dc6b55',1,'ode_semi_implicit_euler.c']]],
|
||||
['semi_5fimplicit_5feuler_5fstep_406',['semi_implicit_euler_step',['../d4/d99/ode__semi__implicit__euler_8c.html#a720b7e995d2bbc615f94a2c7dbcf84eb',1,'ode_semi_implicit_euler.c']]],
|
||||
['shell_5fsort_407',['shell_sort',['../dd/d8b/problem__22_2sol1_8c.html#a5bc3659aa0949ea33118c95b1dee5f63',1,'shell_sort(char data[][MAX_NAME_LEN], int LEN): sol1.c'],['../d5/d4c/group__sorting.html#ga5bc16eaf3ffe6a6ab66780dd445904c0',1,'shell_sort(int *array, long LEN): shell_sort2.c']]],
|
||||
['show_5fdata_408',['show_data',['../d5/d4c/group__sorting.html#gaeccaf61ff47279384d1dba8d869d5c2f',1,'shell_sort2.c']]],
|
||||
['sigma_409',['sigma',['../d4/d83/problem__401_2sol1_8c.html#aaf964739be92adc2f500e7da11e3f6be',1,'sol1.c']]],
|
||||
['sigma2_410',['sigma2',['../d4/d83/problem__401_2sol1_8c.html#a236548478af932f1115a71f601a68788',1,'sol1.c']]],
|
||||
['solve_411',['solve',['../d5/df4/group__sudoku.html#gadfe0ed5085b4775d8fa00b434cc0fdfc',1,'sudoku_solver.c']]],
|
||||
['spirograph_412',['spirograph',['../d7/d98/spirograph_8c.html#a0daa148091ec953809fc172289f773d3',1,'spirograph.c']]],
|
||||
['stats_5fcomputer1_413',['stats_computer1',['../dc/d47/realtime__stats_8c.html#a63ddcdaab24f722f0963fa2fbe0ae628',1,'realtime_stats.c']]],
|
||||
['stats_5fcomputer2_414',['stats_computer2',['../dc/d47/realtime__stats_8c.html#a34be233a9200ee2065f6b7b27e2d9a96',1,'realtime_stats.c']]],
|
||||
['sum_5fof_5fdivisors_415',['sum_of_divisors',['../df/d1a/problem__21_2sol1_8c.html#aacf4b7e708651d2164e86958f2c29c93',1,'sol1.c']]],
|
||||
['sum_5fof_5fprimes_416',['sum_of_primes',['../d0/d6d/problem__10_2sol1_8c.html#ae3d987cb2ad0ddb0c3caa4c2506a20e5',1,'sol1.c']]],
|
||||
['swap_417',['swap',['../d5/d4c/group__sorting.html#ga4b9708d87be7a409eff20e5e7e8b43c8',1,'merge_sort.c']]]
|
||||
];
|
||||
|
||||
@ -1,16 +1,16 @@
|
||||
var searchData=
|
||||
[
|
||||
['test_419',['test',['../d7/d98/spirograph_8c.html#a708a4c1a4d0c4acc4c447310dd4db27f',1,'test(void): spirograph.c'],['../d6/d2e/cartesian__to__polar_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): cartesian_to_polar.c'],['../df/d3b/binary__search_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): binary_search.c'],['../d6/d7b/jump__search_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): jump_search.c']]],
|
||||
['test1_420',['test1',['../dd/d8c/adaline__learning_8c.html#ab4ecb3accf5d9e0263087e7265bbe3a9',1,'test1(double eta): adaline_learning.c'],['../d2/df6/kohonen__som__topology_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): kohonen_som_trace.c'],['../d7/d50/qr__eigen__values_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): qr_eigen_values.c']]],
|
||||
['test2_421',['test2',['../dd/d8c/adaline__learning_8c.html#a05cc9a0acb524fde727a4d7b4a747ee6',1,'test2(double eta): adaline_learning.c'],['../d2/df6/kohonen__som__topology_8c.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): kohonen_som_trace.c'],['../d7/d50/qr__eigen__values_8c.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): qr_eigen_values.c']]],
|
||||
['test3_422',['test3',['../dd/d8c/adaline__learning_8c.html#a3f37b9f073f7e57fd0b39d70718af1b1',1,'test3(double eta): adaline_learning.c'],['../d2/df6/kohonen__som__topology_8c.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3(): kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3(): kohonen_som_trace.c']]],
|
||||
['test_5f2d_5fclasses_423',['test_2d_classes',['../d2/df6/kohonen__som__topology_8c.html#adb5ded007be1fd666fab9affe6764018',1,'kohonen_som_topology.c']]],
|
||||
['test_5f3d_5fclasses_424',['test_3d_classes',['../d0/d46/kohonen__som__trace_8c.html#a41ae16442e3e5b891a58d2e5932a2cd0',1,'kohonen_som_trace.c']]],
|
||||
['test_5f3d_5fclasses1_425',['test_3d_classes1',['../d2/df6/kohonen__som__topology_8c.html#ad9e25202bb8b481461f932668f249dbc',1,'kohonen_som_topology.c']]],
|
||||
['test_5f3d_5fclasses2_426',['test_3d_classes2',['../d2/df6/kohonen__som__topology_8c.html#a5bb02a8322d717ead1b11182c5f02a3a',1,'kohonen_som_topology.c']]],
|
||||
['test_5fc_5fatoi_427',['test_c_atoi',['../d7/dd8/c__atoi__str__to__integer_8c.html#a8c66c03637e48e375b80b5d7791e57be',1,'c_atoi_str_to_integer.c']]],
|
||||
['test_5fcircle_428',['test_circle',['../d0/d46/kohonen__som__trace_8c.html#a107f00650b8041f77767927073ddddb8',1,'kohonen_som_trace.c']]],
|
||||
['test_5ffunction_429',['test_function',['../dc/d47/realtime__stats_8c.html#aa54c915581fcc495489175a4386d59fd',1,'realtime_stats.c']]],
|
||||
['test_5flamniscate_430',['test_lamniscate',['../d0/d46/kohonen__som__trace_8c.html#aa2246f940155472084ee461f3685d614',1,'kohonen_som_trace.c']]],
|
||||
['to_5fpolar_431',['to_polar',['../d6/d2e/cartesian__to__polar_8c.html#afb80d77f0c994240309ccddcc9525e70',1,'cartesian_to_polar.c']]]
|
||||
['test_418',['test',['../d7/d98/spirograph_8c.html#a708a4c1a4d0c4acc4c447310dd4db27f',1,'test(void): spirograph.c'],['../d6/d2e/cartesian__to__polar_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): cartesian_to_polar.c'],['../df/d3b/binary__search_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): binary_search.c'],['../d6/d7b/jump__search_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): jump_search.c']]],
|
||||
['test1_419',['test1',['../dd/d8c/adaline__learning_8c.html#ab4ecb3accf5d9e0263087e7265bbe3a9',1,'test1(double eta): adaline_learning.c'],['../d2/df6/kohonen__som__topology_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): kohonen_som_trace.c'],['../d7/d50/qr__eigen__values_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): qr_eigen_values.c']]],
|
||||
['test2_420',['test2',['../dd/d8c/adaline__learning_8c.html#a05cc9a0acb524fde727a4d7b4a747ee6',1,'test2(double eta): adaline_learning.c'],['../d2/df6/kohonen__som__topology_8c.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): kohonen_som_trace.c'],['../d7/d50/qr__eigen__values_8c.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): qr_eigen_values.c']]],
|
||||
['test3_421',['test3',['../dd/d8c/adaline__learning_8c.html#a3f37b9f073f7e57fd0b39d70718af1b1',1,'test3(double eta): adaline_learning.c'],['../d2/df6/kohonen__som__topology_8c.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3(): kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3(): kohonen_som_trace.c']]],
|
||||
['test_5f2d_5fclasses_422',['test_2d_classes',['../d2/df6/kohonen__som__topology_8c.html#adb5ded007be1fd666fab9affe6764018',1,'kohonen_som_topology.c']]],
|
||||
['test_5f3d_5fclasses_423',['test_3d_classes',['../d0/d46/kohonen__som__trace_8c.html#a41ae16442e3e5b891a58d2e5932a2cd0',1,'kohonen_som_trace.c']]],
|
||||
['test_5f3d_5fclasses1_424',['test_3d_classes1',['../d2/df6/kohonen__som__topology_8c.html#ad9e25202bb8b481461f932668f249dbc',1,'kohonen_som_topology.c']]],
|
||||
['test_5f3d_5fclasses2_425',['test_3d_classes2',['../d2/df6/kohonen__som__topology_8c.html#a5bb02a8322d717ead1b11182c5f02a3a',1,'kohonen_som_topology.c']]],
|
||||
['test_5fc_5fatoi_426',['test_c_atoi',['../d7/dd8/c__atoi__str__to__integer_8c.html#a8c66c03637e48e375b80b5d7791e57be',1,'c_atoi_str_to_integer.c']]],
|
||||
['test_5fcircle_427',['test_circle',['../d0/d46/kohonen__som__trace_8c.html#a107f00650b8041f77767927073ddddb8',1,'kohonen_som_trace.c']]],
|
||||
['test_5ffunction_428',['test_function',['../dc/d47/realtime__stats_8c.html#aa54c915581fcc495489175a4386d59fd',1,'realtime_stats.c']]],
|
||||
['test_5flamniscate_429',['test_lamniscate',['../d0/d46/kohonen__som__trace_8c.html#aa2246f940155472084ee461f3685d614',1,'kohonen_som_trace.c']]],
|
||||
['to_5fpolar_430',['to_polar',['../d6/d2e/cartesian__to__polar_8c.html#afb80d77f0c994240309ccddcc9525e70',1,'cartesian_to_polar.c']]]
|
||||
];
|
||||
|
||||
@ -1,7 +1,7 @@
|
||||
var searchData=
|
||||
[
|
||||
['vector_5fdot_432',['vector_dot',['../d4/d68/qr__decompose_8h.html#a3a584b79941a43d775f9d4ce446dbe05',1,'qr_decompose.h']]],
|
||||
['vector_5fmag_433',['vector_mag',['../d4/d68/qr__decompose_8h.html#abeec1f78a7a7e7251687e75340331212',1,'qr_decompose.h']]],
|
||||
['vector_5fproj_434',['vector_proj',['../d4/d68/qr__decompose_8h.html#a82b20e027437df768d7e994cf4cae29f',1,'qr_decompose.h']]],
|
||||
['vector_5fsub_435',['vector_sub',['../d4/d68/qr__decompose_8h.html#a6b6a0e75e75ff7919057dd275bb69145',1,'qr_decompose.h']]]
|
||||
['vector_5fdot_431',['vector_dot',['../d4/d68/qr__decompose_8h.html#a3a584b79941a43d775f9d4ce446dbe05',1,'qr_decompose.h']]],
|
||||
['vector_5fmag_432',['vector_mag',['../d4/d68/qr__decompose_8h.html#abeec1f78a7a7e7251687e75340331212',1,'qr_decompose.h']]],
|
||||
['vector_5fproj_433',['vector_proj',['../d4/d68/qr__decompose_8h.html#a82b20e027437df768d7e994cf4cae29f',1,'qr_decompose.h']]],
|
||||
['vector_5fsub_434',['vector_sub',['../d4/d68/qr__decompose_8h.html#a6b6a0e75e75ff7919057dd275bb69145',1,'qr_decompose.h']]]
|
||||
];
|
||||
|
||||
@ -1,7 +1,7 @@
|
||||
var searchData=
|
||||
[
|
||||
['bead_5fsort_320',['bead_sort',['../d5/d4c/group__sorting.html#ga2fb01e00dedb437a42010f6309e7eba8',1,'bead_sort.c']]],
|
||||
['binarysearch_321',['binarySearch',['../d3/d47/modified__binary__search_8c.html#a0cfaa56aacf960e4628a0fb27add8890',1,'modified_binary_search.c']]],
|
||||
['binarysearch1_322',['binarysearch1',['../df/d3b/binary__search_8c.html#a40855c608ca64048d04cff6526f0a582',1,'binary_search.c']]],
|
||||
['binarysearch2_323',['binarysearch2',['../df/d3b/binary__search_8c.html#a908fd6d2ad0bba33f63f8454888a0032',1,'binary_search.c']]]
|
||||
['bead_5fsort_319',['bead_sort',['../d5/d4c/group__sorting.html#ga2fb01e00dedb437a42010f6309e7eba8',1,'bead_sort.c']]],
|
||||
['binarysearch_320',['binarySearch',['../d3/d47/modified__binary__search_8c.html#a0cfaa56aacf960e4628a0fb27add8890',1,'modified_binary_search.c']]],
|
||||
['binarysearch1_321',['binarysearch1',['../df/d3b/binary__search_8c.html#a40855c608ca64048d04cff6526f0a582',1,'binary_search.c']]],
|
||||
['binarysearch2_322',['binarysearch2',['../df/d3b/binary__search_8c.html#a908fd6d2ad0bba33f63f8454888a0032',1,'binary_search.c']]]
|
||||
];
|
||||
|
||||
@ -1,11 +1,11 @@
|
||||
var searchData=
|
||||
[
|
||||
['c_5fatoi_324',['c_atoi',['../d7/dd8/c__atoi__str__to__integer_8c.html#ad19049ebfc2088bc1e75e7e958f7b60f',1,'c_atoi_str_to_integer.c']]],
|
||||
['check_5ftermination_325',['check_termination',['../da/d38/durand__kerner__roots_8c.html#a26d5695ebed0818a3e7cf4b10aacab52',1,'durand_kerner_roots.c']]],
|
||||
['collatz_326',['collatz',['../d4/dea/problem__14_2sol1_8c.html#a81c1df5c17cb16bcc16e346fcff6fa80',1,'sol1.c']]],
|
||||
['compare_327',['compare',['../d1/df9/problem__26_2sol1_8c.html#ac70138609ef6aa6fabca57aca8681e83',1,'sol1.c']]],
|
||||
['complex_5fstr_328',['complex_str',['../da/d38/durand__kerner__roots_8c.html#afa5b04ce11475d67049cba8273741fb7',1,'durand_kerner_roots.c']]],
|
||||
['count_5fdivisors_329',['count_divisors',['../d7/d1f/problem__12_2sol1_8c.html#aa6ce6271f6156e219f9b290717f5a222',1,'sol1.c']]],
|
||||
['create_5fmatrix_330',['create_matrix',['../d7/d50/qr__eigen__values_8c.html#a7d96c5e4ae1bd6d29791bcc23a4cb2b0',1,'qr_eigen_values.c']]],
|
||||
['create_5fnode_331',['create_node',['../df/d3c/threaded__binary__trees_8c.html#ab21d1d36d95001defbca2f6abd4d410c',1,'threaded_binary_trees.c']]]
|
||||
['c_5fatoi_323',['c_atoi',['../d7/dd8/c__atoi__str__to__integer_8c.html#ad19049ebfc2088bc1e75e7e958f7b60f',1,'c_atoi_str_to_integer.c']]],
|
||||
['check_5ftermination_324',['check_termination',['../da/d38/durand__kerner__roots_8c.html#a26d5695ebed0818a3e7cf4b10aacab52',1,'durand_kerner_roots.c']]],
|
||||
['collatz_325',['collatz',['../d4/dea/problem__14_2sol1_8c.html#a81c1df5c17cb16bcc16e346fcff6fa80',1,'sol1.c']]],
|
||||
['compare_326',['compare',['../d1/df9/problem__26_2sol1_8c.html#ac70138609ef6aa6fabca57aca8681e83',1,'sol1.c']]],
|
||||
['complex_5fstr_327',['complex_str',['../da/d38/durand__kerner__roots_8c.html#afa5b04ce11475d67049cba8273741fb7',1,'durand_kerner_roots.c']]],
|
||||
['count_5fdivisors_328',['count_divisors',['../d7/d1f/problem__12_2sol1_8c.html#aa6ce6271f6156e219f9b290717f5a222',1,'sol1.c']]],
|
||||
['create_5fmatrix_329',['create_matrix',['../d7/d50/qr__eigen__values_8c.html#a7d96c5e4ae1bd6d29791bcc23a4cb2b0',1,'qr_eigen_values.c']]],
|
||||
['create_5fnode_330',['create_node',['../df/d3c/threaded__binary__trees_8c.html#ab21d1d36d95001defbca2f6abd4d410c',1,'threaded_binary_trees.c']]]
|
||||
];
|
||||
|
||||
@ -1,8 +1,8 @@
|
||||
var searchData=
|
||||
[
|
||||
['d_5ffunc_332',['d_func',['../dd/d08/newton__raphson__root_8c.html#ae713a1fd0c275fbec7edf263ac2c0337',1,'newton_raphson_root.c']]],
|
||||
['delete_5fadaline_333',['delete_adaline',['../da/d2a/group__adaline.html#ga6f35caa3084772cc126ac7b20f67f665',1,'adaline_learning.c']]],
|
||||
['delete_5fbt_334',['delete_bt',['../df/d3c/threaded__binary__trees_8c.html#a284d683f74b6c884e79ba00d3d1c3317',1,'threaded_binary_trees.c']]],
|
||||
['delete_5fnumber_335',['delete_number',['../d6/d3d/factorial__large__number_8c.html#ab5c854e0df76165c31899e69eceeeaae',1,'factorial_large_number.c']]],
|
||||
['display_336',['display',['../dc/d2e/lu__decompose_8c.html#a0789beb8d3396582d77b7aedf5e5554a',1,'display(double **A, int N): lu_decompose.c'],['../d5/d4c/group__sorting.html#gad7ed8cc4603f500d610054680d28b971',1,'display(const int *arr, int n): bead_sort.c']]]
|
||||
['d_5ffunc_331',['d_func',['../dd/d08/newton__raphson__root_8c.html#ae713a1fd0c275fbec7edf263ac2c0337',1,'newton_raphson_root.c']]],
|
||||
['delete_5fadaline_332',['delete_adaline',['../da/d2a/group__adaline.html#ga6f35caa3084772cc126ac7b20f67f665',1,'adaline_learning.c']]],
|
||||
['delete_5fbt_333',['delete_bt',['../df/d3c/threaded__binary__trees_8c.html#a284d683f74b6c884e79ba00d3d1c3317',1,'threaded_binary_trees.c']]],
|
||||
['delete_5fnumber_334',['delete_number',['../d6/d3d/factorial__large__number_8c.html#ab5c854e0df76165c31899e69eceeeaae',1,'factorial_large_number.c']]],
|
||||
['display_335',['display',['../dc/d2e/lu__decompose_8c.html#a0789beb8d3396582d77b7aedf5e5554a',1,'display(double **A, int N): lu_decompose.c'],['../d5/d4c/group__sorting.html#gad7ed8cc4603f500d610054680d28b971',1,'display(const int *arr, int n): bead_sort.c']]]
|
||||
];
|
||||
|
||||
@ -1,5 +1,5 @@
|
||||
var searchData=
|
||||
[
|
||||
['eigen_5fvalues_337',['eigen_values',['../d7/d50/qr__eigen__values_8c.html#a0d8ed79786d17df48396b333c09d05bb',1,'qr_eigen_values.c']]],
|
||||
['exact_5fsolution_338',['exact_solution',['../d4/d07/ode__forward__euler_8c.html#a8caee977b26888d34040b122e0e28e3a',1,'exact_solution(const double *x, double *y): ode_forward_euler.c'],['../d1/dc2/ode__midpoint__euler_8c.html#a8caee977b26888d34040b122e0e28e3a',1,'exact_solution(const double *x, double *y): ode_midpoint_euler.c'],['../d4/d99/ode__semi__implicit__euler_8c.html#a8caee977b26888d34040b122e0e28e3a',1,'exact_solution(const double *x, double *y): ode_semi_implicit_euler.c']]]
|
||||
['eigen_5fvalues_336',['eigen_values',['../d7/d50/qr__eigen__values_8c.html#a0d8ed79786d17df48396b333c09d05bb',1,'qr_eigen_values.c']]],
|
||||
['exact_5fsolution_337',['exact_solution',['../d4/d07/ode__forward__euler_8c.html#a8caee977b26888d34040b122e0e28e3a',1,'exact_solution(const double *x, double *y): ode_forward_euler.c'],['../d1/dc2/ode__midpoint__euler_8c.html#a8caee977b26888d34040b122e0e28e3a',1,'exact_solution(const double *x, double *y): ode_midpoint_euler.c'],['../d4/d99/ode__semi__implicit__euler_8c.html#a8caee977b26888d34040b122e0e28e3a',1,'exact_solution(const double *x, double *y): ode_semi_implicit_euler.c']]]
|
||||
];
|
||||
|
||||
@ -1,9 +1,9 @@
|
||||
var searchData=
|
||||
[
|
||||
['fib_339',['fib',['../d4/d99/fibonacci__fast_8c.html#a7a3d55bd19854075cba2eed6b63cb2d3',1,'fibonacci_fast.c']]],
|
||||
['find_340',['find',['../df/df3/union__find_8c.html#a3e13b69cce5a1b25ae034798092f3d86',1,'union_find.c']]],
|
||||
['forward_5feuler_341',['forward_euler',['../d4/d07/ode__forward__euler_8c.html#aaf88ad8f9f7c39fc38f3f03d6fea9df9',1,'ode_forward_euler.c']]],
|
||||
['forward_5feuler_5fstep_342',['forward_euler_step',['../d4/d07/ode__forward__euler_8c.html#ae6c9413953c8d9d4bc9e374b29586350',1,'ode_forward_euler.c']]],
|
||||
['free_5fmemory_343',['free_memory',['../dc/d80/cantor__set_8c.html#a85df3c64a683100ac6246e1e034df43d',1,'cantor_set.c']]],
|
||||
['func_344',['func',['../dd/d08/newton__raphson__root_8c.html#a72f87d423a488946b319627a454d3925',1,'newton_raphson_root.c']]]
|
||||
['fib_338',['fib',['../d4/d99/fibonacci__fast_8c.html#a7a3d55bd19854075cba2eed6b63cb2d3',1,'fibonacci_fast.c']]],
|
||||
['find_339',['find',['../df/df3/union__find_8c.html#a3e13b69cce5a1b25ae034798092f3d86',1,'union_find.c']]],
|
||||
['forward_5feuler_340',['forward_euler',['../d4/d07/ode__forward__euler_8c.html#aaf88ad8f9f7c39fc38f3f03d6fea9df9',1,'ode_forward_euler.c']]],
|
||||
['forward_5feuler_5fstep_341',['forward_euler_step',['../d4/d07/ode__forward__euler_8c.html#ae6c9413953c8d9d4bc9e374b29586350',1,'ode_forward_euler.c']]],
|
||||
['free_5fmemory_342',['free_memory',['../dc/d80/cantor__set_8c.html#a85df3c64a683100ac6246e1e034df43d',1,'cantor_set.c']]],
|
||||
['func_343',['func',['../dd/d08/newton__raphson__root_8c.html#a72f87d423a488946b319627a454d3925',1,'newton_raphson_root.c']]]
|
||||
];
|
||||
|
||||
@ -1,15 +1,15 @@
|
||||
var searchData=
|
||||
[
|
||||
['gcd_345',['gcd',['../df/de7/problem__5_2sol_8c.html#a59347107cbfdf48d51108e50280e760d',1,'sol.c']]],
|
||||
['get_5fclock_5fdiff_346',['get_clock_diff',['../d2/df6/kohonen__som__topology_8c.html#a2256c10b16edba377b64a44b6c656908',1,'get_clock_diff(clock_t start_t, clock_t end_t): kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a2256c10b16edba377b64a44b6c656908',1,'get_clock_diff(clock_t start_t, clock_t end_t): kohonen_som_trace.c']]],
|
||||
['get_5fdigits_347',['get_digits',['../d8/d32/problem__25_2sol1_8c.html#a2b90df6bfbf0d18cd9a19c1a71453783',1,'sol1.c']]],
|
||||
['get_5fdivisors_348',['get_divisors',['../d4/d83/problem__401_2sol1_8c.html#a7380e14d595d560007b02ce516b6b215',1,'sol1.c']]],
|
||||
['get_5fmin_5f2d_349',['get_min_2d',['../d1/d6b/group__kohonen__2d.html#gadc22d512c00a9f5799ee067f4fb90b4b',1,'kohonen_som_topology.c']]],
|
||||
['get_5fmonth_5fdays_350',['get_month_days',['../dd/df0/problem__19_2sol1_8c.html#ab7f9ad087f124b8e0615aa535b4c8a75',1,'sol1.c']]],
|
||||
['get_5fnext_5fabundant_351',['get_next_abundant',['../d7/ddb/problem__23_2sol1_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf',1,'get_next_abundant(unsigned long N): sol1.c'],['../d4/dbd/problem__23_2sol2_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf',1,'get_next_abundant(unsigned long N): sol2.c']]],
|
||||
['get_5fnext_5funknown_352',['get_next_unknown',['../d5/df4/group__sudoku.html#ga62e94fc39f116e2c81daed8f5437431b',1,'sudoku_solver.c']]],
|
||||
['get_5fnumber_353',['get_number',['../db/d01/problem__13_2sol1_8c.html#ac260f58785fb20eb09bb35385a7d47f8',1,'sol1.c']]],
|
||||
['get_5fperfect_5fnumber_354',['get_perfect_number',['../d7/ddb/problem__23_2sol1_8c.html#a1aca7f530f82b27100262adba9e7556b',1,'get_perfect_number(unsigned long N): sol1.c'],['../d4/dbd/problem__23_2sol2_8c.html#a1aca7f530f82b27100262adba9e7556b',1,'get_perfect_number(unsigned long N): sol2.c']]],
|
||||
['get_5fproduct_355',['get_product',['../dc/d63/problem__8_2sol1_8c.html#a9ffc8845f17b01a353767a40a3adf7bd',1,'sol1.c']]],
|
||||
['get_5frand_356',['get_rand',['../d6/d2e/cartesian__to__polar_8c.html#a60e62b809ca9dcb1b20a140b30d30f60',1,'cartesian_to_polar.c']]]
|
||||
['gcd_344',['gcd',['../df/de7/problem__5_2sol_8c.html#a59347107cbfdf48d51108e50280e760d',1,'sol.c']]],
|
||||
['get_5fclock_5fdiff_345',['get_clock_diff',['../d2/df6/kohonen__som__topology_8c.html#a2256c10b16edba377b64a44b6c656908',1,'get_clock_diff(clock_t start_t, clock_t end_t): kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a2256c10b16edba377b64a44b6c656908',1,'get_clock_diff(clock_t start_t, clock_t end_t): kohonen_som_trace.c']]],
|
||||
['get_5fdigits_346',['get_digits',['../d8/d32/problem__25_2sol1_8c.html#a2b90df6bfbf0d18cd9a19c1a71453783',1,'sol1.c']]],
|
||||
['get_5fdivisors_347',['get_divisors',['../d4/d83/problem__401_2sol1_8c.html#a7380e14d595d560007b02ce516b6b215',1,'sol1.c']]],
|
||||
['get_5fmin_5f2d_348',['get_min_2d',['../d1/d6b/group__kohonen__2d.html#gadc22d512c00a9f5799ee067f4fb90b4b',1,'kohonen_som_topology.c']]],
|
||||
['get_5fmonth_5fdays_349',['get_month_days',['../dd/df0/problem__19_2sol1_8c.html#ab7f9ad087f124b8e0615aa535b4c8a75',1,'sol1.c']]],
|
||||
['get_5fnext_5fabundant_350',['get_next_abundant',['../d7/ddb/problem__23_2sol1_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf',1,'get_next_abundant(unsigned long N): sol1.c'],['../d4/dbd/problem__23_2sol2_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf',1,'get_next_abundant(unsigned long N): sol2.c']]],
|
||||
['get_5fnext_5funknown_351',['get_next_unknown',['../d5/df4/group__sudoku.html#ga62e94fc39f116e2c81daed8f5437431b',1,'sudoku_solver.c']]],
|
||||
['get_5fnumber_352',['get_number',['../db/d01/problem__13_2sol1_8c.html#ac260f58785fb20eb09bb35385a7d47f8',1,'sol1.c']]],
|
||||
['get_5fperfect_5fnumber_353',['get_perfect_number',['../d7/ddb/problem__23_2sol1_8c.html#a1aca7f530f82b27100262adba9e7556b',1,'get_perfect_number(unsigned long N): sol1.c'],['../d4/dbd/problem__23_2sol2_8c.html#a1aca7f530f82b27100262adba9e7556b',1,'get_perfect_number(unsigned long N): sol2.c']]],
|
||||
['get_5fproduct_354',['get_product',['../dc/d63/problem__8_2sol1_8c.html#a9ffc8845f17b01a353767a40a3adf7bd',1,'sol1.c']]],
|
||||
['get_5frand_355',['get_rand',['../d6/d2e/cartesian__to__polar_8c.html#a60e62b809ca9dcb1b20a140b30d30f60',1,'cartesian_to_polar.c']]]
|
||||
];
|
||||
|
||||
@ -1,13 +1,13 @@
|
||||
var searchData=
|
||||
[
|
||||
['inorder_5fdisplay_357',['inorder_display',['../df/d3c/threaded__binary__trees_8c.html#a4c1e06b5f0876ec9c1bd6817f3b7eda7',1,'threaded_binary_trees.c']]],
|
||||
['insert_5fbt_358',['insert_bt',['../df/d3c/threaded__binary__trees_8c.html#a823432888332fc9f0aa6072cff28c3bb',1,'threaded_binary_trees.c']]],
|
||||
['is_5fabundant_359',['is_abundant',['../d7/ddb/problem__23_2sol1_8c.html#a4f128410e6582fe26488e2316cc96e17',1,'is_abundant(unsigned long N): sol1.c'],['../d4/dbd/problem__23_2sol2_8c.html#a34f4ad85151e3a43368ae67f42347f56',1,'is_abundant(unsigned long N): sol2.c']]],
|
||||
['is_5fin_360',['is_in',['../d4/d83/problem__401_2sol1_8c.html#a4441a6d27134cf3aed05727800d99456',1,'sol1.c']]],
|
||||
['is_5fleap_5fyear_361',['is_leap_year',['../dd/df0/problem__19_2sol1_8c.html#a6561b1adc8a19c092679b9874da24e2e',1,'sol1.c']]],
|
||||
['is_5fpalindromic_362',['is_palindromic',['../d0/d6c/problem__4_2sol_8c.html#adf9bea8d35848959bde5b3f277edf0c4',1,'sol.c']]],
|
||||
['is_5fprime_363',['is_prime',['../d0/d6d/problem__10_2sol1_8c.html#acc871ab6bfead702e983a7f9c412915f',1,'sol1.c']]],
|
||||
['is_5fsum_5fof_5fabundant_364',['is_sum_of_abundant',['../d7/ddb/problem__23_2sol1_8c.html#a3ab61b5a1c4f2288625d160aa0ea8478',1,'is_sum_of_abundant(unsigned long N): sol1.c'],['../d4/dbd/problem__23_2sol2_8c.html#a3ab61b5a1c4f2288625d160aa0ea8478',1,'is_sum_of_abundant(unsigned long N): sol2.c']]],
|
||||
['ispalindrome_365',['isPalindrome',['../df/d16/palindrome_8c.html#a6320493ddee0ca4614423721c5d6f4ba',1,'palindrome.c']]],
|
||||
['isprime_366',['isprime',['../d7/dd3/problem__3_2sol1_8c.html#aa0f4796aa2e89c327f827bd55f5cb305',1,'sol1.c']]]
|
||||
['inorder_5fdisplay_356',['inorder_display',['../df/d3c/threaded__binary__trees_8c.html#a4c1e06b5f0876ec9c1bd6817f3b7eda7',1,'threaded_binary_trees.c']]],
|
||||
['insert_5fbt_357',['insert_bt',['../df/d3c/threaded__binary__trees_8c.html#a823432888332fc9f0aa6072cff28c3bb',1,'threaded_binary_trees.c']]],
|
||||
['is_5fabundant_358',['is_abundant',['../d7/ddb/problem__23_2sol1_8c.html#a4f128410e6582fe26488e2316cc96e17',1,'is_abundant(unsigned long N): sol1.c'],['../d4/dbd/problem__23_2sol2_8c.html#a34f4ad85151e3a43368ae67f42347f56',1,'is_abundant(unsigned long N): sol2.c']]],
|
||||
['is_5fin_359',['is_in',['../d4/d83/problem__401_2sol1_8c.html#a4441a6d27134cf3aed05727800d99456',1,'sol1.c']]],
|
||||
['is_5fleap_5fyear_360',['is_leap_year',['../dd/df0/problem__19_2sol1_8c.html#a6561b1adc8a19c092679b9874da24e2e',1,'sol1.c']]],
|
||||
['is_5fpalindromic_361',['is_palindromic',['../d0/d6c/problem__4_2sol_8c.html#adf9bea8d35848959bde5b3f277edf0c4',1,'sol.c']]],
|
||||
['is_5fprime_362',['is_prime',['../d0/d6d/problem__10_2sol1_8c.html#acc871ab6bfead702e983a7f9c412915f',1,'sol1.c']]],
|
||||
['is_5fsum_5fof_5fabundant_363',['is_sum_of_abundant',['../d7/ddb/problem__23_2sol1_8c.html#a3ab61b5a1c4f2288625d160aa0ea8478',1,'is_sum_of_abundant(unsigned long N): sol1.c'],['../d4/dbd/problem__23_2sol2_8c.html#a3ab61b5a1c4f2288625d160aa0ea8478',1,'is_sum_of_abundant(unsigned long N): sol2.c']]],
|
||||
['ispalindrome_364',['isPalindrome',['../df/d16/palindrome_8c.html#a6320493ddee0ca4614423721c5d6f4ba',1,'palindrome.c']]],
|
||||
['isprime_365',['isprime',['../d7/dd3/problem__3_2sol1_8c.html#aa0f4796aa2e89c327f827bd55f5cb305',1,'sol1.c']]]
|
||||
];
|
||||
|
||||
@ -1,5 +1,5 @@
|
||||
var searchData=
|
||||
[
|
||||
['join_367',['join',['../df/df3/union__find_8c.html#af2f3ff6d98641f7d3be11f071c97908a',1,'union_find.c']]],
|
||||
['jump_5fsearch_368',['jump_search',['../d6/d7b/jump__search_8c.html#aff36d719e6fca6aea4377a089580c603',1,'jump_search.c']]]
|
||||
['join_366',['join',['../df/df3/union__find_8c.html#af2f3ff6d98641f7d3be11f071c97908a',1,'union_find.c']]],
|
||||
['jump_5fsearch_367',['jump_search',['../d6/d7b/jump__search_8c.html#aff36d719e6fca6aea4377a089580c603',1,'jump_search.c']]]
|
||||
];
|
||||
|
||||
Some files were not shown because too many files have changed in this diff Show More
Loading…
Reference in New Issue
Block a user