/** * Generate all combinations of the characters in the string s with length * k. * * @param * a string. * @param k * the length of the combinations * @return a list of all of the combinations of the strings in s. */ public static ArrayList combinations (String s, int k) { return combinations ("", s, k); }| /** * Recursive Problem Transformation: * * Generate all combinations of length k of the characters in rest prefixed * with the characters in prefix. This is very similar to the subset method! *Note k is the total length of each string in the returned ArrayList. * * * For example: * combinations ("", "ABC", 2) -> "" before {AB, AC, BC} * -> {AB, AC, BC} * * * * * * combinations ("A", "BC", 2) -> A before {BC, B, C, ""} -> {AB, AC} combinations ("", "BC", 2) -> "" before {BC, B, C, ""} -> {BC}

/** * Generate all combinations of the characters in the string s with length * k. * * @param * a string. * @param k * the length of the combinations * @return a list of all of the combinations of the strings in s. */ public static ArrayList combinations (String s, int k) { return combinations ("", s, k); }| /** * Recursive Problem Transformation: * * Generate all combinations of length k of the characters in rest prefixed * with the characters in prefix. This is very similar to the subset method! Note k is the total length of each string in the returned ArrayList. * * For example: * combinations ("", "ABC", 2) -> "" before {AB, AC, BC} * -> {AB, AC, BC} * * * * * * combinations ("A", "BC", 2) -> A before {BC, B, C, ""} -> {AB, AC} combinations ("", "BC", 2) -> "" before {BC, B, C, ""} -> {BC}

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...

See similar textbooks

Similar questions

(a) Write a method   public static void insert(int[] a, int n, int x)          that inserts x in order among the first n elements of a, assuming these elements are arranged in ascending order. Do NOT use arraylists. x is the last element in a. n does not include x. (b) Using the insert method from Part (a), write a recursive implementation of Insertion Sort.
In the Recursive Binary Search shown below, there are two base cases: Line 10: the search is exhausted without a finding a value that matches the key Line 16: the search finds a value that matches the key 1 public class RecursiveBinarySearch { 2    public static int binarySearch(int[] list, int key) {   3      int low = 0;   4      int high = list.length - 1;   5      return binarySearch(list, key, low, high); 6    } 7 8    private static int binarySearch(int[] list, int key,   9        int low, int high) { 10      if (low > high) // The list has been exhausted without a match 11        return -low - 1; 12 13      int mid = (low + high) / 2; 14      if (key < list[mid]) 15        return binarySearch(list, key, low, mid - 1); 16      else if (key == list[mid]) 17        return mid; 18      else 19        return binarySearch(list, key, mid + 1, high); 20    } 21    22    public static void main(String[] args) { 23      int[] list = {3, 5, 7, 8, 12, 17,…
Write a for loop to initialize the objects in the ArrayList created in question number 2 above to -1. import java.util.*; public class test {     public static void main(String[] args)     {         int n = 25;         ArrayList<Integer> list = new ArrayList<Integer>(n);         for(int i = 0;i<n;i++){             list.add(-1);         }         for(int i = 0;i<n;i++){             System.out.print(list.get(i) + " ");         }     } } Write Java statements to add the integers 1001, 1100, and 1110 to the resulting ArrayList .
Write a recursive function that finds the minimum value in an ArrayList. Your function signature should be public static int findMinimum(ArrayList<Integer>) One way to think of finding a minimum recursively is to think “the minimum number is either the last element in the ArrayList, or the minimum value in the rest of the ArrayList”. For example, if you have the ArrayList [1, 3, 2, 567, 23, 45, 9], the minimum value in this ArrayList is either 9 or the minimum value in [1, 3, 2, 567, 23, 45] ================================================ import java.util.*; public class RecursiveMin{public static void main(String[] args){Scanner input = new Scanner(System.in);ArrayList<Integer> numbers = new ArrayList<Integer>();while (true){System.out.println("Please enter numbers. Enter -1 to quit: ");int number = input.nextInt();if (number == -1){break;}else {numbers.add(number);}} int minimum = findMinimum(numbers);System.out.println("Minimum: " + minimum);}public static int…
JAVA: Write a recursive method named threeSum that accepts a list of integers and prints all combinations of three integers in the list that sum to 0. For example, if given the list [-1, 0, 1, 2, -1, -4], print the following lines of output: [-1, 0, 1] [-1, 2, -1] [0, 1, -1] You may print the lines of output in any order. The elements in each three-element sublist should appear in the same relative order that they appeared in the original list. Do not print duplicate lists; if the same exact sublist can be made in multiple ways, print it only once. If there are no combinations of three elements that sum to 0, print no output. The list passed to your method must be back to its original state at the end of the call. Either do not modify it, or if you modify it, fully undo your modifications before the method returns. Constraints: Do not declare any global variables. You can use any data structures you like, and your code can contain loops, but the overall algorithm must be recursive and…
Answer must be solved Recursively neighbor(n, prev) Takes a positive integer n and a default argument prev and returns the number of digits in n that have the same digit to its left or to its right. Floor division (//) and modulo (%) operators are useful here. Forbidden methods, operators, and libraries: • You are not allowed to convert n to other data type such str() or list() • You are not allowed to use pow, the ** operator, or import any function (such as math.log) • You are not allowed to declare global variables • You are not allowed to use for/while loops in any form Preconditions n: int -> positive integer prev: int -> positive integer sequence of items Returns: int Examples: >>> neighbor(777) 3 >>> neighbor(469704) 0 >>> neighbor(411477) # 411477 4 >>> neighbor(7951452114587444436999) # 7951452114587444436999 9 >>> neighbor(22222222222222233) 17
Suppose that intArray is an array of integers, and length specifies the number of elements in intArray. Also, suppose that low and high are two integers such that 0 <= low < length, 0 <= high < length, and low < high. That is, low and high are two indices in intArray. Write a recursive definition that reverses the elements in intArray between low and high.
Write recursive methods for the following operations: • removeDup(String s): takes string s and returns another string r constructed from s after removing all duplicates. For example, when s = "pineapples", r will be "pineals". • intersection(String s1, String s2): takes two duplicate-free strings and returns the string consisting of all letters that appear in both s1 and s2. • union(String s1, String s2): takes two duplicate-free strings and returns the string consisting of all letters that appear in either s1 or s2. • difference(String s1, String s2): takes two duplicate-free strings and returns the string consisting of all letters that appear only in s1. For example, when s1 = "aples" and s2 = "pears", intersection(s1, s2) will return "apes", union(s1, s2) will "aplesr", and difference(s1, s2) "l". Calling method removeDup() is not allowed in intersection(s1, s2) , union(s1, s2) or difference(s1, s2) method. Your program should check strings are duplicate free before they are…
Write a recursive method to print all the permutations of astring. For example, for the string abc, the permutation isabcacbbacbcacabcba public static void displayPermutation(String s)public static void displayPermutation(String s1, String s2)The first method simply invokes displayPermutation(" ", s). The secondmethod uses a loop to move a character from s2 to s1 and recursively invokesit with new s1 and s2. The base case is that s2 is empty and prints s1 to theconsole.Write a test program that prompts the user to enter a string and displays all itspermutations.
The split method in the String class returns an array of strings consisting of the substrings split by the delimiters. However, the delimiters are not returned. Implement the following new method that returns an array of strings consisting of the substrings split by the matching delimiters, including the matching delimiters. public static String[] split(String s, String regex) For example, split("ab#12#453", "#") returns ab, #, 12, #, and 453 in an array of String and split("a?b?gf#e", "[?#]") returns a, ?, b, ?, gf, #, and e in an array of String.
Write a recursive method that displays all permutations of a given array ofintegers. Here is a sample run: Enter the array size : 3[1, 2, 3][1, 3, 2][2, 1, 3][2, 3, 1][3, 1, 2][3, 2, 1]
Write the following method that sorts an ArrayList:public static <E extends Comparable<E>>void sort(ArrayList<E> list)