Add suggested changes

Author: Hardvan

src/main/java/com/thealgorithms/others/TowerOfHanoi.java

@@ -3,12 +3,24 @@
 import java.util.List;
 
 /**
- * The {@code TowerOfHanoi} class provides functionality to solve the Tower of
- * Hanoi puzzle.
- * It uses recursion to move discs between poles and prints the steps to solve
- * the puzzle.
- * The main function interacts with the user to get the number of discs and
- * calls the recursive {@code shift} function to perform the moves.
+ * The {@code TowerOfHanoi} class provides a recursive solution to the Tower of Hanoi puzzle.
+ * This puzzle involves moving a set of discs from one pole to another, following specific rules:
+ * 1. Only one disc can be moved at a time.
+ * 2. A disc can only be placed on top of a larger disc.
+ * 3. All discs must start on one pole and end on another.
+ *
+ * This implementation recursively calculates the steps required to solve the puzzle and stores them
+ * in a provided list.
+ *
+ * <p>
+ * For more information about the Tower of Hanoi, see
+ * <a href="https://en.wikipedia.org/wiki/Tower_of_Hanoi">Tower of Hanoi on Wikipedia</a>.
+ * </p>
+ *
+ * The {@code shift} method takes the number of discs and the names of the poles,
+ * and appends the steps required to solve the puzzle to the provided list.
+ * Time Complexity: O(2^n) - Exponential time complexity due to the recursive nature of the problem.
+ * Space Complexity: O(n) - Linear space complexity due to the recursion stack.
  * Wikipedia: https://en.wikipedia.org/wiki/Tower_of_Hanoi
  */
 final class TowerOfHanoi {
@@ -20,9 +32,10 @@ private TowerOfHanoi() {
      * Recursively solve the Tower of Hanoi puzzle by moving discs between poles.
      *
      * @param n                The number of discs to move.
-     * @param startPole        The name of the start pole.
-     * @param intermediatePole The name of the intermediate pole.
-     * @param endPole          The name of the end pole.
+     * @param startPole        The name of the start pole from which discs are moved.
+     * @param intermediatePole The name of the intermediate pole used as a temporary holding area.
+     * @param endPole          The name of the end pole to which discs are moved.
+     * @param result           A list to store the steps required to solve the puzzle.
      *
      *                         <p>
      *                         This method is called recursively to move n-1 discs
@@ -31,6 +44,11 @@ private TowerOfHanoi() {
      *                         moves the n-1 discs from the
      *                         intermediate pole to the end pole.
      *                         </p>
+     *
+     *                         <p>
+     *                         Time Complexity: O(2^n) - Exponential time complexity due to the recursive nature of the problem.
+     *                         Space Complexity: O(n) - Linear space complexity due to the recursion stack.
+     *                         </p>
      */
     public static void shift(int n, String startPole, String intermediatePole, String endPole, List<String> result) {
         if (n != 0) {