Ask your own question, for FREE!
Computer Science 12 Online
kekeman:

Select the programming task that requires recursion. Creating a list of all of the anagrams of a word Reversing the order of words in a list Searching for a word in a list by comparing all words in the list from first to last Searching for a word in a list by repeatedly splitting it into smaller, equally sized lists

lea0728:

@lazorwolf64

SmokeyBrown:

Just like the question from yesterday, the task that would make best use of recursion is the one that involves breaking a single big problem into many smaller problems

kekeman:

Ok so with saying this it maybe would be " Searching for a word in a list by repeatedly splitting it into smaller, equally sized lists" which is D.) Because we are splitting it to make it smaller

SmokeyBrown:

Yeah nice, that's the idea!

kekeman:

Yayyy thank you!

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!