/wsr/ - Worksafe Requests » Thread #228327

[5 / 1 / ?]

194KiB, 500x500, 1475596719848.png

View Same Google ImgOps iqdb SauceNAO

Recursive Functions

Anonymous Wed 30 Nov 2016 07:30:37 No.228327 View View Reply Original Report

Quoted By: >>228435 >>228436 >>228438

How do I write a recursive function pow(x,y) that uses recursion to find x^y.

Anonymous

Anonymous Wed 30 Nov 2016 16:43:19 No.228435 Report

Quoted By:

>>228327

You just call the function within itself.

function {

while( condition ) {

x=x*x
call function

}

}

You just repeat that cycle y times and you will have x*x*x*x*x*x*x y times and a lot of wasted resources.

Anonymous

Anonymous Wed 30 Nov 2016 16:51:27 No.228436 Report

Quoted By: >>228437 >>228438

>>228327

Just calling the function within itself.

count=1
desu=x

function() {

while( count <= y )

desu = desu*x
count++
call function

}

Anonymous

Anonymous Wed 30 Nov 2016 16:53:07 No.228437 Report

Quoted By:

>>228436

Except that

>count <= y

doesn't need the =.

Anonymous

Anonymous Wed 30 Nov 2016 16:59:54 No.228438 Report

Quoted By:

>>228327
pow(x,y){
if (y==1){return x;}
else {return x*pow(x,y-1);}
}

>>228436
It says "recursive function". While loops are looping, not recursion.

Capcode	All Only User Posts Only Verified Posts Only Moderator Posts Only Manager Posts Only Admin Posts Only Developer Posts Only Founder Posts
Show Posts	All Only With Images Only Without Images Only Spoiler Images Only Non-Spoiler Images
Deleted Posts	All Only Deleted Posts Only Non-Deleted Posts
Ghost Posts	All Only Ghost Posts Only Non-Ghost Posts
Post Type	All Only Sticky Threads Only Opening Posts Only Reply Posts
Results	All Grouped By Threads
Order	Latest Posts First Oldest Posts First

On these archives

Your latest searches

Recursive Functions