close menu
Bookswagon-24x7 online bookstore
close menu
My Account
Home > Computing and Information Technology > Databases > Database design and theory > Algorithms in Java, Parts 1-4, Portable Documents
Algorithms in Java, Parts 1-4, Portable Documents

Algorithms in Java, Parts 1-4, Portable Documents

          
5
4
3
2
1

Out of Stock


Premium quality
Premium quality
Bookswagon upholds the quality by delivering untarnished books. Quality, services and satisfaction are everything for us!
Easy Return
Easy return
Not satisfied with this product! Keep it in original condition and packaging to avail easy return policy.
Certified product
Certified product
First impression is the last impression! Address the book’s certification page, ISBN, publisher’s name, copyright page and print quality.
Secure Checkout
Secure checkout
Security at its finest! Login, browse, purchase and pay, every step is safe and secured.
Money back guarantee
Money-back guarantee:
It’s all about customers! For any kind of bad experience with the product, get your actual amount back after returning the product.
On time delivery
On-time delivery
At your doorstep on time! Get this book delivered without any delay.
Notify me when this book is in stock
Add to Wishlist

About the Book

This edition of Robert Sedgewick's popular work provides current and comprehensive coverage of important algorithms for Java programmers. Michael Schidlowsky and Sedgewick have developed new Java implementations that both express the methods in a concise and direct manner and provide programmers with the practical means to test them on real applications.

Many new algorithms are presented, and the explanations of each algorithm are much more detailed than in previous editions. A new text design and detailed, innovative figures, with accompanying commentary, greatly enhance the presentation. The third edition retains the successful blend of theory and practice that has made Sedgewick's work an invaluable resource for more than 400,000 programmers!

This particular book, Parts 1-4, represents the essential first half of Sedgewick's complete work. It provides extensive coverage of fundamental data structures and algorithms for sorting, searching, and related applications. Although the substance of the book applies to programming in any language, the implementations by Schidlowsky and Sedgewick also exploit the natural match between Java classes and abstract data type (ADT) implementations.

Highlights

  • Java class implementations of more than 100 important practical algorithms
  • Emphasis on ADTs, modular programming, and object-oriented programming
  • Extensive coverage of arrays, linked lists, trees, and other fundamental data structures
  • Thorough treatment of algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT implementations (search algorithms)
  • Complete implementations for binomial queues, multiway radix sorting, randomized BSTs, splay trees, skip lists, multiway tries, B trees, extendible hashing, and many other advanced methods
  • Quantitative information about the algorithms that gives you a basis for comparing them
  • More than 1,000 exercises and more than 250 detailed figures to help you learn properties of the algorithms

Whether you are learning the algorithms for the first time or wish to have up-to-date reference material that incorporates new programming styles with classic and new algorithms, you will find a wealth of useful information in this book.



Table of Contents:

I. FUNDAMENTALS.

1. Introduction.

Algorithms.

A Sample Problem: Connectivity.

Union-Find Algorithms.

Perspective.

Summary of Topics.

2. Principles of Algorithm Analysis.

Implementation and Empirical Analysis.

Analysis of Algorithms.

Growth of Functions.

Big-Oh notation.

Basic Recurrences.

Examples of Algorithm Analysis.

Guarantees, Predictions, and Limitations.

II. DATA STRUCTURES.

3. Elementary Data Structures.

Building Blocks.

Arrays.

Linked Lists.

Elementary List Processing.

Memory Allocation for Lists.

Strings.

Compound Data Structures.

4. Abstract Data Types.

Collections of Items.

Pushdown Stack ADT.

Examples of Stack ADT Clients.

Stack ADT Implementations.

Generic Implementations.

Creation of a New ADT.

FIFO Queues and Generalized Queues.

Duplicate and Index Items.

First-Class ADTs.

Application-Based ADT Example.

Perspective.

5. Recursion and Trees.

Recursive Algorithms.

Divide and Conquer.

Dynamic Programming.

Trees.

Mathematical Properties of Trees.

Tree Traversal.

Recursive Binary-Tree Algorithms.

Graph Traversal.

Perspective.

III. SORTING.

6. Elementary Sorting Methods.

Rules of the Game.

Generic Sort Implementations.

Selection Sort.

Insertion Sort.

Bubble Sort.

Performance Characteristics of Elementary Sorts.

Algorithm Visualization.

Shellsort.

Sorting Linked Lists.

Key-Indexed Counting.

7. Quicksort 315.

The Basic Algorithm.

Performance Characteristics of Quicksort.

Stack Size.

Small Subfiles.

Median-of-Three Partitioning.

Duplicate Keys.

Strings and Vectors.

Selection.

8. Merging and Mergesort.

Two-Way Merging.

Abstract In-Place Merge.

Top-Down Mergesort.

Improvements to the Basic Algorithm.

Bottom-Up Mergesort.

Performance Characteristics of Mergesort.

Linked-List Implementations of Mergesort.

Recursion Revisited.

9. Priority Queues and Heapsort.

Elementary Implementations.

Heap Data Structure.

Algorithms on Heaps.

Heapsort.

Priority-Queue ADT.

Priority Queues for Index Items.

Binomial Queues.

10. Radix Sorting.

Bits, Bytes, and Words.

Binary Quicksort.

MSD Radix Sort.

Three-Way Radix Quicksort.

LSD Radix Sort.

Performance Characteristics of Radix Sorts.

Sublinear-Time Sorts.

11. Special-Purpose Sorts.

Batcher's Odd-Even Mergesort.

Sorting Networks.

Sorting In Place.

External Sorting.

Sort-Merge Implementations.

Parallel Sort-Merge.

IV. SEARCHING.

12. Symbol Tables and BSTs.

Symbol-Table Abstract Data Type.

Key-Indexed Search.

Sequential Search.

Binary Search.

Index Implementations with Symbol Tables.

Binary Search Trees.

Performance Characteristics of BSTs.

Insertion at the Root in BSTs.

BST Implementations of Other ADT Functions.

13. Balanced Trees.

Randomized BSTs.

Splay BSTs.

Top-Down 2-3-4 Trees.

Red-Black Trees.

Skip Lists.

Performance Characteristics.

14. Hashing.

Hash Functions.

Separate Chaining.

Linear Probing.

Double Hashing.

Dynamic Hash Tables.

Perspective.

15. Radix Search.

Digital Search Trees.

Tries.

Patricia Tries.

Multiway Tries and TSTs.

Text-String-Index Applications.

16. External Searching.

Rules of the Game.

Indexed Sequential Access.

B Trees.

Extendible Hashing.

Perspective.

Appendix.
Index. 0201361205T06262002


Best Seller

| | See All


Product Details
  • ISBN-13: 9780672333712
  • Publisher: Pearson Education (US)
  • Publisher Imprint: Addison-Wesley Educational Publishers Inc
  • Language: English
  • ISBN-10: 0672333716
  • Publisher Date: 04 May 2021
  • Binding: Digital download
  • No of Pages: 764


Similar Products

How would you rate your experience shopping for books on Bookswagon?

Add Photo
Add Photo

Customer Reviews

REVIEWS           
Click Here To Be The First to Review this Product
Algorithms in Java, Parts 1-4, Portable Documents
Pearson Education (US) -
Algorithms in Java, Parts 1-4, Portable Documents
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Algorithms in Java, Parts 1-4, Portable Documents

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book
    Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals

    | | See All


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!
    ASK VIDYA