Recursion is the act of a function calling itself. Under the hood function calls are pushed to the stack of the system and when a function finishes execution, it will be popped from the stack. A stack is a data structure which stores items and has the following operations: push: puts an item to the … Read more
First find the smallest number. So for 3 2 5 5 it would be 2. Make sure you store this. Thus, the numbers to sum are 3, 5 and 5 To get the total sum you need to add all the numbers together so: 3 + 2 + 5 + 5 = 15 And then … Read more
boolean isPalindrome(String input) { for (int i=0; i < input.length() / 2; ++i) { if (input.charAt(i) != input.charAt(input.length() – i – 1)) { return false; } } return true; } This solution is self explanatory, the only edge case requiring explanation is what happens for words with an odd number of letters. For an input … Read more
you can call a void method like any other method, except that you don’t have to do anything with the return value because there isn’t one. case 2: listBasket(basket); break; for your third case, you have to pass in both a double and an ArrayList if you want to pass 0 as your double, than … Read more
I’m not going to do your homework for you but here are some hints: You need to put all your code inside a class You need to put the code in the main method. (Search on Google) the method served for an entry point. You only need one for loop… Loop through the array, if … Read more