ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Average-case analysis in an elementary course on algorithms
Full text PdfPdf (554 KB)
Source Technical Symposium on Computer Science Education archive
Proceedings of the twenty-ninth SIGCSE technical symposium on Computer science education table of contents
Atlanta, Georgia, United States
Pages: 202 - 206  
Year of Publication: 1998
ISBN:0-89791-994-7
Also published in ...
Authors
Francesc J. Ferri  Dept. Informàtica i Electrònica, Universitat de València, Doctor Moliner, 50. 46100 Burjassot, Spain
Jesús Albert  Dept. Informàtica i Electrònica, Universitat de València, Doctor Moliner, 50. 46100 Burjassot, Spain
Sponsor
SIGCSE: ACM Special Interest Group on Computer Science Education
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 12,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/273133.274297
What is a DOI?

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.



Collaborative Colleagues:
Francesc J. Ferri: colleagues
Jesús Albert: colleagues