Consider the following function and then answer the question 19 and 20. ALGORITHM q19p (A [1...r])...

Transcribed Image Text:

Consider the following function and then answer the question 19 and 20. ALGORITHM q19p (A [1...r]) BEGIN p=A[1]; i=1;j=r+1 repeat repeat i=i+1 until A[i]>=p repeat j-j-1 until A[j] =j swap (A[i], A[j]) swap (A[1],A[j]) return j END. ALGORITHM q19 (A [1...r]) BEGIN swap (A[1],A[r]) s=q19p (A[1...r]) END. 19.Initially, let A-[9.2.6.1.4.3.5.8]. What is a value of A after the function q19(A[O...len(A)-1]) is executed? * 20.Initially, let A-[9.2.6.1.4.3.5.8]. What is a value of s after the function q19(A[O...len(A)-1]) is executed? * Consider the following function and then answer the question 19 and 20. ALGORITHM q19p (A [1...r]) BEGIN p=A[1]; i=1;j=r+1 repeat repeat i=i+1 until A[i]>=p repeat j-j-1 until A[j] =j swap (A[i], A[j]) swap (A[1],A[j]) return j END. ALGORITHM q19 (A [1...r]) BEGIN swap (A[1],A[r]) s=q19p (A[1...r]) END. 19.Initially, let A-[9.2.6.1.4.3.5.8]. What is a value of A after the function q19(A[O...len(A)-1]) is executed? * 20.Initially, let A-[9.2.6.1.4.3.5.8]. What is a value of s after the function q19(A[O...len(A)-1]) is executed? *

Answer rating: 100% (QA)

Q19 The function q19pA1r is a partition function that selec... View the full answer