Given a set S of n numbers, x1, x2,…xn, and an integer k, 1 k n,… Given a set S of n numbers, x1, x2,…xn, and an integer k, 1 = k = n,design an algorithm to find y1, y2 …yk-1 (yi ? S and yi = yi+1) such that they inducepartitions of S of roughly equal size. Namely, let Si = {xj |yi-1 = xj = yi} be thei – th partition and assume y0 = -8 and yk = 8. The number of elements in Si isn/k or n/k + 1.Note: If k = 2 then it suffices to find the median.Exercise 3.7 By using an appropriate terminating condition, show that T(n) ? O(n)for the deterministic algorithm based on median of medians.(a) Try to minimize the leading constant by adjusting the size of the group.(b) What is the space complexity of this algorithm ?Image transcription textFor relatively small values of n,algorithms with larger orders can bemore efficient than algorit… Show more… Show moreImage transcription textWhat is Kruskal’s algorithm and what isthe main purpose of using Kruskalalgorithm and which algor… Show more… Show moreImage transcription textOdd man out: Topological sortAlgorithm . DFS Algorithm Binarysearch Algorithm BFS Alg… Show more… Show moreEngineering & TechnologyComputer ScienceCOMP 61411
