function( c y)
int x = 4
int y= 5
if z = x return g
if(m = j) return f
for(.....){
i = p
sol<- function( p q)
q = 5
}
return x
All the variables and names i used here are random just to show how the C sudocode looks.
I dont know how to implement this correctly. there is no return in scheme so this recursive call is correctly excuted.
can someone show me how to do this? I am working on AI project and my issue is scheme and not the algo! Due in 1h. thank you

New Topic/Question
Reply



MultiQuote




|