Reference no: EM13220928
You currently work in an algorithm development group for a large multimedia, mobile device corporation. Your group has been tasked with creating an app that will play an audio file backwards (from end to beginning rather than the standard beginning to end). Because this app is likely to be used on a mobile device, your group figures that this algorithm should use as little memory and space as possible. Your group has therefore decided to construct this reversal order algorithm such that it is an "in-place" algorithm. This simply means that the audio file will be loaded to memory and reversed using the same memory locations (because you must use memory sparingly).
Assignment
• Part 1: Before attempting this implementation, you choose to develop a simple prototype version of this algorithm in C++. Specifically, you will build an in-place, order reversal algorithm. This algorithm will take as an input an array of ints and will reverse the order of the elements in the array, in place (essentially using only the memory in the array). For example, if the array contains five elements [1,2,3,4,5], the output of the algorithm will be [5,4,3,2,1]. Comment your program.
• Part 2: Using this prototype, you will analyze the time complexity and space complexity of your algorithm in the worst case. Specifically, for time complexity, count the number of steps for each line of code, and write down the total lines executed as a mathematical expression where n is the size of the input array. For space complexity, write an expression for the number of memory locations and components that are required for algorithm in the worst case. (Assume that each int is one location.)
• Part 3: Program a method or class that will track the true runtime of your algorithm. Find the true runtime of your algorithm using arrays of varying sizes (e.g., n = 500, n = 1,500, and n= 2,500) using your new tool. Plot, on a Cartesian plane, the runtime of your algorithm as a function of the size of the input array, n.
Attachment:- IndividualProjects.rar
|
Show basis for our construction of output demand function
: Show the basis for our construction of the output DEMAND function. As an intermediate step explain the construction of the consumption function (as a function of output) and how this becomes a key component of the output supply function.
|
|
Explain hexane on catalytic hydrogenation
: give the structure and names of five alkenes having the molecular formula C6H12 that produce hexane on catalytic hydrogenation
|
|
Give the economic intuition of the results on consumption
: Describe the behavior of consumption, investment, labor, productivity, wages, the price level and the money supply over the business cycle both in terms of correlation, magnitude and lead vs lag. Give the economic intuition of the results on consu..
|
|
Explain decreasing phosphoryl group transfer potential
: How do you rank compounds in order of increasing/decreasing phosphoryl group transfer potential. How do you tell which one has the highest potential
|
|
Analyze the time complexity and space complexity
: Develop a simple prototype version of algorithm in C++. Specifically, you will build an in-place, order reversal algorithm - analyze the time complexity and space complexity of your algorithm
|
|
Find competitive equilibrium prices and consumptions for eac
: 1,000 of them have utility functions U(x, y) = x + y and 1,000 of them have utility functions U(x, y) = min{ 2x, y}. Everybody has an initial allocation of 1 unit of x and 1 unit of y. Find the competitive equilibrium prices and consumptions for e..
|
|
Explain what is the boiling point of cyclohexane
: A liquid that has a density of 0.80 0.01g/ml and 0.80-0.01 g/ml is insoluble in cyclohexane. what is the liquid? what is the boiling point of cyclohexane at 600 mm hg?
|
|
What remedies are available to the non-breaching party
: In the event that a contract is formed and subsequently broken, what remedies are available to the non-breaching party under your state's law?
|
|
Explain what is the set of pareto optimal allocations
: Amaranda and Bartolo consume only two goods, X and Y. They can trade only with each other and there is no production. The total endowment of good X equals the total endowment of good Y. Amaranda's utility function is U(xA, yA) = max{xA, yA}
|