Look at the attachemd zip file for deatails
[url removed, login to view] implement for the referenced based version, you do not have to do the array based version.
2. A can be used as a stack. Consider the following problem.
Given a series of *n* daily price quotes for a stock, we call the **span**
of the stock’s price on a certain date the maximum number of consecutive
days up to the current day that the price has been less than
or equal to the price on that day. More formally, assume that price
quotes begin with day 0 and that *pi* denotes the price on day *i*. The
span *si* on day *i* is equal to the maximum integer *k* such that *k* <=*i*+1
and *pj* <= *pi* for *j* = *i*−*k*+1, ..., *i*. Given the prices *p*0, *p*1, ...*pn*−1,
consider the problem of computing spans *s*0, *s*1, ..., *sn*−1
This problem can be solved in linear time with the following algorithm involving
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.
2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request.
3) Exclusive and complete copyrights to all work purchased. (No GPL, 3rd party components, etc. unless all copyright ramifications are explained AND AGREED TO by the buyer on the site).
should be deliver with a readme file and should have lot of comments
should be unix compatible, , should run in unix machine