Suppose we want to partition N items into G equal-sized groups of size N/G, suchthat the
Chapter 7, Problem 7.41(choose chapter or problem)
Suppose we want to partition N items into G equal-sized groups of size N/G, suchthat the smallest N/G items are in group 1, the next smallest N/G items are ingroup 2, and so on. The groups themselves do not have to be sorted. For simplicity,you may assume that N and G are powers of two.a. Give an O(N logG) algorithm to solve this problem.b. Prove an (N log G) lower bound to solve this problem using comparison-basedalgorithms.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer