Which of the following is a correct implementation of linear search on an array?

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

(Java)

question 1

 

public static int linearSearch(int array], int value) {
for (int i = 0; i < array.length; i++) {
if (arrayli) == value) {
return array[i);
}
return -1;
O public static int linearSearch(int array[], int value) {
for (int i = 0; i < array.length; i++) {
if (arrayli) == value) {
return value;
} else {
return -1;
}
}
O public static int linearSearch(int array[], int value) {
for (int i = 0; i < array.length; i++) {
if (array[i] == value) {
return i;
} else {
return -1;
}
}
Transcribed Image Text:public static int linearSearch(int array], int value) { for (int i = 0; i < array.length; i++) { if (arrayli) == value) { return array[i); } return -1; O public static int linearSearch(int array[], int value) { for (int i = 0; i < array.length; i++) { if (arrayli) == value) { return value; } else { return -1; } } O public static int linearSearch(int array[], int value) { for (int i = 0; i < array.length; i++) { if (array[i] == value) { return i; } else { return -1; } }
Which of the following is a correct implementation of linear search on an
array?
O public static int linearSearch(int array[0, int value) {
for (int i = 0; i < array.length; i++) {
if (arrayli) == value) {
return i;
}
}
return -1;
}
public static int linearSearch(int array, int value) {
for (int i = 0; i < array.length; i++) {
if (arrayli) == value) {
return array[i);
} else {
return -1;
}
}
Transcribed Image Text:Which of the following is a correct implementation of linear search on an array? O public static int linearSearch(int array[0, int value) { for (int i = 0; i < array.length; i++) { if (arrayli) == value) { return i; } } return -1; } public static int linearSearch(int array, int value) { for (int i = 0; i < array.length; i++) { if (arrayli) == value) { return array[i); } else { return -1; } }
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Binary Search Algorithm
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education