I feel sorry to ask, but is the function I have written recursive??
820250
As you wrote, a recursive function is a function that calls itself.\n\nSo, your palindrome function is recursive in that the palindrome function calls itself - it calls the palidrome function -- within the function.\n\nThis is the line that makes it recursive:\n\nelse\n{\nfirst++;\nlistsize--;\npalindrome(word, listsize, first);  <= THAT'S IT\n}\n}\n\n\nI add the lines around it so you can tell what i was talking about - but the line that calls the palindrome function is what makes it recursive, since it's called within the palindrome function.\n\nHope that helps you understand it better.
1083120
Analyze the soln and see whether it admits of recursion. That is a sure sign that it can be broken down into an iterative form.
534848
I remember coming across such a question one time, but I think it talked of converting a tree (and not a forest) into a linear list.\n\nI suggest you do the following: \n- Iterate through the forest, 1 tree at a time\n- for each tree, do an inorder traversal to generate a linear list (*)\n- join the linear lists to get the complete linear list\n\n(*) I guess this point needs more clarification\nWhat I am suggesting is this\n.      ROOT\n.       //   &#92;&#92;\n.   LEFT   RIGHT\nAssume this to be a trivial doubly linked tree\nAn inorder traversal can convert this into this structure\nLEFT=ROOT=RIGHT which is a doubly linked list really.\n\nI am not sure how to extend this to trees with more than 2 children, but I hope this helps!
388704
it cannot be f(x) = a for all x, unless a=0; otherwise you would be pretending that a = a+a with a non-0 !! This doesn't happen in R.
513609
Well I can't tell u how to do it b/c that would be wrong. But yes. You have to use IndexOf, IsNumeric, substring, and focus. So yes u are the right track. Contact me at free_best_jack@yahoo.com if you have any more questions.
853022
It should be a function because one x input value gives only one y output value. Try the vertical-line test. But the function does not have an inverse though.
696961
It's hard to read your code, but it looks fairly correct, at least in the way it accesses the array.  I don't see a count() method, though. Also, you have = instead of == in your if() conditional. I don't think you want that.
887573
what do you mean by parent function, can you clarify???????
1040045
Recursion Requirements are :\nThe Recursive equation : An=An-1 + An-2\nThe Terminating Conditions : Ao=0 , A1 = 1 ..
532980
I'm sorry but did you see this in My_Computer properties?\n\n\n\n--- ► λ ◄ \n\nN.B. I'm still a learner.
147840
functions are kind of like writing programs (in a way) and macros are like fill in the blank programs (in a way)
150385
f(x)=Int(f'(y), 0, x)-f(0) => yes, they're opposite operation, but if x has a given value, e.g. x=2, 3...no, they're not, b/c in that case, the RHS of the previous egality is a real number, not a function
344099
class tree {\npublic:\n int countNodes(){\n    if (root == NULL) { return 0; }\n    return this.countNodes(root);\n }\nprivate:\n int countNodes(Node in){\n    if (in == NULL){ return 0; }\n    else { return countNodes(root->leftSubtree) + countNodes(root->rightSubtree) + 1; }\n }\nNode* root;\n};
61382
oh crap i know this one    hang on     think think   an algorithm is a repeated process like converting binary to decimal and back.  but i can't think of one for finding the union sorry
345978
/* Here's the entire code [including the main() function]. I have written a generic reverse function which can be used anywhere. */\n\n#include <stdio.h>\n\nvoid reverse ( char str[] )\n{\n        char *ptr = str;\n        int arrLength = strlen( str );\n        int i;\n        char temp[arrLength];\n\n        for ( i = (arrLength-1); i >= 0; i-- )\n        {\n                temp[i] = *ptr++;\n        }\n\n        ptr = str;\n\n        for( i = 0; i < arrLength; i++ )\n        {\n                *ptr++ = temp[i];\n        }\n\n\n}\n\nint main()\n{\n        char str[] = "This will be reversed";\n        reverse( str );\n        printf( "%s", str);\n\n}
213586
Lazy gal!!!calculate it once more..
242099
Choose(n-k+1,k), n = 20, k = 5;\nlet f be the function f(n,k) -- same definition\n\nfor a set S of size n, u can either choose the largest or not.  If you choose the largest (ie n), then you can't have n-1.\n\nIf you dont you still have k left.\n\nHence the recursion is f(n,k) = f(n-2, k-1) + f(n-1, k).  Figure out the base cases, prove using induction.