wk3&&4(recursion)

 0    7 informačný list    up804653
stiahnuť mp3 vytlačiť hrať Skontrolujte sa
 
otázka English Odpoveď English
Define recursion?
začať sa učiť
Recursion is a technique whereby a problem is expressed in a similar form to the original problem but smaller in scope.
What are the two requirements of a recursive algorithm?
začať sa učiť
Solution is easy to specify for certain conditions – stopping case. Rules for proceeding to a new state which is either a stopping case or eventually leads to a stopping case – recursive steps
Explain Stopping case/base case
začať sa učiť
The known answer the smallest value that one that can be fed back in to the function
Explain the recursive step
začať sa učiť
All other cases that are not the base case that will cal back the function/method
When should you not use recursion?
začať sa učiť
if no to any of the following: the algorithm/data structure naturally suited to recursion? Is the recursive solution shorter and more understandable? Does the recursive solution run in acceptable time limits and/or space limits?
What is tail end recursion?
začať sa učiť
there is one recursive call in an algorithm and this call is the very last thing the done.
What is back tracking?
začať sa učiť
Backtracking is a systematic trial and error approach to finding the solution to a problem.

Pozrite si podobné kartičky:

wk5&&6 (LinkedLists)

Ak chcete pridať komentár, musíte byť prihlásený.