DEV Community: Hariprasath

Recursion For Factorial Easyyyy

Hariprasath — Wed, 26 Mar 2025 05:16:01 +0000

b = 6
6 * 5 * 4 * 3 * 2 * 1

so we need to get the num less than before
so

function factorial(b){
    if(b === 0){
      return 1
    }
    else {
      b * factorial(b-1) 
}

6 * factorial(6-1){
if(5 === 0){return 1} // false
else {5 * factorial(5-1) //true
{if(4 === 0){return 1} // false
else {4*factorial(4-1) //true
{if(3 === 0){return 1} // false
else {3 * factorial(3-1) //true
{if(2 === 0){return 1} //false
else {2 * factorial(2-1) //true
{if(1 === 0){return 1} // false
else {1 * factorial(1 -1) //true
{if(0 === 0){return 1} //true
else {0 * factorial(0-1)} // false
}}}}}}}}}}}}

here the function dosent call in every return but after calling upto n === 0 it saves each function value and multiple from right to left

like factorial(0) = 1
factorial(1) * factorial(0) = 1 * 1
factorial(2) * factorial(1) = 2 * 1
factorial(3) * factorial(2) = 3 * 2
factorial(4) * factorial(3) = 4 * 6
factorial(5) * factorial(4) = 5 * 24
factorial(6) * factorial(5) = 6 * 120

it call the function after stacking in top order
the last called function is on top of stack

Bubble Sort Got Bible

Hariprasath — Mon, 24 Mar 2025 08:48:29 +0000

list = [3,1,2,4,2]

easiest sort algorithm ever seen

for i loop list {
    for j loop list - i {
       // i = 0
       // j = 0,1,2,3,4
       // this calculate the max value and push to last
       // eg [1,2,3,2,4]

       // second most 
       //i = 1
       // j = 0,1,2,3 // got max value so no use of last index
       // find second most
       // eg [1,2,2,3]
    }
}

Finally realized how reverse list work

Hariprasath — Mon, 24 Mar 2025 06:34:40 +0000

the core is prev pointer is storing the current

while(current){ next = current.next current.next = prev prev = current current = next }

let discuss the part

[0,1,2,3,4]

**prev = null current = {data:0,next:1} next = null**

saving current.next in next (later use)

current = {data:0,next:1}
current.next contains {data:1,next:2}
current.next = prev {null}

now current modified {data:0,next:1} to {data:0,next:null}

prev = current so prev is null to {data:0,next:null}

current = next // now next stores the {data:1,next:2}

// next iteration

current = {data:1,next:2}
next = current.next {data:2,next:3}

current.next = prev {data:0,next:null}

now current has {data:1,next:{data:0,next:null}}

prev = current
//{data:0,next:null} to {data:1,next:{data:0,next:null}}

current = next {data:2,next:3}

//third iteration

current = {data:2,next:3}
next = current.next {data:3,next:4}

current.next = prev {data:1,next:{data:0,next:null}}

current has {data:2,next:{data:1,next:{data:0,next:null}}

prev = current
{data:1,next:{data:0,next:null}} to {data:2,next:{data:1,next:{data:0,next:null}}

current = next

{data:3,next:4}

//fourth iteration

current = {data:3,next:4}
next = current.next {data:4,next:null}

current.next = prev {data:2,next:{data:1,next:{data:0,next:null}}

current has {data:3,next:{data:2,next:{data:1,next:{data:0,next:null}}}

prev = current
{data:2,next:{data:1,next:{data:0,next:null}} to {data:3,next:{data:2,next:{data:1,next:{data:0,next:null}}}

current = next

{data:4,next:null}

//last iteration

current = {data:4,next:null}
next = current.next {null}

current.next = prev {data:3,next:{data:2,next:{data:1,next:{data:0,next:null}}}

current become {data:4,next:{data:3,next:{data:2,next:{data:1,next:{data:0,next:null}}}}

prev = current

current = next

completed
happy great coding

Day

Hariprasath — Tue, 26 Nov 2024 11:25:23 +0000

Today, I made significant progress on my project by successfully creating a server application in Rust. This server is designed to handle HTTP requests with optimal performance and scalability. The development process was both challenging and rewarding, as I had to leverage multiple tools and technologies to bring the project to life