1. Design an algorithm that lists all possible rearrangements of the symbols in a string of five distinct characters.
2. Design an algorithm that, given a list of names, finds the longest name in the list. Determine what your solution does if there are several “longest” names in the list. In particular, what would your algorithm do if all the names had the same length?
3. Design an algorithm that, given a list of five or more numbers, finds the five smallest and five largest numbers in the list without sorting the entire list.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here