I need the algorithm, proof of correctness and runtime analysis for the problem. No code necessary ONLY algorithm. And runtime should be O(n log n) as stated in the question. You have m dollars and a group of n friend. For each friend 1 ≤ i ≤n, you know the priceP[i] of the piece of candy that would make your friend happy. You want to find a way to distribute the mdollars such that as many of your friends as possible are happy. Design an O(n log n) time greedy algorithmto find how much money you will allocate each friend.

The algorithm is given below with explanation and a Python code

Answered: You have m dollars and a group of n…

Similar questions

(a) Devise a recursive algorithm using design by induction for computing n2 where the input to the algorithm n is a nonnegative integer. Use the fact that (n + 1)2 = n2 + 2n + 1. (b) Discuss the running time requirements of your algorithm.
*PLEASE SOLVE USING PYTHON* You are a nasa engineer who needs to monitor the situation every time a probe uses its thrusters. For a given day you are given the planned times when the thruster will be used. You need to be monitoring the situation at those boost times and for 5 minutes after. You want to figure out if you can take a break for a certain number of minutes. To achieve this you are given the planned boost times in in hours and minutes with an am/pm. And you are given a desired break time in minutes. Output if you can take the break or not given the monitoring you have to do. For example: If you know the thruster is fired at 5:00am and 12:50pm. You need to be monitoring the situation from 5:00am to 5:05am and again from 12:50pm to 12:55pm. Apart from those times you are free to take a break. So a 5 minute break is possible. But a 12 hour break is not possible.
For each problem, please provide i. Describe the worst-case input (the input that would cause the largest running time) Summation used to calculate number of steps for the worst case Explanation of how the code relates to the summation ii. iii. a. (loops require discussing number of iterations and steps per iteration) b. (recursion requires a diagram) A O bound iv.
Please solve this with proper explaination
Please do the following questions with the full python coding and explanation below each question typed
can someone help me with this problem in C and explain how to do it step by step
2. R(N) is the running time of strange_sum when called on a List of length N. Since this is recursive code, your answer to iii should include a diagram of the recursion tree. a. Answer for li being an ArrayList b. Answer for li being a LinkedList static int strange_sum(List li) { return strange_sum_helper(li, 0, li.size() - 1); static int strange_sum_helper (List arr, int left, int right) { if (right - left < 0) return 0; else if (right else { int mid = (left + right) / 2; return strange_sum_helper(arr, left, mid) left 0) return arr.get(left); == + strange_sum_helper(arr, mid + 1, right); } }
ii.Building on your decomposition for part c.i., develop an algorithm for solving the problem. Include this algorithm in your solution document, and also write down your PI and the individual number that you have obtained via Steps 1–3 from your PI H5737055