Forem: Ayush Ranjan

What is this Algolia Developer Hub in search section?

Ayush Ranjan — Sat, 03 Jan 2026 20:02:49 +0000

Does it better search engine then any other?
I am using react native app with wordpress api...

How possibility to create a curd website?

Ayush Ranjan — Thu, 08 Sep 2022 15:14:31 +0000

I am just overwhelmed, I wanna create some project that can work as curd app ppl can edit delete who created that event, is there any resources than share with me, I need help with it

Recursion and PMI

Ayush Ranjan — Tue, 18 Jan 2022 10:31:11 +0000

PMI (principal of mathematical induction).
we will solve recursion problem to think in sense of PMI only

we don't have to think entirely just think some of step

steps:

prove f(0) or f(1) is true (base case)
Induction Hypothesis: assume that f(k) is true
Induction step: using 2 prove that f(k + 1) is true

for example

#include <iostream>
using namespace std;

int factorial(int n) {
    cout << n << endl;
    if (n == 0) { // we taking base case in which it's run perfectly
        return 1;
    }
    int smallOutput = factorial(n - 1); // according to PMI we assume the small run than it will also run
    return n * smallOutput;
}

int main() {
    int n;
    cin >> n;
    int output = factorial(n);
    cout << output << endl;
}

example 2: with two base case

int fib(int n){
    if(n == 0){
        return 0;
    }
    if(n == 1){
        return 1;
    }
    int smallOutput1 = fib(n - 1);
    int smallOutput2 = fib(n - 2);
    return smallOutput1 + smallOutput2;
}

for more details: click here

Recursion in c++

Ayush Ranjan — Tue, 18 Jan 2022 10:02:35 +0000

#include <iostream>
using namespace std;

int factorial(int n) {
    cout << n << endl;
    if (n == 0) {
        return 1;
    }
    int smallOutput = factorial(n - 1);
    return n * smallOutput;
}

int main() {
    int n;
    cin >> n;
    int output = factorial(n);
    cout << output << endl;
}

let's break down the code.

In this code we are goin code factorial, first of fall we are taking int value after that in the next step we are printing initial value and in next step we are taking n == 0 and returning the 1, because if we don't than when the value of n = 0 and it's return 0 than we will not get the correct output what we want as well in next step as we saw there we again calling factorial that all goin to again run it from start until value become zero after n will become zero the function will go further next step and it's multiply to n one by one like :

fact(1) n = 1, n * 1
than fact(2) n = 2, n * 1 * 2
.
.
so on,
after getting value from them the they will be out of memory

where can be best option to start with blog ?

Ayush Ranjan — Thu, 26 Aug 2021 15:51:46 +0000

I have a two option hashnode and blogger if there is any option then comment below I would appreciate your response