An analysis of algorithms laboratory utilizing the maximum segment sum problem

@inproceedings{McCloskey1995AnAO,
  title={An analysis of algorithms laboratory utilizing the maximum segment sum problem},
  author={Robert McCloskey and John Beidler},
  booktitle={SGCS},
  year={1995}
}
This paper describes a laboratory/homework exercise, appropriate for the traditional CS 2 or Data Structures & Algorithms course (CS 7) [1], that gives students practice in analyzing algorithms to determine their asymptotic running times as well as in recognizing the relationship between an algorithm's asymptotic running time and the execution time of a program implementing it. The exercise utilizes the maximum segment sum problem, which, we argue, is a good alternative to sorting, the… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

Similar Papers

Loading similar papers…