More Simple Recursive Problems Most of these problems

More Simple Recursive Problems Most of these problems do not need recursion, but we will code them recursively so we can practice writing recursive code with simple problems. They start out easy and get progressively harder.

• Problem: You have array of integers. Write a recursive solution to find the sum of the integers.

• Problem: You have array of integers. Write a recursive solution to determine whether or not the array contains a specific value. The array is NOT sorted.

• Problem: You have array of integers. Write a recursive solution to determine whether or not the array contains a specific value. The array is sorted.

• Problem: You have array of integers. Write a recursive solution to count the number of occurrences of a specific value. The array is NOT sorted.

• Problem: You have array of integers. Write a recursive solution to determine whether or not two adjacent elements of the array add to 12.

• Problem: You have array of integers. Write a recursive solution to determine if the array is sorted.

License Plate numbers • You are given a 4 -digit number. For example, 1234. Now, you've got to make an equation out of it, by placing arithmetic operators and an equal -to sign in between the digits. 1=2+3 -4 1 -2=3 -4 -1+2+3=4 12=3*4 12/3=4 1^2+3=4 • Assume you have a function “eval” which will evaluate an equation (stored as a string) and return true or false. (Some languages do have this)

The Flood Fill Algorithm • We are working on a 2 D drawing package, and we want to make a bucket fill tool similar to that found in Microsoft Paint. The user selects a color, clicks on a point, and the color spreads to fill the area with this color. Have a look at this figure. • There is no easy non-recursive solution to this problem, but we can solve this recursively in just a few lines of code.

Reverse a number • Write the code to give the value of a number after it is reversed. So if you give it 146, it returns 641.

Many word games such as Scrabble® require the ability to rearrange a set of letters to form a word. Thus, if you wanted to write a Scrabble program, it would be useful to have a facility for generating all possible arrangements of a particular set of tiles. In word games, such arrangements are generally called anagrams. In mathematics, they are known as permutations. Let’s suppose you want to write a function list. Permutations(s) that displays all permutations of the string s. If you call List. Permutations("ABC") your program should display the six arrangements of "ABC", as follows • ABC • ACB • BAC • BCA • CBA • CAB