Describe a recursive algorithm that takes a list L of distinct integers and dete

Question

Describe a recursive algorithm that takes a list L of distinct integers and determines whether they are all prime. Write your answer in pseudo-code or any well-known procedural language like Python, Java, C++, You may assume that your language has a built in way to determine whether a number is prime or not, and has the following built in functions to manipulate lists. i) "empty?" which returns TRUE if a given list is empty, FALSE otherwise ii) "First" which returns the First element of a given nonempty list. iii) "rest" which returns a list containing all but the first element of a given nonempty list. Note that if the list has only one element, "rest" will return the empty list.

Explanation / Answer

procedure all_prime(L):

if empty(L) return True

return isPrime(first(L)) and all_prime(rest(L))

So this is the short recrcive procedure, isPrime will return True if number if prime

so here this is how it is working, An empty list is considered as all_prime list.

Now check if first number if prime if yes then heck if rest of list if prime recursively using our procedure.

If there is any non prime number then function return false, otherwise if all are prime function return true.

Related Questions

Navigate

• Browse (All)
• Browse D
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.