Exponential algorithms are generally considered intractable

Linear search requires a number of steps proportional to the size of the list being searched.

The Python operator in performs a binary search.

Binary search is an n log n algorithm.

The number of times n can be divided by 2 is exp( n).

All proper recursive definitions must have exactly one non-recursive base case.

A sequence can be viewed as a recursive data collection.

A word of length n has n! anagrams.

Loops are more general than recursion.

Merge sort is an example of an n log n algorithm

Exponential algorithms are generally considered intractable.

Write a program that solves word jumble problems. You will need a large dictionary of English words (see previous problem). The user types in a scrambled word, and your program generates all anagrams of the word and then checks which (if any) are in the dictionary. The anagrams appearing in the dictionary are printed as solutions to the puzzle.