Question: Consider the following function and then answer the question 29 and 30. ALGORITHM q29p (A[1...r]) BEGIN p=A[1]; i=1;j=r+1 repeat repeat i=i+1 until A[i] >=p

Consider the following function and then answer the question 29 and 30. ALGORITHM q29p (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 q29 (A [1...r]) BEGIN END. swap (A[1],A[2]) s=q29p (A[1...r]) 29.Initially, let A-[4.1.8.5.9]. What is a value of A after the function q29(A[O...len(A)-1)] is executed? Your answer 30.Initially, let A-[4.1.8.5.9]. What is a value of s after the function q29(A[O...len(A)-1)] is executed? Your answer
Step by Step Solution
3.43 Rating (159 Votes )
There are 3 Steps involved in it
To answer these questions lets first understand the algorithms q29p takes an array A and a rang... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (2 attachments)
663da0b734ad3_964268.pdf
180 KBs PDF File
663da0b734ad3_964268.docx
120 KBs Word File
