Skip to content

Refactor LinearSearch to simplify null checks #7368

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
YERRA-CHARAN wants to merge 3 commits into
base: master
Choose a base branch
from
Open

Refactor LinearSearch to simplify null checks #7368

Changes from 2 commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
00ba70a
Refactor LinearSearch to simplify null checks
YERRA-CHARAN Apr 7, 2026
31cce95
Fix loop condition in LinearSearch implementation
YERRA-CHARAN Apr 9, 2026
cf340ea
Merge branch 'master' into patch-1
YERRA-CHARAN Apr 9, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions src/main/java/com/thealgorithms/searches/LinearSearch.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -46,11 +46,11 @@ public class LinearSearch implements SearchAlgorithm {
@Override
public <T extends Comparable<T>> int find(T[] array, T value) {

if (array == null || array.length == 0 || value == null) {
if (array == null || value == null) {
return -1;
}

for (int i = 0; i < array.length; i++) {
for (int i = 0, n = array.length; i < n; i++) {
if (array[i] != null && array[i].compareTo(value) == 0) {
return i;
}
Expand Down