Choosing different methods from switch statement

Question

I've written 3 different methods that solve the same problem (a Fibonacci sequence) and want to combine them. So, first user inputs the n as number of Fibonacci numbers, and then chooses m as either 1-recursion, 2-iteration, or, 3-constant.
int m = ... //user input
int[] method = new int[11]; // array holding for 0<=n<=10
if (m>=1 && m<=3) {
    switch(m) {
     case 1: method[m] = recursion(n);
                         break;
     case 2: method[m] = iteration(n);
                         break;
     case 3: method[m] = constant(n);
                         break;               
for (int i=0; i <= n; i++) {
     System.out.print(":");
     for (int j=1; j <= method[m]; j++) { // how to put "i" into chosen method's parameter ("n")
          System.out.print("*");
     System.out.println();
     Edited by: courteous on Nov 9, 2008 2:35 AM

Answer 1

I've written 3 different methods that solve the same problem (a Tribonacci sequence: 0,1,1,2,4,7,13,24,44,... sum of previous three numbers) and want to combine them. So, first user inputs the n as number of Tribonacci numbers, and then chooses m as either 1-recursion, 2-iteration, or, 3-constant.
Either of these three methods outputs ":" and then the number of "*" that represent the Trib. number. For example:
:                     //Tribonacci(0)=0
:*                     //Tribonacci(1)=1       
:*                     //Tribonacci(2)=1
:**                     //Tribonacci(3)=2
:****                     //Tribonacci(4)=4
:*******                     //Tribonacci(5)=7
:************                     //Tribonacci(6)=13Here is the relevant part of code:
int n = ... //user input
int m = ... //user input
int[] method = new int[11]; // array holding for 0<=n<=10
if (m>=1 && m<=3) {
    switch(m) {
     case 1: method[m] = recursion(n);
                         break;
     case 2: method[m] = iteration(n);
                         break;
     case 3: method[m] = constant(n);
                         break;               
for (int i=0; i <= n; i++) {
     System.out.print(":");
     for (int j=1; j <= ??? ; j++) { // how to put "i" into chosen method's parameter ("n")
          System.out.print("*");
     System.out.println();
     The problem is with the inner for loop, that I don't know how to formalize the condition part. If, instead of "???", you would write "method[m]",
for (int j=1; j <= method[m] ; j++) and the user input would be "n=2" (two Trib. numbers, starting with 0; thus, the outer for loop prints ":" three times) and "m=2" (method "2-iteration"), output would be:
:        //missing star (*)
How to write condition that would, while using chosen method, simultaneously insert "i" as (chosen) method's parameter. That would make the condition for (int j=1; j <= ??? ; j++) increasing, and producing the right amount of stars (*)?
/* Sorry, for lengthy post, but I must make it as clear as possible*/
Peter, method would just invoke non-existing methods (there is only one full, either method[1] (recursion), or method[2] (iteration), or method[3] (constant)), so this won't work (I guess).