This clearly structured and easy to read textbook explains the concepts and techniques required to write programs that can handle large amounts of data efficiently.
Project-oriented and classroom-tested, the book presents a number of important algorithms supported by motivating examples that bring meaning to the problems faced by computer programmers. The idea of computational complexity is also introduced, demonstrating what can and cannot be computed efficiently so that the programmer can make informed judgements about the algorithms they use. The text assumes some basic experience in computer programming and familiarity in an object-oriented language, but not necessarily with Python.
%0 Book
%1 lee2015structures
%A Lee, Kent D.
%A Hubbard, Steve
%B Undergraduate Topics in Computer Science
%D 2015
%I Springer International Publishing
%K computing python textbook
%R 10.1007/978-3-319-13072-9
%T Data Structures and Algorithms with Python
%U https://doi.org/10.1007/978-3-319-13072-9
%X This clearly structured and easy to read textbook explains the concepts and techniques required to write programs that can handle large amounts of data efficiently.
Project-oriented and classroom-tested, the book presents a number of important algorithms supported by motivating examples that bring meaning to the problems faced by computer programmers. The idea of computational complexity is also introduced, demonstrating what can and cannot be computed efficiently so that the programmer can make informed judgements about the algorithms they use. The text assumes some basic experience in computer programming and familiarity in an object-oriented language, but not necessarily with Python.
@book{lee2015structures,
abstract = {This clearly structured and easy to read textbook explains the concepts and techniques required to write programs that can handle large amounts of data efficiently.
Project-oriented and classroom-tested, the book presents a number of important algorithms supported by motivating examples that bring meaning to the problems faced by computer programmers. The idea of computational complexity is also introduced, demonstrating what can and cannot be computed efficiently so that the programmer can make informed judgements about the algorithms they use. The text assumes some basic experience in computer programming and familiarity in an object-oriented language, but not necessarily with Python.},
added-at = {2020-05-04T09:04:12.000+0200},
author = {Lee, Kent D. and Hubbard, Steve},
biburl = {https://www.bibsonomy.org/bibtex/26cbe35754e8cb87ea9bd41aa4148ee61/pbett},
doi = {10.1007/978-3-319-13072-9},
interhash = {5b9153085a11a8b1b934b969776eb9f8},
intrahash = {6cbe35754e8cb87ea9bd41aa4148ee61},
keywords = {computing python textbook},
publisher = {Springer International Publishing},
series = {Undergraduate Topics in Computer Science},
timestamp = {2020-05-04T09:04:12.000+0200},
title = {Data Structures and Algorithms with Python},
url = {https://doi.org/10.1007/978-3-319-13072-9},
year = 2015
}