# Homework Solution: home / study / engineering / computer science / computer science questions and answers / m…

home / study / engineering / computer science / computer science questions and answers / modify the algorithm to solve the problem of finding the k-th largest number in array a, 1≤k≤n, ... Your question has been answered Let us know if you got a helpful answer. Rate this answer Question: Modify the algorithm to solve the problem of finding the k-th largest number in array A, 1≤k≤... Modify the algorithm to solve the problem of finding the k-th largest number in array A, 1≤k≤n, without sorting the entire array. Partsof the algorithm are given below. Fill in the blanks. Select-k-th-largest(A: Array [1..n] of numbers) 1               for _____________________ 2                                 ________________ 3                                 for _____________________ 4                                                   if _______________ then ___________ 5                                 if position ≠ i then 6                                                   temp=A[i] 7                                                   A[i]=A[position] 8                                                   A[position]=temp

Here is the answer - for (i=0;i<a.length;i++)

home / consider / engineering / computer understanding / computer understanding inquirys and counterparts / dissimilate the algorithm to explain the example of defense the k-th largest reckon in adorn a, 1≤k≤n, …

Let us recognize if you got a beneficial counterpart. Rate this counterpart

Question: Dissimilate the algorithm to explain the example of defense the k-th largest reckon in adorn A, 1≤k≤…

Dissimilate the algorithm to explain the example of defense the k-th largest reckon in adorn A, 1≤k≤n, extraneously sorting the full adorn. Partsof the algorithm are dedicated adown. Fill in the blanks.

1               control _____________________

2                                 ________________

3                                 control _____________________

4                                                   if _______________ then ___________

5                                 if pose ≠ i then

6                                                   temp=A[i]

7                                                   A[i]=A[position]

8                                                   A[position]=temp

## Expert Counterpart

Here is the counterpart –

control (i=0;i<a.length;i++)

control (j=0;j<a.length;j++)

if pose = i then

temp = A[i];

if pose ≠ i then

temp=A[i]

A[i]=A[position]

A[position]=temp