Posts by Maurício • 43 points

• 1

  votes

  1

  answer

  100

  views

  A: Algorithm of Division and Conquest

  UPDATE: I managed to solve my problem, in case someone is also in doubt I will leave my code public static int somatorio(int[] a, int inicio. int fim) { if(inicio == fim) { return a[inicio]; }else…

  java array recursion

  answered 5 years, 11 months ago Maurício 43

• 0

  votes

  1

  answer

  100

  views

  Q: Algorithm of Division and Conquest

  I’m having trouble making a division and conquest algorithm of the sum of the elements of an arrangement. public static int somatorio(int[] a, int numElem) { if(numElem == 0) { return 0; }else…

  java array recursion

  asked 5 years, 11 months ago Maurício 43

• 2

  votes

  1

  answer

  134

  views

  Q: Recursion Doubt with String in Java

  I’m trying to solve the following exercise: A string collection S is recursively defined by: 'a' and 'b' belong to S; if X belongs to S, then Xb also belongs to S; Write a procedure that implements…

  java string recursion

  asked 6 years, 1 month ago Maurício 43