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

Question

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

Angle · Answer

attachment

Angle · Answer

source: https://www.sparknotes.com/cs/recursion/whatisrecursion/section1/

kekeman · Answer

Ok so its either A, C, or D

minustempo · Answer

No C doesn't use recursion because you're just traversing a list.

minustempo · Answer

stack overflow says you use recursion in anagrams by picking each letter from the string, moving it to the front, and the doing the anagram of the rest of the letters.
searching for a word by cutting the list in half is one of the classic examples of recursion: binary search

kekeman · Answer

Ok so D.)?

kekeman · Answer

@minustempo wrote:

stack overflow says you use recursion in anagrams by picking each letter from the string, moving it to the front, and the doing the anagram of the rest of the letters. searching for a word by cutting the list in half is one of the classic examples of recursion: binary search

@angle wrote:

So D.)???????

kekeman · Answer

@minustempo wrote:

stack overflow says you use recursion in anagrams by picking each letter from the string, moving it to the front, and the doing the anagram of the rest of the letters. searching for a word by cutting the list in half is one of the classic examples of recursion: binary search

So D.)??

Angle · Answer

yes, D is correct

1 attachment