Initialize array in one line / in a single statement
-
You know, your teacher is likely just wanting a recursive method[^].
I suggest you try Fibonacci(100) in a recursive way; you can walk around the world while it computes. Unless you go for a more advanced equation, one that calculates Fib(2x) from Fib(x). :)
Luc Pattyn [Forum Guidelines] [Why QA sucks] [My Articles] Nil Volentibus Arduum
Please use < PRE > tags for code snippets, it preserves indentation, and improves readability.
-
I suggest you try Fibonacci(100) in a recursive way; you can walk around the world while it computes. Unless you go for a more advanced equation, one that calculates Fib(2x) from Fib(x). :)
Luc Pattyn [Forum Guidelines] [Why QA sucks] [My Articles] Nil Volentibus Arduum
Please use < PRE > tags for code snippets, it preserves indentation, and improves readability.
Oh, I'm not suggesting that it is a better solution what so ever. I'm just stating it sounds like a homework assignment for creating a recursive Fibonacci implementation. ;P
-
I suggest you try Fibonacci(100) in a recursive way; you can walk around the world while it computes. Unless you go for a more advanced equation, one that calculates Fib(2x) from Fib(x). :)
Luc Pattyn [Forum Guidelines] [Why QA sucks] [My Articles] Nil Volentibus Arduum
Please use < PRE > tags for code snippets, it preserves indentation, and improves readability.
I am not an algorithms expert so mine may be wrong and I did cheat for base case but my recursive Fib algorithm is instant. I won't post because it may be the OP's homework but Fib is not hard and does not require any deep recursion. My algorithm needs 98 levels to calculate the Fib numbers from 2 to 100. (Again, I cheated on the base)
Need custom software developed? I do custom programming based primarily on MS tools with an emphasis on C# development and consulting. A man said to the universe: "Sir I exist!" "However," replied the universe, "The fact has not created in me A sense of obligation." --Stephen Crane
-
I am not an algorithms expert so mine may be wrong and I did cheat for base case but my recursive Fib algorithm is instant. I won't post because it may be the OP's homework but Fib is not hard and does not require any deep recursion. My algorithm needs 98 levels to calculate the Fib numbers from 2 to 100. (Again, I cheated on the base)
Need custom software developed? I do custom programming based primarily on MS tools with an emphasis on C# development and consulting. A man said to the universe: "Sir I exist!" "However," replied the universe, "The fact has not created in me A sense of obligation." --Stephen Crane
yes, you can easily avoid the exponential behavior, however I have seen quite a few straightforward recursive implementations that don't. They are extremely good examples against the use of recursion for anything that is not recursive by its very nature (such as a hierarchical file system). :)
Luc Pattyn [Forum Guidelines] [Why QA sucks] [My Articles] Nil Volentibus Arduum
Please use < PRE > tags for code snippets, it preserves indentation, and improves readability.
-
Hi, I want to initialize a string array with "*". I want to know if I can avoid using a for loop to do the same. In the below example I have used a for loop. Can the same done in one line??? The following code will help me generate fibonacci series
public static int Fibonacci(int n)
{
int previous = -1;
int result = 1;
for (int i = 0; i <= n; ++i)
{
int sum = result + previous;
previous = result;
result = sum;
}// // declare an array of size 'result' // use a for loop and initialize each entry of array with a "\*" //}
NetQuestions wrote:
I want to initialize a string array with "*".
string[] a = new string[] { "*" } ; -
That was awesome Stephen. Thanks I never knew that an array can be instantiated with a new kewword. I have incorporated your suggestion in my application. I am now using "char[] str7 = new String('*', result).ToCharArray()" This should handle one part of my application. I have one more question. Is it possible to convert this array of characters to a string? something like reverse of what you showed me. regards, Netquestions
-
You know, your teacher is likely just wanting a recursive method[^].
the number of times the method keeps getting called increases exponentially
-
NetQuestions wrote:
I want to initialize a string array with "*".
string[] a = new string[] { "*" } ;I actually used the following statement
string str = new string('*', 10)
-
Oh, I'm not suggesting that it is a better solution what so ever. I'm just stating it sounds like a homework assignment for creating a recursive Fibonacci implementation. ;P
Hi, recursion is not always the way.
*
*
*
**
***
*****
********If I were to generate and display the following, you will observe that when n= 50, program hangs. the number of times recursive method gets called grows exponentially. In such a case a non recursive method is required. Regards, NetQuestions
-
I actually used the following statement
string str = new string('*', 10)
That doesn't meet the stated criteria.
-
Hi, recursion is not always the way.
*
*
*
**
***
*****
********If I were to generate and display the following, you will observe that when n= 50, program hangs. the number of times recursive method gets called grows exponentially. In such a case a non recursive method is required. Regards, NetQuestions
Indeed, I'm well aware of such. I was only basing my suggestion on the fact it seemed like a homework assignment to create a recursive method. :)