Question

or a given integer n > 1, the smallest integer d > 1 that divides n is a prime factor. We can find the prime factorization of n if we find d and then replace n by the quotient of n divided by d, repeating this until n becomes 1. Write a java program that uses a stack to print the prime factors of a positive integer in descending order. Fo

Answer 1

Using the knowledge in computational language in JAVA it is possible to write a code that organizes the values ​​in descending order according to the division made.

Writing the code in JAVA we have:

ArrayStackADT.java

package L4.num1;

public interface ArrayStackADT<T>

{

void initializeStack();

boolean isEmptyStack();

boolean isFullStack();

void push(T item) throws StackOverflowException;

T peek() throws StackUnderflowException;

void pop() throws StackUnderflowException ;

}

StackOverflowException.java

package L4.num1;

public class StackOverflowException extends StackException

{

public StackOverflowException()

{

super("Stack Overflow");

}

public StackOverflowException(String message)

{

super(message);

}

}

StackException.java

package L4.num1;

public class StackException extends RuntimeException

{

public StackException(String message)

{

super(message);

}

}

StackUnderflowException.java

package L4.num1;

public class StackUnderflowException extends StackException

{

public StackUnderflowException()

{

super("Stack Underflow");

}

public StackUnderflowException(String message)

{

super(message);

}

}

See more about JAVA at brainly.com/question/12978370

#SPJ1