Design and analysis of algorithms reconsidered

Authors:
Anany Levitin
Affiliations:
Department of Computing Sciences, Villanova University, Villanova, PA
Venue:
Proceedings of the thirty-first SIGCSE technical symposium on Computer science education
Year:
2000

Citing 11
Cited 3

Algorithms

Algorithms
Programming pearls

Programming pearls
Introduction to algorithms

Introduction to algorithms
Compared to what?: an introduction to the analysis of algorithms

Compared to what?: an introduction to the analysis of algorithms
Fundamentals of algorithmics

Fundamentals of algorithmics
Teaching algorithms

ACM SIGACT News
Foundations of algorithms

Foundations of algorithms
The algorithm design manual

The algorithm design manual
The practice of programming

The practice of programming
Do we teach the right algorithm design techniques?

SIGCSE '99 The proceedings of the thirtieth SIGCSE technical symposium on Computer science education
Computer Algorithms: C++

Computer Algorithms: C++

Algorithm analysis for returning adult students

Journal of Computing Sciences in Colleges
A derivation-first approach to teaching algorithms

Proceeding of the 44th ACM technical symposium on Computer science education
An Experimental Method for the Active Learning of Greedy Algorithms

ACM Transactions on Computing Education (TOCE)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper elucidates two views (models) of algorithmic problem solving. The first one is static; it is based on the identification of several principal dimensions of algorithmic problem solving. The second one is dynamic, i.e., it catalogs main steps in the process of solving a problem with a computer. The models are used to identify several important issues in teaching design and analysis of algorithms and to suggest ways of rectifying the shortcomings identified.