Average-case analysis in an elementary course on algorithms

Authors:
Francesc J. Ferri;Jesús Albert
Affiliations:
Dept. Informàtica i Electrònica, Universitat de València, Doctor Moliner, 50. 46100 Burjassot, Spain;Dept. Informàtica i Electrònica, Universitat de València, Doctor Moliner, 50. 46100 Burjassot, Spain
Venue:
SIGCSE '98 Proceedings of the twenty-ninth SIGCSE technical symposium on Computer science education
Year:
1998

Citing 7
Cited 0

Algorithms

Algorithms
Introduction to algorithms

Introduction to algorithms
Concrete mathematics: a foundation for computer science

Concrete mathematics: a foundation for computer science
Fundamentals of algorithmics

Fundamentals of algorithmics
An introduction to the analysis of algorithms

An introduction to the analysis of algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching

Quantified Score

Hi-index	0.00

Visualization

Abstract

Average-case algorithm analysis is usually viewed as a tough subject by students in the first courses in Computer Science. Traditionally, these topics are fully developed in advanced courses with a clear mathematical orientation. The work presented here is not an alternative to this, but, it presents the analysis of algorithms (and average-case in particular) adapted to the mathematical background of students in an elementary course on Algorithms or Programming by using some specially selected examples.