Hướng dẫn recursive search python
View Discussion Improve Article Save Article View Discussion Improve Article Save Article Given an unsorted array and an element x, search x in the given array. Write recursive C code for this. If the element is not present, return -1. Approach : The idea is to compare x with the last element in arr[].
If the element is found at the last position, return it. Else recur searchElement() for remaining array and element x.
Java
Python3
C#
PHP
Javascript
Output Element 11 is present at index 2 Explanation We iterate through the array from the end by decrementing the size variable and recursively calling the function searchElement(). If the size variable becomes less than zero it means the element is not present in the array and we return -1. If a match is found, we return the size variable which is the index of the found element. This process is repeated until a value is returned to main(). It is important to note that if there are duplicate elements in the array, the index of the last matched element will be returned since we are (recursively) iterating the array from the end. Time Complexity: O(N), where N is the size of the given array. Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above |