fix: remove malformed javadoc to fix Werror build (#7393)

src/main/java/com/thealgorithms/conversions/AnyBaseToAnyBase.java

@@ -3,7 +3,7 @@
  * <p>
  * Time Complexity: O(n) [or appropriate complexity]
  * Space Complexity: O(n)
- * * @author Reshma Kakkirala
+ * @author Reshma Kakkirala
  */
 package com.thealgorithms.conversions;
 

src/main/java/com/thealgorithms/searches/SentinelLinearSearch.java

@@ -65,7 +65,8 @@ public <T extends Comparable<T>> int find(T[] array, T key) {
 
         int i = 0;
         // Search without bound checking since sentinel guarantees we'll find the key
-        while (array[i].compareTo(key) != 0) {
+        // Null check for array element to prevent NPE when array contains null elements
+        while (array[i] != null && array[i].compareTo(key) != 0) {
             i++;
         }
 

src/main/java/com/thealgorithms/strings/ReverseString.java

@@ -62,7 +62,7 @@ public static String reverse3(String string) {
     /**
      * Reverses the given string using a stack.
      * This method uses a stack to reverse the characters of the string.
-     * * @param str The input string to be reversed.
+     * @param str The input string to be reversed.
      * @return The reversed string.
      */
     public static String reverseStringUsingStack(String str) {