3. Linear time algorithm for selection problem, given n numbers, find the k'th largest in linear time: Typical implementation starts with partitioning the n numbers into [n/5] groups and each group contains 5 numbers or less (the last group). My question is, how about we partition the numbers into 3 in a group or 7 in a group? Please explain.

Process or set of rules that allow for the solving of specific, well-defined computational problems through a specific series of commands. This topic is fundamental in computer science, especially with regard to artificial intelligence, databases, graphics, networking, operating systems, and security.