000			01870nam a2200229Ia 4500
003			NULRC
005			20250520103011.0
008			250520s9999 xx 000 0 und d
020			_a9781096719939
040			_cNULRC
050			_aQA 76.73.J38 .H8 2019
100			_aHu, Yang _eauthor
245		0	_aEasy learning data structures algorithms java practice / _cYang Hu
260			_a[Place of publication not identifed] : _b[publisher not identified], _cc2019
300			_a201 pages ; _c26 cm.
365			_bUSD44
500			_aEasy learning data structures algorithms java practice /, Easy
505			_a1. Linear Table Definition -- 2. Linear Table Search -- 3. Linear Table Append -- 4. Linear Table Insert -- 5. Linear Table Delete -- 6. Bubble Sorting Algorithm -- 7. Select Sorting Algorithm -- 8. Insert Sorting Algorithm -- 9. Dichotomy Binary Search -- 10. Single Link -- 11. Doubly Linked Link -- 12. One-way Circular LinkedList -- 13. Two-way Circular LinkedList -- 14. Queue -- 15. Stack -- 16. Recursive Algorithm -- 17. Quick Sorting -- 18. Two-way Merge Algorithm -- 19. Binary Search Tree -- 20. Binary Heap Sorting -- 21. Hash Table -- 22. Graph.
520			_aExperience about the design of object-oriented software, the design patterns allow designers to create more flexible, elegant, and ultimately reusable designs without having to rediscover the design solutions themselves. Each pattern describes the circumstances in which it is applicable, when it can be applied in view of other design constraints, and the consequences and trade-offs of using the pattern within a larger design. All patterns are compiled from real systems and are based on real-world examples. Each pattern also includes code that demonstrates how it may be implemented in object-oriented programming languages like Java.
650			_aALGORITHMS
942			_2lcc _cBK
999			_c21020 _d21020