Submit deadline: 16:00, 18 September 2024, Wednesday

Problem Description:

Given an array X, the span S[i] of X[i] is the maximum number of consecutive elements X[j] immediately preceding X[i] and such that X[j] <= X[i]

What you need to do:

Develop a C++ function that has an array of double numbers and the size of the array as its parameters, and then fill an integer array of the same size the span of each element in the first array.

The prototype of the function is shown below:

  void calculateSpan(double X[], int size, int S[]);
  

First develop the function using a quadratic algorithm. (This should be easy).

Then develop a linear algorithm to solve the problem using a Stack. Try to analyze why this algorithm is a linear one.

Submit:

Practice submit your solution electronically using the following steps:

• Gather all the files you want to submit into one directory. The files usually should include all the source code files (.cpp and .h ones), makefile, readme and typescript, etc.
• Go into the above mentioned directory, then execute the following command:
  ~liuh/bin/submit 260 Lab1 .
• You can use the command ~liuh/bin/checksubmit 260 Lab1 to view what you have submitted for Lab 1.