000			02248nam a2200373 i 4500
001			OTLid0001017
003			MnU
005			20241120064024.0
006			m o d s
007			cr
008			210628s2023 mnu o 0 0 eng d
040			_aMnU _beng _cMnU
050		4	_aQA76
100	1		_aBible, Paul W. _eauthor
245	0	3	_aAn Open Guide to Data Structures and Algorithms _cPaul Bible
264		2	_aMinneapolis, MN _bOpen Textbook Library
264		1	_a[Place of publication not identified] _bPALNI _c2023.
264		4	_c©2023.
300			_a1 online resource
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
490	0		_aOpen textbook library.
505	0		_aPublisher's Note -- Acknowledgements -- Algorithms, Big-O, and Complexity -- Recursion -- Sorting -- Search -- Linked Lists -- Stacks and Queues -- Hashing and Hash Tables -- Search Trees -- Priority Queues -- Dynamic Programming -- Graphs -- Hard Problems -- Contributors
520	0		_aThis textbook serves as a gentle introduction for undergraduates to theoretical concepts in data structures and algorithms in computer science while providing coverage of practical implementation (coding) issues. The field of computer science (CS) supports a multitude of essential technologies in science, engineering, and communication as a social medium. The varied and interconnected nature of computer technology permeates countless career paths making CS a popular and growing major program. Mastery of the science behind computer science relies on an understanding of the theory of algorithms and data structures. These concepts underlie the fundamental tradeoffs that dictate performance in terms of speed, memory usage, and programming complexity that separate novice programmers from professional practitioners.
542	1		_fAttribution
546			_aIn English.
588	0		_aDescription based on print resource
650		0	_aComputer Science _vTextbooks
700	1		_aMoser, Lucas _eauthor
700	1		_aScarlato, Mia M. _eillustrator
710	2		_aOpen Textbook Library _edistributor
856	4	0	_uhttps://open.umn.edu/opentextbooks/textbooks/1017 _zAccess online version
999			_c39212 _d39212