subject

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 induce partitions of s of roughly equal size. namely, let si = {xj |yi−1 ≤ xj ≤ yi} be the i − th partition and assume y0 = −∞ and yk = ∞. the number of elements in si is bn/kc or bn/kc + 1.
note: if k = 2 then it suffices to find the median.

ansver
Answers: 1

Another question on Computers and Technology

question
Computers and Technology, 22.06.2019 09:00
Meenu wants to create a high quality drawing in a variety of colours. which device should she use for the same?
Answers: 1
question
Computers and Technology, 22.06.2019 10:30
Dave has to create animations for a game. which tool can dave use?
Answers: 3
question
Computers and Technology, 22.06.2019 15:20
The north and south regions had very diferent economies in the 1800s.
Answers: 1
question
Computers and Technology, 22.06.2019 19:30
When using a public computer or network, you should always
Answers: 2
You know the right answer?
Given a set s of n numbers, x1, x2, . . xn, and an integer k, 1 ≤ k ≤ n, design an algorithm to fin...
Questions
question
Computers and Technology, 29.12.2019 22:31
question
Mathematics, 29.12.2019 22:31
question
Mathematics, 29.12.2019 22:31
question
Social Studies, 29.12.2019 22:31
Questions on the website: 13722367