Logo

Design and Analysis of Computer Algorithms

Small book cover: Design and Analysis of Computer Algorithms

Design and Analysis of Computer Algorithms
by

Publisher: University of Maryland
Number of pages: 135

Description:
Programming is a very complex task, and there are a number of aspects of programming that make it so complex. The first is that most programming projects are very large, requiring the coordinated efforts of many people. (This is the topic a course like software engineering.) The next is that many programming projects involve storing and accessing large quantities of data efficiently. (This is the topic of courses on data structures and databases.) The last is that many programming projects involve solving complex computational problems, for which simplistic or naive solutions may not be efficient enough. The complex problems may involve numerical data (the subject of courses on numerical analysis), but often they involve discrete data. This is where the topic of algorithm design and analysis is important.

Home page url

Download or read it online for free here:
Download link
(0.8MB, PDF)

Similar books

Book cover: The Art of Computer Programming, Volume 4The Art of Computer Programming, Volume 4
by - Addison-Wesley Professional
This work on the analysis of algorithms has long been recognized as the definitive description of classical computer science, arguably the most influential work ever written on computer programming. Volume 4 covers Combinatorial Algorithms.
(9823 views)
Book cover: Algorithms and Data Structures: The Basic ToolboxAlgorithms and Data Structures: The Basic Toolbox
by - Springer
This book is a concise introduction addressed to students and professionals familiar with programming and basic mathematical language. Individual chapters cover arrays and linked lists, hash tables and associative arrays, sorting and selection, etc.
(6516 views)
Book cover: Algorithms for Modular Elliptic CurvesAlgorithms for Modular Elliptic Curves
by - Cambridge University Press
The author describes the construction of modular elliptic curves giving an algorithm for their computation. Then algorithms for the arithmetic of elliptic curves are presented. Finally, the results of the implementations of the algorithms are given.
(10209 views)
Book cover: Lecture Notes on Bucket AlgorithmsLecture Notes on Bucket Algorithms
by - Birkhauser
In these lecture notes, we attempt to explain the connection between the expected time of various bucket algorithms and the distribution of the data. The results are illustrated on standard searching, sorting and selection problems.
(6441 views)