Posts by Nathan Martins • 53 points

• 1

  votes

  5

  answers

  8188

  views

  A: Best factor calculation algorithm

  Dude you can do recursive. Int FatorialRecursivo(int num){ If(num==1) || (num==o) return 1; else return FatorialRecursivo(n-1)*n; } I’m sorry the half messed up code I’m answering by APP, anything…

  java algorithm factorial

  answered 8 years, 3 months ago Nathan Martins 53

• 1

  votes

  1

  answer

  1505

  views

  A: How do I get this list double-chained and circulated?

  Next the last element has to point to the list head and the list head to the last element,you can grab the list head pointer by taking the field next to the penultimate element of the list.

  c chain-list

  answered 8 years, 3 months ago Nathan Martins 53

• 0

  votes

  1

  answer

  98

  views

  A: row on c doubt

  This you want to do hurts the queue implementation, because in the queue can only be removed the first one in the queue and the insertion is done at the end of the queue. Anyway, for this problem,…

  c

  answered 8 years, 3 months ago Nathan Martins 53