I am new to programming. I am trying to use recursion and if-else statement only to print the 99 beers lyrics. Here is my code. How can I make it better to print the lyrics well. The method countdown prints the lyrics while countdownB should print th

I'm trying to convert this loop to a recursive method. This iterative version works: (recursive attempt comes after that) public static int subCompareTwoCol(JobS j1, int index1, int index2, int indexTab1){ //Almost same method as above but with modif

I'm trying to implement Binary Search tree in python using recursion. I got trapped in some infinite recursions happening in my program.I'm making recursive calls to the function RecursBST by passing address and the data until the top traverse down t

I was using the below given method to calculate height of a binary tree, int height(Node root) { if (root == null) return 0; else { int lheight = height(root.left); int rheight = height(root.right); if (lheight > rheight) return(lheight+1); else retu

I'm new to racket and trying to write a function that checks if a list is in strictly ascending order. '( 1 2 3) would return true '(1 1 2) would return false (repeats) '(3 2 4) would return false My code so far is: Image of code (define (ascending?

I've been struggling with this question for a lot now. Could someone please explain the logic behind the program by using the simplest way possible possibly recursion? Thank you.Have 2 variables (say x and y) Move through the list of numbers Keep lar

I am trying to convert this recursive function into a tail recursive function def sumOfFractions(n: Int): Double = { require(n > 0, "Parameter n has to be greater than 0"); if (n==1) 1.0 else 1.0 / n + sumOfFractions(n - 1) } I thought that t

I'm trying to use recursion to loop through the String array and input a "-" between repeating characters. Ex: "hello" would output to "hel-lo" This is my code so far: Main Class: public class L6C13PairStar { /** * @param arg

I have read an article from here about how to detect cycle in a directed graph. The basic concept of this algorithm is if a node is found in recursive stack then there is a cycle, but i don't understand why. what is the logic here? #include<iostream>

I need to write a function nested_sum(L) that will sum all the ints inside a list no matter if they are inside another list. This with calling recrusively to another function mult2(n). Example: >>> nestedSum(mult2( [1,['a',3,'b',2],[4,['h',8,[10]

I'm getting a JSON structure from an API, that I want to change in my front end. The frontend adds a property to the JSON structure, "isHidden". When I send the modified JSON back, I don't want the object that has "isHidden" to be sent

I have a small problem I want to build a function that returns with recursive function the nn expression with one parameter in the calling function. Can someone help me? My thought so far : int powerThroughRecursion(int n) { if (n == 0) { return 1; }

I got a string like 1(8()3(6()7())9()3())2(4())3()1(0()3()) which is representing a tree. A bracket appears, if we go one level deeper. Numbers on the same level are neighbours. Now want to add nodes, for example I want to add a 5 to every path where

For the next array, the keys of each sub-array indicates the node-id (0) and category name (1) . What i am trying to do is to find the parent node-id for each sub-category. For example, the parent id for '3968976031' is '10176091' and the parent id f

I have the following 2 tables: CREATE TABLE [Names] ( [Id] INT PRIMARY KEY, [Name] VARCHAR(100) ) CREATE TABLE [Relationships] ( [Parent] [int] REFERENCES [Names]([Id]), [Child] [int] REFERENCES [Names]([Id]) ) Sample Data: INSERT [NAMES] VALUES (1,'

I am writing a recursive method that, instead of carrying out a binary search algorithm, splits an array into three and uses a trinary search algorithm. I am fairly positive that my recursive case is correct, yet there seems to be a problem with my b

I got two prepared classes, one for 'List'(linked list) and one for 'ListNode', and they asked my (for homework) to create a recursive 'showRev' methods for the 'List' class that uses another 'showRev' method of ListNode class... What this method sho

Below is my code. I tried to print the Fibonacci recursive function [at the very end] but it gave me segment fault. What is wrong with my code? I spent like 3 hours on this and couldn't figure it out. Can someone please be kind enough to give me some

I am creating a new class in UserList, and trying to override the add, append, and extend methods so that duplicate values will not be added to the list by any of these operations. So far I have started with trying to override the append method and w

Hey guys I'm just practicing recursive code on a binary search tree. I'm getting a seg fault but I'm not sure where the problem is (probably something stupid staring me right in the face). I have other functions that are working fine like counting th

How can I refactor the following code: class ModifyTree{ public void doActionsOnTree(Tree tree) { rAction1(tree.getRoot()); rAction2(tree.getRoot()); } private void action1(Node node) { // do something with node; } private void action2 (Node node) {

I'm trying to find and fix what is wrong with this code. It's a binary search implemented by recursion. I dont know why it's returning stack overflow and crashing. bool find( const int x, const int* pBegin, const int* pEnd) { int medel = (*pBegin +((

Let's say I have: def recursive(data): for i in data: if condition: recursive(HERE IS THE ISSUE) How do I pass in the data from the current i to the final element in the list?Check out enumerate this will also return the current loop index which you

I have a table (see image) Employees (manager is manager of another and so on) with id, parentid, salary, totalsalary. The last one needs to be updated so that every employee had Sum of its Descendants salary. I have already written script, which get

Today in the class of Java the professor came up with this example but I really couldn't understand very well the process how to go through this method in order to get the result = 4. Could any body please put some lines as clear as possible how is t

I want to flatten a hierarchy of objects with an open Generic T. This link Recursive List Flattening shows how to do that taking a passed IEnumerable. But I want to flatten a passed object T and its property Children in a generic and recursively way.

I need to generate all the combinations with length k from a list of length n, and I must do it using recursion. For Example: INPUT: choose_sets([1,2,3,4],3) OUTPUT: [[1,2,3],[1,2,4],[1,3,4],[2,3,4]] INPUT: choose_sets([1,2,3,4],2) OUTPUT: [[1,2],[1,

My problem is difficult to explain. I want to create a function that contains nested for loops, the amount of which is proportional to an argument passed to the function. Here's a hypothetical example: Function(2) ...would involve... for x in range (

I am having trouble with recursion. Can anyone show me how to get this into code form? given vector <int> with values 1,2,3,4,5,.. i want to write a function that compares all of the value with each other. i dont care about 1 != 2 being equivalent t

So I have spent many sleepless nights the last two weeks trying to work on what I thought would be a simple program: I am trying to create a Binary Tree from a list of integers in a specific file. The numbers are inserted into a binary tree. I then p