1 joe meehean. call themselves directly or indirectly void f(){... f();... } void g(){... h();......

42
Recursion 1 Joe Meehean

Upload: mercy-elliott

Post on 31-Dec-2015

218 views

Category:

Documents


0 download

TRANSCRIPT

CS242 Data Structures II

Recursion1Joe Meehean

Recursive Methodscall themselves directlyor indirectly

void f(){ ... f(); ...}void g(){ ... h(); ...}

void h(){ ... g(); ...}Recursive Method Exampleint factorial(int x){ int handback; if( x llovoid printStr(string s, int k){ if( k >= s.length() ) return; cout = s.length() ) return; cout = s.length() ) return; cout