|
|
|
|
@@ -0,0 +1,337 @@
|
|
|
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
|
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
|
|
|
<head>
|
|
|
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
|
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
|
|
|
<meta name="generator" content="Doxygen 1.9.1"/>
|
|
|
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
|
|
|
<title>Algorithms_in_C++: math/n_bonacci.cpp File Reference</title>
|
|
|
|
|
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
|
|
|
|
|
<script type="text/javascript" src="../../jquery.js"></script>
|
|
|
|
|
<script type="text/javascript" src="../../dynsections.js"></script>
|
|
|
|
|
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
|
|
|
|
|
<script type="text/javascript" src="../../resize.js"></script>
|
|
|
|
|
<script type="text/javascript" src="../../navtreedata.js"></script>
|
|
|
|
|
<script type="text/javascript" src="../../navtree.js"></script>
|
|
|
|
|
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
|
|
|
|
|
<script type="text/javascript" src="../../search/searchdata.js"></script>
|
|
|
|
|
<script type="text/javascript" src="../../search/search.js"></script>
|
|
|
|
|
<script type="text/x-mathjax-config">
|
|
|
|
|
MathJax.Hub.Config({
|
|
|
|
|
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
|
|
|
|
|
jax: ["input/TeX","output/HTML-CSS"],
|
|
|
|
|
});
|
|
|
|
|
</script>
|
|
|
|
|
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
|
|
|
|
|
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
|
|
|
|
|
</head>
|
|
|
|
|
<body>
|
|
|
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
|
|
|
<div id="titlearea">
|
|
|
|
|
<table cellspacing="0" cellpadding="0">
|
|
|
|
|
<tbody>
|
|
|
|
|
<tr style="height: 56px;">
|
|
|
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
|
|
|
<div id="projectname">Algorithms_in_C++
|
|
|
|
|
 <span id="projectnumber">1.0.0</span>
