이 기사에서는 배열의 요소를 재귀적으로 선형 검색하는 방법을 이해합니다. 선형 검색은 모든 항목을 하나씩 순차적으로 검색하는 매우 간단한 검색 알고리즘입니다.
아래는 동일한 데모입니다 -
입력이 다음과 같다고 가정 -
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