An analysis of algorithms laboratory utilizing the maximum segment sum problem

Authors:
Robert McCloskey;John Beidler
Affiliations:
University of Scranton;University of Scranton
Venue:
ACM SIGCSE Bulletin
Year:
1995

Citing 7
Cited 0

Programming pearls

Programming pearls
Formal development programs and proofs

Formal development programs and proofs
Programming in the 1990s: an introduction to the calculation of programs

Programming in the 1990s: an introduction to the calculation of programs
Yet another analysis of algorithms laboratory

ACM SIGCSE Bulletin
Data structures and algorithm analysis in Ada

Data structures and algorithm analysis in Ada
Curriculum '78: recommendations for the undergraduate program in computer science— a report of the ACM curriculum committee on computer science

Communications of the ACM
Introduction to Algorithms: A Creative Approach

Introduction to Algorithms: A Creative Approach

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 problem that is probably most often used in exercises of this kind.