|
|
|
|
|
</div>
|
|
|
|
|
<div id="projectbrief">Set of algorithms implemented in C++.</div>
|
|
|
|
|
</td>
|
|
|
|
|
</tr>
|
|
|
|
|
</tbody>
|
|
|
|
|
</table>
|
|
|
|
|
</div>
|
|
|
|
|
<!-- end header part -->
|
|
|
|
|
<!-- Generated by Doxygen 1.9.1 -->
|
|
|
|
|
<script type="text/javascript">
|
|
|
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
|
|
|
var searchBox = new SearchBox("searchBox", "../../search",false,'Search','.html');
|
|
|
|
|
/* @license-end */
|
|
|
|
|
</script>
|
|
|
|
|
<script type="text/javascript" src="../../menudata.js"></script>
|
|
|
|
|
<script type="text/javascript" src="../../menu.js"></script>
|
|
|
|
|
<script type="text/javascript">
|
|
|
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
|
|
|
$(function() {
|
|
|
|
|
initMenu('../../',true,false,'search.php','Search');
|
|
|
|
|
$(document).ready(function() { init_search(); });
|
|
|
|
|
});
|
|
|
|
|
/* @license-end */</script>
|
|
|
|
|
<div id="main-nav"></div>
|
|
|
|
|
</div><!-- top -->
|
|
|
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
|
|
|
<div id="nav-tree">
|
|
|
|
|
<div id="nav-tree-contents">
|
|
|
|
|
<div id="nav-sync" class="sync"></div>
|
|
|
|
|
</div>
|
|
|
|
|
</div>
|
|
|
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
|
|
|
class="ui-resizable-handle">
|
|
|
|
|
</div>
|
|
|
|
|
</div>
|
|
|
|
|
<script type="text/javascript">
|
|
|
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
|
|
|
$(document).ready(function(){initNavTree('db/d27/n__bonacci_8cpp.html','../../'); initResizable(); });
|
|
|
|
|
/* @license-end */
|
|
|
|
|
</script>
|
|
|
|
|
<div id="doc-content">
|
|
|
|
|
<!-- window showing the filter options -->
|
|
|
|
|
<div id="MSearchSelectWindow"
|
|
|
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
|
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
|
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
|
|
|
<div id="MSearchResultsWindow">
|
|
|
|
|
<iframe src="javascript:void(0)" frameborder="0"
|
|
|
|
|
name="MSearchResults" id="MSearchResults">
|
|
|
|
|
</iframe>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<div class="header">
|
|
|
|
|
<div class="summary">
|
|
|
|
|
<a href="#namespaces">Namespaces</a> |
|
|
|
|
|
<a href="#func-members">Functions</a> </div>
|
|
|
|
|
<div class="headertitle">
|
|
|
|
|
<div class="title">n_bonacci.cpp File Reference</div> </div>
|
|
|
|
|
</div><!--header-->
|
|
|
|
|
<div class="contents">
|
|
|
|
|
|
|
|
|
|
<p>Implementation of the <a href="http://oeis.org/wiki/N-bonacci_numbers">N-bonacci</a> series.
|
|
|
|
|
<a href="#details">More...</a></p>
|
|
|
|
|
<div class="textblock"><code>#include <algorithm></code><br />
|
|
|
|
|
<code>#include <cassert></code><br />
|
|
|
|
|
<code>#include <iostream></code><br />
|
|
|
|
|
<code>#include <vector></code><br />
|
|
|
|
|
</div><div class="textblock"><div class="dynheader">
|
|
|
|
|
Include dependency graph for n_bonacci.cpp:</div>
|
|
|
|
|
<div class="dyncontent">
|
|
|
|
|
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d95/n__bonacci_8cpp__incl.svg" width="359" height="112"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
|
|
|
|
</div>
|
|
|
|
|
</div>
|
|
|
|
|
</div><table class="memberdecls">
|
|
|
|
|
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="namespaces"></a>
|
|
|
|
|
Namespaces</h2></td></tr>
|
|
|
|
|
<tr class="memitem:dd/d47/namespacemath"><td class="memItemLeft" align="right" valign="top">  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
|
|
|
|
|
<tr class="memdesc:dd/d47/namespacemath"><td class="mdescLeft"> </td><td class="mdescRight">for IO operations <br /></td></tr>
|
|
|
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
|
|
|
<tr class="memitem:de/d36/namespacen__bonacci"><td class="memItemLeft" align="right" valign="top">  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../de/d36/namespacen__bonacci.html">n_bonacci</a></td></tr>
|
|
|
|
|
<tr class="memdesc:de/d36/namespacen__bonacci"><td class="mdescLeft"> </td><td class="mdescRight">Functions for the <a href="http://oeis.org/wiki/N-bonacci_numbers">N-bonacci</a> implementation. <br /></td></tr>
|
|
|
|
|
<tr class="separator:"><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:a767bc5427e0ebaf88ab5a7572a7d852e"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< uint64_t > </td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d27/n__bonacci_8cpp.html#a767bc5427e0ebaf88ab5a7572a7d852e">math::n_bonacci::N_bonacci</a> (const uint64_t &n, const uint64_t &m)</td></tr>
|
|
|
|
|
<tr class="memdesc:a767bc5427e0ebaf88ab5a7572a7d852e"><td class="mdescLeft"> </td><td class="mdescRight">Finds the N-Bonacci series for the <code>n</code> parameter value and <code>m</code> parameter terms. <a href="../../db/d27/n__bonacci_8cpp.html#a767bc5427e0ebaf88ab5a7572a7d852e">More...</a><br /></td></tr>
|
|
|
|
|
<tr class="separator:a767bc5427e0ebaf88ab5a7572a7d852e"><td class="memSeparator" colspan="2"> </td></tr>
|
|
|
|
|
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d27/n__bonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
|
|
|
|
|
<tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft"> </td><td class="mdescRight">Self-test implementations. <a href="../../db/d27/n__bonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">More...</a><br /></td></tr>
|
|
|
|
|
<tr class="separator:aa8dca7b867074164d5f45b0f3851269d"><td class="memSeparator" colspan="2"> </td></tr>
|
|
|
|
|
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d27/n__bonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
|
|
|
|
|
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft"> </td><td class="mdescRight">Main function. <a href="../../db/d27/n__bonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">More...</a><br /></td></tr>
|
|
|
|
|
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2"> </td></tr>
|
|
|
|
|
</table>
|
|
|
|
|
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
|
|
|
|
<div class="textblock"><p>Implementation of the <a href="http://oeis.org/wiki/N-bonacci_numbers">N-bonacci</a> series. </p>
|
|
|
|
|
<p>In general, in N-bonacci sequence, we generate sum of preceding N numbers from the next term.</p>
|
|
|
|
|
<p>For example, a 3-bonacci sequence is the following: 0, 0, 1, 1, 2, 4, 7, 13, 24, 44, 81 In this code we take N and M as input where M is the number of terms to be printed of the N-bonacci series</p>
|
|
|
|
|
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Swastyy">Swastika Gupta</a> </dd></dl>
|
|
|
|
|
</div><h2 class="groupheader">Function Documentation</h2>
|
|
|
|
|
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
|
|
|
|
|
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">◆ </a></span>main()</h2>
|
|
|
|
|
|
|
|
|
|
<div class="memitem">
|
|
|
|
|
<div class="memproto">
|
|
|
|
|
<table class="memname">
|
|
|
|
|
<tr>
|
|
|
|
|
<td class="memname">int main </td>
|
|
|
|
|
<td>(</td>
|
|
|
|
|
<td class="paramtype">void </td>
|
|
|
|
|
<td class="paramname"></td><td>)</td>
|
|
|
|
|
<td></td>
|
|
|
|
|
</tr>
|
|
|
|
|
</table>
|
|
|
|
|
</div><div class="memdoc">
|
|
|
|
|
|
|
|
|
|
<p>Main function. </p>
|
|
|
|
|
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
|
|
|
|
|
<div class="fragment"><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  {</div>
|
|
|
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <a class="code" href="../../db/d27/n__bonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
|
|
|
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="keywordflow">return</span> 0;</div>
|
|
|
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span> }</div>
|
|
|
|
|
<div class="ttc" id="an__bonacci_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../db/d27/n__bonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition:</b> n_bonacci.cpp:63</div></div>
|
|
|
|
|
</div><!-- fragment --><div class="dynheader">
|
|
|
|
|
Here is the call graph for this function:</div>
|
|
|
|
|
<div class="dyncontent">
|
|
|
|
|
<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d27/n__bonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="282" height="190"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
|
|
|
|
</div>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
</div>
|
|
|
|
|
</div>
|
|
|
|
|
<a id="a767bc5427e0ebaf88ab5a7572a7d852e"></a>
|
|
|
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a767bc5427e0ebaf88ab5a7572a7d852e">◆ </a></span>N_bonacci()</h2>
|
|
|
|
|
|
|
|
|
|
<div class="memitem">
|
|
|
|
|
<div class="memproto">
|
|
|
|
|
<table class="memname">
|
|
|
|
|
<tr>
|
|
|
|
|
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a><uint64_t> math::n_bonacci::N_bonacci </td>
|
|
|
|
|
<td>(</td>
|
|
|
|
|
<td class="paramtype">const uint64_t & </td>
|
|
|
|
|
<td class="paramname"><em>n</em>, </td>
|
|
|
|
|
</tr>
|
|
|
|
|
<tr>
|
|
|
|
|
<td class="paramkey"></td>
|
|
|
|
|
<td></td>
|
|
|
|
|
<td class="paramtype">const uint64_t & </td>
|
|
|
|
|
<td class="paramname"><em>m</em> </td>
|
|
|
|
|
</tr>
|
|
|
|
|
<tr>
|
|
|
|
|
<td></td>
|
|
|
|
|
<td>)</td>
|
|
|
|
|
<td></td><td></td>
|
|
|
|
|
</tr>
|
|
|
|
|
</table>
|
|
|
|
|
</div><div class="memdoc">
|
|
|
|
|
|
|
|
|
|
<p>Finds the N-Bonacci series for the <code>n</code> parameter value and <code>m</code> parameter terms. </p>
|
|
|
|
|
<dl class="params"><dt>Parameters</dt><dd>
|
|
|
|
|
<table class="params">
|
|
|
|
|
<tr><td class="paramname">n</td><td>is in the N-Bonacci series </td></tr>
|
|
|
|
|
<tr><td class="paramname">m</td><td>is the number of terms in the N-Bonacci sequence </td></tr>
|
|
|
|
|
</table>
|
|
|
|
|
</dd>
|
|
|
|
|
</dl>
|
|
|
|
|
<dl class="section return"><dt>Returns</dt><dd>the n-bonacci sequence as vector array </dd></dl>
|
|
|
|
|
<p>we initialise the (n-1)th term as 1 which is the sum of preceding N zeros</p>
|
|
|
|
|
<p>similarily the sum of preceding N zeros and the (N+1)th 1 is also 1</p>
|
|
|
|
|
<div class="fragment"><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>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint64_t></a> a(m, 0); <span class="comment">// we create an empty array of size m</span></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>  a[n - 1] = 1; <span class="comment">/// we initialise the (n-1)th term as 1 which is the sum of</span><span class="comment"></span></div>
|
|
|
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment"> /// preceding N zeros</span></div>
|
|
|
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="comment"></span> a[n] = 1; <span class="comment">/// similarily the sum of preceding N zeros and the (N+1)th 1 is</span><span class="comment"></span></div>
|
|
|
|
|
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="comment"> /// also 1</span></div>
|
|
|
|
|
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment"></span> <span class="keywordflow">for</span> (uint64_t i = n + 1; i < m; i++) {</div>
|
|
|
|
|
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="comment">// this is an optimized solution that works in O(M) time and takes O(M)</span></div>
|
|
|
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="comment">// extra space here we use the concept of the sliding window the current</span></div>
|
|
|
|
|
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="comment">// term can be computed using the given formula</span></div>
|
|
|
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  a[i] = 2 * a[i - 1] - a[i - 1 - n];</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> a;</div>
|
|
|
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span> }</div>
|
|
|
|
|
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector< uint64_t ></a></div></div>
|
|
|
|
|
</div><!-- fragment --><div class="dynheader">
|
|
|
|
|
Here is the call graph for this function:</div>
|
|
|
|
|
<div class="dyncontent">
|
|
|
|
|
<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d27/n__bonacci_8cpp_a767bc5427e0ebaf88ab5a7572a7d852e_cgraph.svg" width="148" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
|
|
|
|
</div>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
</div>
|
|
|
|
|
</div>
|
|
|
|
|
<a id="aa8dca7b867074164d5f45b0f3851269d"></a>
|
|
|
|
|
<h2 class="memtitle"><span class="permalink"><a href="#aa8dca7b867074164d5f45b0f3851269d">◆ </a></span>test()</h2>
|
|
|
|
|
|
|
|
|
|
<div class="memitem">
|
|
|
|
|
<div class="memproto">
|
|
|
|
|
<table class="mlabels">
|
|
|
|
|
<tr>
|
|
|
|
|
<td class="mlabels-left">
|
|
|
|
|
<table class="memname">
|
|
|
|
|
<tr>
|
|
|
|
|
<td class="memname">static void test </td>
|
|
|
|
|
<td>(</td>
|
|
|
|
|
<td class="paramname"></td><td>)</td>
|
|
|
|
|
<td></td>
|
|
|
|
|
</tr>
|
|
|
|
|
</table>
|
|
|
|
|
</td>
|
|
|
|
|
<td class="mlabels-right">
|
|
|
|
|
<span class="mlabels"><span class="mlabel">static</span></span> </td>
|
|
|
|
|
</tr>
|
|
|
|
|
</table>
|
|
|
|
|
</div><div class="memdoc">
|
|
|
|
|
|
|
|
|
|
<p>Self-test implementations. </p>
|
|
|
|
|
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
|
|
|
|
<div class="fragment"><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">// n = 1 m = 1 return [1, 1]</span></div>
|
|
|
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"1st test"</span>;</div>
|
|
|
|
|
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint64_t></a> arr1 = <a class="code" href="../../db/d27/n__bonacci_8cpp.html#a767bc5427e0ebaf88ab5a7572a7d852e">math::n_bonacci::N_bonacci</a>(</div>
|
|
|
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  1, 1); <span class="comment">// first input is the param n and second one is the param m for</span></div>
|
|
|
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <span class="comment">// N-bonacci func</span></div>
|
|
|
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint64_t></a> output_array1 = {</div>
|
|
|
|
|
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  1, 1}; <span class="comment">// It is the expected output series of length m</span></div>
|
|
|
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  assert(<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/equal.html">std::equal</a>(<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(arr1), <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(arr1),</div>
|
|
|
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(output_array1)));</div>
|
|
|
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"passed"</span> << <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</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">// n = 5 m = 15 return [0, 0, 0, 0, 1, 1, 2, 4, 8, 16, 31, 61, 120, 236,</span></div>
|
|
|
|
|
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="comment">// 464]</span></div>
|
|
|
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"2nd test"</span>;</div>
|
|
|
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint64_t></a> arr2 = <a class="code" href="../../db/d27/n__bonacci_8cpp.html#a767bc5427e0ebaf88ab5a7572a7d852e">math::n_bonacci::N_bonacci</a>(</div>
|
|
|
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  5, 15); <span class="comment">// first input is the param n and second one is the param m for</span></div>
|
|
|
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="comment">// N-bonacci func</span></div>
|
|
|
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint64_t></a> output_array2 = {</div>
|
|
|
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  0, 0, 0, 0, 1, 1, 2, 4,</div>
|
|
|
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  8, 16, 31, 61, 120, 236, 464}; <span class="comment">// It is the expected output series of</span></div>
|
|
|
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="comment">// length m</span></div>
|
|
|
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  assert(<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/equal.html">std::equal</a>(<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(arr2), <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(arr2),</div>
|
|
|
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(output_array2)));</div>
|
|
|
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"passed"</span> << <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
|
|
|
|
<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">// n = 6 m = 17 return [0, 0, 0, 0, 0, 1, 1, 2, 4, 8, 16, 32, 63, 125, 248,</span></div>
|
|
|
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="comment">// 492, 976]</span></div>
|
|
|
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"3rd test"</span>;</div>
|
|
|
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint64_t></a> arr3 = <a class="code" href="../../db/d27/n__bonacci_8cpp.html#a767bc5427e0ebaf88ab5a7572a7d852e">math::n_bonacci::N_bonacci</a>(</div>
|
|
|
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  6, 17); <span class="comment">// first input is the param n and second one is the param m for</span></div>
|
|
|
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="comment">// N-bonacci func</span></div>
|
|
|
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint64_t></a> output_array3 = {</div>
|
|
|
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  0, 0, 0, 0, 0, 1, 1, 2, 4,</div>
|
|
|
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  8, 16, 32, 63, 125, 248, 492, 976}; <span class="comment">// It is the expected output series</span></div>
|
|
|
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="comment">// of length m</span></div>
|
|
|
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  assert(<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/equal.html">std::equal</a>(<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(arr3), <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(arr3),</div>
|
|
|
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(output_array3)));</div>
|
|
|
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"passed"</span> << <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</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>  <span class="comment">// n = 56 m = 15 return [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]</span></div>
|
|
|
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"4th test"</span>;</div>
|
|
|
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint64_t></a> arr4 = <a class="code" href="../../db/d27/n__bonacci_8cpp.html#a767bc5427e0ebaf88ab5a7572a7d852e">math::n_bonacci::N_bonacci</a>(</div>
|
|
|
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  56, 15); <span class="comment">// first input is the param n and second one is the param m</span></div>
|
|
|
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="comment">// for N-bonacci func</span></div>
|
|
|
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint64_t></a> output_array4 = {</div>
|
|
|
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  0, 0, 0, 0, 0, 0, 0, 0,</div>
|
|
|
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  0, 0, 0, 0, 0, 0, 0}; <span class="comment">// It is the expected output series of length m</span></div>
|
|
|
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  assert(<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/equal.html">std::equal</a>(<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(arr4), <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(arr4),</div>
|
|
|
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(output_array4)));</div>
|
|
|
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"passed"</span> << <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
|
|
|
|
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span> }</div>
|
|
|
|
|
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
|
|
|
|
|
<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
|
|
|
|
|
<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a></div><div class="ttdeci">T end(T... args)</div></div>
|
|
|
|
|
<div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div>
|
|
|
|
|
<div class="ttc" id="aequal_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/equal.html">std::equal</a></div><div class="ttdeci">T equal(T... args)</div></div>
|
|
|
|
|
<div class="ttc" id="an__bonacci_8cpp_html_a767bc5427e0ebaf88ab5a7572a7d852e"><div class="ttname"><a href="../../db/d27/n__bonacci_8cpp.html#a767bc5427e0ebaf88ab5a7572a7d852e">math::n_bonacci::N_bonacci</a></div><div class="ttdeci">std::vector< uint64_t > N_bonacci(const uint64_t &n, const uint64_t &m)</div><div class="ttdoc">Finds the N-Bonacci series for the n parameter value and m parameter terms.</div><div class="ttdef"><b>Definition:</b> n_bonacci.cpp:41</div></div>
|
|
|
|
|
</div><!-- fragment --><div class="dynheader">
|
|
|
|
|
Here is the call graph for this function:</div>
|
|
|
|
|
<div class="dyncontent">
|
|
|
|
|
<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d27/n__bonacci_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="183" height="190"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
|
|
|
|
</div>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
</div>
|
|
|
|
|
</div>
|
|
|
|
|
</div><!-- contents -->
|
|
|
|
|
</div><!-- doc-content -->
|
|
|
|
|
<!-- start footer part -->
|
|
|
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
|
|
|
<ul>
|
|
|
|
|
<li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../db/d27/n__bonacci_8cpp.html">n_bonacci.cpp</a></li>
|
|
|
|
|
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.1 </li>
|
|
|
|
|
</ul>
|
|
|
|
|
</div>
|
|
|
|
|
</body>
|
|
|
|
|
</html>
|
github-actions
