Amazon cover image
Image from Amazon.com

Easy learning data structures algorithms java practice / Yang Hu

By: Material type: TextTextPublication details: [Place of publication not identifed] : [publisher not identified], c2019Description: 201 pages ; 26 cmISBN:
  • 9781096719939
Subject(s): LOC classification:
  • QA 76.73.J38 .H8 2019
Contents:
1. 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.
Summary: Experience 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.
Item type: Books
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Home library Collection Call number Copy number Status Date due Barcode
Books Books National University - Manila LRC - Main General Circulation Gen. Ed. - CCIT GC QA 76.73.J38 .H8 2019 (Browse shelf(Opens below)) c.1 Available NULIB000018779

Easy learning data structures algorithms java practice /, Easy

1. 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.

Experience 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.

There are no comments on this title.

to post a comment.