Algorithms in C, Parts 1-4

Algorithms in C, Parts 1-4

Have one to sell?
Sell yours Here >
See Details
Key Features
  • Publisher:Pearson
  • Copyright:1997
  • Language: English
  • ISBN13 :9780201314526
  • Number Of Pages: 720 pages
  • Edition:3
  • Seller Score:
    3.3 / 5
    Selling on Jumia: 2 years
    Detailed Seller Ratings(Out of 5)
    • Fulfillment rate 2.0 (Below Average)
    • Product Quality 5.0 (Above Average)
    • Shipping Speed 3.0 (Below Average)
    1,000+Successful Sales
  • Delivery

    Delivery Timelines and Cities

    City

    Regular

    Cairo & Giza*

    3

    4 - 6

    Other cities

    4

    5 - 10

    *If order placed before 2pm.

    is available only for items with the Logo. Click here for more information

    Delivery times are business days only, and do not include Friday.

    Delivery timeline for international orders is 9-15 days. Click here for more info.

    Click here for our full Delivery Timelines

    & Click here for our Shipping fees details

    Delivery within: 6 business days
Pay cash on delivery
14 days free return

Free Return within 14-days. Details below.

Wrong Item - to be returned within 48 hours

All items are eligible for return

Changed Mind - to be returned within 7 days

Fashion, Mobile phones, Electronics, Computing

Damaged Item - to be returned within 14 days

Fashion, Mobile phones, Electronics, Computing, Books, Food, Bulky Items, International Products

Click here for more Returns Policy and Return Times.

Genuine product
This is an eminently readable book which an ordinary programmer, unskilled in mathematical analysis and wary of theoretical algorithms, ought to be able to pick up and get a lot out of.." - Steve Summit, author of C Programming FAQs Sedgewick has a real gift for explaining concepts in a way that makes them easy to understand. The use of real programs in page-size (or less) chunks that can be easily understood is a real plus. The figures, programs, and tables are a significant contribution to the learning experience of the reader; they make this book distinctive. - William A. Ward, University of South Alabama Robert Sedgewick has thoroughly rewritten and substantially expanded his popular work to provide current and comprehensive coverage of important algorithms and data structures. 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 250,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. The algorithms and data structures are expressed in concise implementations in C, so that you can both appreciate their fundamental properties and test them on real applications. Of course, the substance of the book applies to programming in any language. Highlights * Expanded coverage of arrays, linked lists, strings, trees, and other basic data structures * Greater emphasis on abstract data types (ADTs) than in previous editions * Over 100 algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT (searching) implementations * New implementations of binomial queues, multiway radix sorting, Batcher's sorting networks, randomized BSTs, splay trees, skip lists, multiway tries, and much more * Increased quantitative information about the algorithms, including extensive empirical studies and basic analytic studies, giving you a basis for comparing them * Over 1000 new exercises to help you learn the properties of algorithms Whether you are a student learning the algorithms for the first time or a professional interested in having up-to-date reference material, you will find a wealth of useful information in this book.
Key Features
  • Publisher:Pearson
  • Copyright:1997
  • Language: English
  • ISBN13 :9780201314526
  • Number Of Pages: 720 pages
  • Edition:3
  • Author:Sedgewick, Robert
Specifications of Algorithms in C, Parts 1-4
SKU
JU030BKAJIE6NAFAMZ
Model
BACCAH - 9780201314526
Main Material
Paperback
Author
Sedgewick, Robert
  • 5 stars
    (0)
  • 4 stars
    (0)
  • 3 stars
    (0)
  • 2 stars
    (0)
  • 1 star
    (0)
Average Rating
0
No rating yet.
Have you used this product before?
Write a review'
Can I return this product?

You can return this product for a refund, within 14 days after receiving your original order.

You can return this product ONLY if you have received the wrong product or if the product has been damaged.



How to return this product?

You need to request a return by calling Customer Service 19586



What are the required conditions?

Please see below conditions for your return request to be accepted:

- product must remain sealed, except if the product is defective or damaged

- product is still in its original packaging

- product is in its original condition and unused

- product is not damaged

- product label is still attached


The products in your possession are your responsibility until they are picked up by our driver or you have dropped it off at a pickup Station. Any product that is not properly packed or is damaged will not be eligible for a return, so make sure they are properly taken care of prior to the return!



What are the next steps?

Once your return request done, we will contact you to arrange retrieval of the product. You will also have the choice to deliver yourself the product to one of our pickup Stations.


Once the product retrieved, we will proceed to examination.

- In the unlikely event that an item is returned to us in an unsuitable condition, we will send it back to you without refund.

- If examination conclusive and conditions respected, we will proceed to refund within maximum 14 business days post retrieval product.