000			03610cam a2200397 a 4500
999			_c79762 _d317039
001			1safari9781789537178
003			CaSebORM
005			20220315122452.0
006			m o d
007			cr cn
008			010818s2018 xx o eng
020			_z9781789537178
020			_z9781789537178
020			_z9781789537178
020			_z9781789533750
024	8		_a9781789537178
035			_a(CaSebORM)9781789537178
040			_aMa-Un _cMa-Un
041	0		_aeng
082			_222 _a005.133 _bCJB
100	1		_aCutajar, James, _eauthor _989604
245	1	0	_aBeginning Java Data Structures and Algorithms _h[electronic resource] / _cCutajar, James
250			_a1st edition
264		1	_bPackt Publishing, _c2018
300			_a1 online resource (202 pages)
506			_aAvailable to OhioLINK libraries
520			_aThough your application serves its purpose, it might not be a high performer. Learn techniques to accurately predict code efficiency, easily dismiss inefficient solutions, and improve the performance of your application. Key Features Explains in detail different algorithms and data structures with sample problems and Java implementations where appropriate Includes interesting tips and tricks that enable you to efficiently use algorithms and data structures Covers over 20 topics using 15 practical activities and exercises Book Description Learning about data structures and algorithms gives you a better insight on how to solve common programming problems. Most of the problems faced everyday by programmers have been solved, tried, and tested. By knowing how these solutions work, you can ensure that you choose the right tool when you face these problems. This book teaches you tools that you can use to build efficient applications. It starts with an introduction to algorithms and big O notation, later explains bubble, merge, quicksort, and other popular programming patterns. You'll also learn about data structures such as binary trees, hash tables, and graphs. The book progresses to advanced concepts, such as algorithm design paradigms and graph theory. By the end of the book, you will know how to correctly implement common algorithms and data structures within your applications. What you will learn Understand some of the fundamental concepts behind key algorithms Express space and time complexities using Big O notation. Correctly implement classic sorting algorithms such as merge and quicksort Correctly implement basic and complex data structures Learn about different algorithm design paradigms, such as greedy, divide and conquer, and dynamic programming Apply powerful string matching techniques and optimize your application logic Master graph representations and learn about different graph algorithms Who this book is for If you want to better understand common data structures and algorithms by following code examples in Java and improve your application efficiency, then this is the book for you. It helps to have basic knowledge of Java, mathematics and object-oriented programming techniques
533			_aElectronic reproduction. _bBoston, MA : _cSafari, _nAvailable via World Wide Web. _d2018
538			_aMode of access: World Wide Web
550			_aMade available through: Safari, an O'Reilly Media Company
655		7	_aElectronic books. _2local _989605
710	2		_aOhio Library and Information Network _989606
710	2		_aSafari, an O'Reilly Media Company _988237
856	4	0	_3Safari Books Online _zConnect to resource _uhttps://learning.oreilly.com/library/view/-/9781789537178/?ar
942			_2ddc _cBOOK