iI am trying to write a recursive code that can convert a number to any base system. for example, the interger 10 into binary would convert to 1010 so far i have this but i'm having "None" in between my output. Can anyone help me with my code? def convert(a,b): add = a%b if a<=1: return a else: print(base(a/...
<?php /* Sample: $results = XMLParser::load('<xml ....'); $results = XMLParser::load(VSCHEMAS.'/Users.edit.xml'); */ /** * Abstract XMLParser class. A non-instantiable class that uses SimpleXML to parse XML, based on a path or body passed into the load method * * @abstract */ abstract class X...
If not, is there a good counter example that shows an iterative algorithm for which there exists no recursive counterpart? If it is the case that all iterative algorithms can be expressed recursively, are there cases in which this is more difficult to do? Also, what role does the programming language play in all this? I can imagine tha...
I have an array similar to this: Array ( Array ( [ID] => 1 [parentcat_ID] => 0 ), Array ( [ID] => 2 [parentcat_ID] => 0 ), Array ( [ID] => 6 [parentcat_ID] => 1 ), Array ( [ID] => 7 [parentcat_ID] => 1 ), Array ( ...
I was making a function to convert all dates in an object to strings and when I used the following function I got a error in FF "too much recursion". (It also fails in IE and chrome) function datesToString(obj) { if (obj instanceof Object) { if (obj instanceof Date) { obj = "this part does not ma...
I wrote this quicksort function: (defun quicksort (lst) (if (null lst) nil (let ((div (car lst)) (tail (cdr lst))) (append (quicksort (remove-if-not (lambda (x) (< x div)) tail)) (list div) (quicksort (remove-if (lambda (x) (< x div)) tail)))))) but I can't rewrite...
I'm currently working on problems in Project Euler with JavaScript. For the most part I've been using for loops to iterate through the problems but wanted to use recursive functions. However, it seems that all of the JavaScript engines have limits to the amount of recursion they can handle. I compiled/installed SpiderMonkey to try and r...
Hello, So I am trying to use os.walk() to generate an XML representation of a directory structure. I seem to be getting a ton of duplicates. It properly places directories within each other and files in the right place for the first portion of the xml file; however, after it does it correctly it then continues traversing incorrectly. I a...
I'm writing a text tag parser and I'm currently using this recursive method to create tags of n words. Is there a way that it can be done non-recursively or at least be optimized? Assume that $this->dataArray could be a very large array. /** * A recursive function to add phrases to the tagTracker array * @param string $data * @param ...
(first time poster, long time visitor via Google) I'm trying to extract the contents of some square brackets, however i'm having a spot of bother. I've got it working for round brackets as seen below, but I can't see how it should be modified to work for square brackets. I would have thought replacing the round for square and vice versa...
I have a left recursive issue in my Antlr grammar. While I think I understand why there is a problem I am unable to think of a solution. The issue is with the last line for my datatype rule. I have included the entire grammar for you to see: grammar Test; options {output=AST;ASTLabelType=CommonTree;} tokens {FUNCTION; ATTRIBUTES; C...
I just want to know , is it possible to convert this recursive function to non recursive functions unsigned Parser::Not(unsigned eff) { if (eff == 0) return 1; if (eff == 1) return 0; Node rn(ri.get_key(eff)); rn.t_branch_id = Not(rn.t_branch_id); rn.f_branch_id = Not(rn.f_branch_id); return CodeRuleNode(rn); } ...
In my textbook, there is this example very similar this to reverse a line from an input file: void Reverse(ifstream &inFile, int level) { int myInput = inFile.get(); if (myInput != '\n' && myInput != EOF) // don't understand this, line 4 Reverse(inFile, level); if (myInput != EOF) cout.put(myInput); } What...
The background: I'm building a trie to represent a dictionary, using a minimal construction algorithm. The input list is 4.3M utf-8 strings, sorted lexicographically. The resulting graph is acyclic and has a maximum depth of 638 nodes. The first line of my script sets the recursion limit to 1100 via sys.setrecursionlimit(). The prob...
I need an extension method to traverse all Textboxes on my Silverlight page. Assume I always use a grid Layout, then I have: public static IEnumerable<UIElement> Traverse(this UIElementCollection source, Func<Grid, UIElementCollection> fnRecurse) { foreach (UIElement item in source) { yield return item; ...
Although it's true that some recursive-nameserver configurations are (sloppily) referred to as "caching", e.g., by RHEL/Fedora/CentOS, that's a really bad name for that function -- because caching is orthogonal to recursion. Theoretically, you could write a nameserver that does recursive service but doesn't cache ...
Hi there, Java newbie here looking for some help. Here is the code in question: public void generateCodeTable(Node tree, StringBuffer buf) { if (tree != null) { StringBuffer newSB = new StringBuffer(); newSB.append(buf); if (tree.key != '$') { System.out.print(tree.key + "(" + ...
I've implemented (finally) a few goals that will schedule a series of tasks according to a startBy startAfter and duration. The schedule goal however, accepts only the prescribed number of tasks. I'd like to extend the functionality of the schedule goal to accept a single list and iterate through that list while scheduling. unfortunatel...
In this code how does this work (java): /** Move A[A.length-1] to the first position, k, in A such that there * are no smaller elements after it, moving all elements * A[k .. A.length-2] over to A[k+1 .. A.length-1]. */ static void moveOver (int A[]) { moveOver (A, A.length-1); } /** Move A[U] to the first position, k<=U, in A such...
I need to create links between pairs of items and rows of item pairs: ItemA ItemB ---------------- 1 2 1 3 4 5 4 6 6 2 7 8 9 2 9 10 11 12 11 13 14 15 Matching on either side of a pair constitutes a link: Link A B --------------- 1 1 2 1 1 3 1 4 5 ...