Skip to content

Commit 783c96f

Browse files
authored
Fix: remove floating Javadoc comments causing compilation error (#7423)
1 parent 0811cd0 commit 783c96f

3 files changed

Lines changed: 3 additions & 31 deletions

File tree

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

Lines changed: 1 addition & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -1,10 +1,4 @@
1-
/**
2-
* [Brief description of what the algorithm does]
3-
* <p>
4-
* Time Complexity: O(n) [or appropriate complexity]
5-
* Space Complexity: O(n)
6-
* @author Reshma Kakkirala
7-
*/
1+
82
package com.thealgorithms.conversions;
93

104
import java.util.Arrays;

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

Lines changed: 1 addition & 11 deletions
Original file line numberDiff line numberDiff line change
@@ -1,14 +1,4 @@
1-
/**
2-
* Interpolation Search estimates the position of the target value
3-
* based on the distribution of values.
4-
*
5-
* Example:
6-
* Input: [10, 20, 30, 40], target = 30
7-
* Output: Index = 2
8-
*
9-
* Time Complexity: O(log log n) (average case)
10-
* Space Complexity: O(1)
11-
*/
1+
122
package com.thealgorithms.searches;
133

144
/**

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

Lines changed: 1 addition & 13 deletions
Original file line numberDiff line numberDiff line change
@@ -1,16 +1,4 @@
1-
/**
2-
* Performs Linear Search on an array.
3-
*
4-
* Linear search checks each element one by one until the target is found
5-
* or the array ends.
6-
*
7-
* Example:
8-
* Input: [2, 4, 6, 8], target = 6
9-
* Output: Index = 2
10-
*
11-
* Time Complexity: O(n)
12-
* Space Complexity: O(1)
13-
*/
1+
142
package com.thealgorithms.searches;
153

164
import com.thealgorithms.devutils.searches.SearchAlgorithm;

0 commit comments

Comments
 (0)