数据结构
网络
RDBMS
操作系统
Java
MS Excel
iOS
HTML
CSS
Android
Python
C 编程
C++
C#
MongoDB
MySQL
Javascript
PHP
物理
化学
生物
数学
英语
经济学
心理学
社会学
时尚研究
法律研究Java 程序，递归线性搜索数组中的元素
在本文中，我们将了解如何递归线性搜索数组中的元素。线性搜索是一种非常简单的搜索算法，它对所有项目逐个执行顺序搜索。
以下是对相同内容的演示示例 −
假设我们的输入是 −
Input array: 14 20 35 47 50 65 72 81 90 99 Key element: 72
期望的输出是 −
The element 72 is present at position: 6
算法
Step 1 - START Step 2 - Declare a string array namely input_array, two integer namely key_element and index Step 3 - Define the values. Step 4 - Iterate through the array. Step 5 - Define the element to be searched. Invoke the recursive method by passing these parameters. Step 6 - Define an ‘if’ condition with the condition that a failure would return -1, otherwise the position of the element itself. Step 7 - Display this on the console. Step 8 - Stop
示例 1
在这里，我们展示对整数的线性搜索。
public class LinearSearch {
static int recSearch(int input_array[], int l, int r, int key_element) {
if (r < l)
return -1;
if (input_array[l] == key_element)
return l;
if (input_array[r] == key_element)
return r;
return recSearch(input_array, l+1, r-1, key_element);
}
public static void main(String[] args) {
int input_array[] = {14, 20, 35, 47, 50, 65, 72, 81, 90, 99};
System.out.println("The elements of the array is defined as ");
for (int i : input_array) {
System.out.print(i +" ");
}
int key_element = 72;
System.out.println("\n\nThe elements to be searched in the array is: " + key_element);
int index = recSearch(input_array, 0, input_array.length-1, key_element);
if (index != -1)
System.out.println("\nThe element " + key_element + " is present at position: " + index);
else
System.out.println("Element " + key_element + " is not present: ");
}
}输出
The elements of the array is defined as 14 20 35 47 50 65 72 81 90 99 The elements to be searched in the array is: 72 The element 72 is present at position: 6
示例 2
在这里，我们展示对字符串的线性搜索。
public class Demo {
static int recSearch(String input_array[], int l, int r, String key_element) {
if (r < l)
return -1;
if (input_array[l] == key_element)
return l;
if (input_array[r] == key_element)
return r;
return recSearch(input_array, l+1, r-1, key_element);
}
public static void main(String[] args) {
String input_array[] = { "Scala", "Java", "Python", "Mysql"};
System.out.println("The elements of the array is defined as ");
for (String i : input_array) {
System.out.print(i +" ");
}
String key_element = "Java";
System.out.println("\n\nThe elements to be searched in the array is: " + key_element);
int index = recSearch(input_array, 0, input_array.length-1, key_element);
if (index != -1)
System.out.println("\nThe element " + key_element + " is present at position: " + index);
else
System.out.println("Element " + key_element + " is not present: ");
}
}输出
The elements of the array is defined as Scala Java Python Mysql The elements to be searched in the array is: Java The element Java is present at position: 1
更新于： 2022-03-29
3K+ 浏览量
广告