Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I am trying to write a recursive function to check whether one array is contained in a second array (my example is also sub-array) and returns true or false.
For example: [d, e] is contained in [a, b, c, d, e, f]
.
I know how to check without recursion (using for loops), but can not think of a solution using recursion.
You can use hashing to store elements of large array in hash table and then check whether each element of sub array is there in hash table or not, If all elements found then it will be subarray.