Describe why algorithm runs in on time

Assignment Help Data Structure & Algorithms

Reference no: EM1372062

Assume you have an array A of n items, and you want to find the k items in A closest to the median of A. For example, if A contains the 9 values {7, 14, 10, 12, 2, 11, 29, 3, 4} and k = 5, then the answer would be the values {7, 14, 10, 12, 11}, since the median is 10 and these are the five values in A closest to the value 10. Give an algorithm to solve this problem in O(n) time, and explain why your algorithm runs in O(n) time. You may use the selection algorithms discussed in the book and the notes as subroutines of your solution. (Hint: you may want to call the selection algorithm more than once.)

Reference no: EM1372062

Questions Cloud

What is non-verbal communication : What is non-verbal communication and how does one improve it and how can one be self-aware of their non-verbal gestures?

Discuss the concept of marriage : Describe and critically discuss the concept of marriage from both the functionalist perspective and the conflict perspective. Provide at least one example for each.

Define subsidy : Mr. Smith, has fallen behind on his work, he has asked you to help to make a letter for a local business or economic project.

Contemporary norms associated with hegemonic masculinity : Determine the contemporary norms associated with the hegemonic masculinity and document the consequences of such norms for men and their families, and their relationships with women.

Describe why algorithm runs in on time : Assume you have the array A of n items, and you want to find k items in A closest to the median of A. Describe why your algorithm runs in O(n) time.

Disucss the influences of price elasticity of demand : Post a memo to explain the factors that contribute to the elasticity of goods. Also incorporate a real-life example of price elasticity of demand, and discuss how it impacts the economy.

Major methods of sociological research : Discuss how each of the major methods of sociological research - experiment, survey, participant observation, and secondary research - are suitable for helping us to answer different types of questions and to study different situations.

Source of knowledge in terms of strengths : Evaluate each source of knowledge in terms of its strengths and limitations as it applies to how your discipline obtains knowledge.

Explain algorithm from is optimal by proving lower bound : Illustrate that your algorithm from (a) is optimal by proving lower bound of n - k on number of comparisons required to solve the problem.

User Account

All Pages