We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent adccfdf commit 8657a16Copy full SHA for 8657a16
math/n_bonacci.cpp
@@ -11,7 +11,7 @@
11
* In this code we take N and M as input where M is the number of terms
12
* to be printed of the N-bonacci series
13
*
14
- * @author [Swastika Gupta](https://github.com/swastyy)
+ * @author [Swastika Gupta](https://github.com/Swastyy)
15
*/
16
#include <algorithm> /// for std::is_equal, std::swap
17
#include <cassert> /// for assert
@@ -95,4 +95,4 @@ static void test() {
95
int main() {
96
test(); // run self-test implementations
97
return 0;
98
-}
+}
0 commit comments