Zookal Homework Help

Homework Help

  1. Engineering
  2. Computer Science
  3. 60 pts implement the two algorithms we discussed in class...

Question: 60 pts implement the two algorithms we discussed in class...

Question details

(60 pts) Implement the two algorithms we discussed in class for solving the problem of finding the three/k largest numbers in an input array of integers. The pseudocode of the two algorithms are given below intlI findkLargest(intll a, int k) n length[a] if (k<0 or k> n) output Invalid k and return; if (kEEn) return a; intl] larges[0..k-1] a[0..k-1];// You may use a loop to do this for(int i-k; i<n; i++)i j f index of the minimal number in largest; I/ You may use a loop to do this if(ai>largestjl) largestUl ali]; return largest;

int find3Largest(intl a) n ← length[a]; if (n<=3) return a; sumぐa[0]+a[1]+a[2]; for(int i-0; i<n; ++) for(int j-i+1; j<n; j++) for(int k-j+1; k<n; k++)^ newSum a[i] + a[j] + a[k]) if (sum< newSum) maxli sum newSum return new array fa[maxl], a[max], a[maxK]) Once you implement the algorithms findkLargest and find3Largest, preform the following sample runs, summarize the running times of all runs using a table, and include the table in your project report. Also include in your report discussion and observations about the running times and in particular, how the running times relate to the parameter k Required sample runs 1) Run findkLargest on three randomly generated arrays of sizes N-1,000, N-10,000 and N-100,000 setting k 3 2) Repeat (1) for k=10 and k=N/2 for each N 3) find3Largest on three randomly generated arrays of sizes N-1,000, N-10,000 and N-100,000

Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution