Aditya bhargava (86 risultati)

Paperback. Condizione: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority.

Condizione: Acceptable. Item in acceptable condition! Textbooks may not include supplemental items i.e. CDs, access codes etc.

Condizione: Very Good. Item in very good condition! Textbooks may not include supplemental items i.e. CDs, access codes etc.

Condizione: Good. Good condition ex-library book with usual library markings and stickers.

Condizione: Good. Item in good condition. Textbooks may not include supplemental items i.e. CDs, access codes etc.

Paperback. Condizione: Good. DESCRIPTION Algorithms nothing more than step-by-step procedures for solving problems and most algorithms used by programmers have already been discovered, tested, and proven. Those wanting to take a hard pass on Knuth's brilliant but impenetrable theories, and the dense multi-page proofs found in most textbooks, will want to read Grokking Algorithms. This fully-illustrated and engaging guide makes it easy to learn how to use algorithms effectively.   Grokking Algorithms is a disarming take on a core computer science topic and shows readers how to apply common algorithms to practical problems faced in the day-to-day life of a programmer. It starts with problems like sorting and searching and builds up skills in thinking algorithmically. Then it tackles more complex concerns such as data compression or artificial intelligence. Whether writing business software, video games, mobile apps, or system utilities, readers will learn algorithmic techniques for solving problems that they thought were out of reach. By the end of this book, they will know some of the most widely applicable algorithms, as well as how and when to use them.   KEY SELLING POINTS   Disarming take on a core computer science topic Carefully presented examples Helpful diagrams and fully annotated code samples   AUDIENCE This easy-to-read, picture-heavy introduction is suitable for self-taught programmers, engineers, or anyone who wants to brush up on algorithms. Code examples are written in Python.   ABOUT THE TECHNOLOGY Algorithms are nothing more than step-by-step procedures for solving problems. They can make writing code faster, or make it possible to write code that might not have been able to be written without them.…

Paperback. Condizione: Very Good. DESCRIPTION Algorithms nothing more than step-by-step procedures for solving problems and most algorithms used by programmers have already been discovered, tested, and proven. Those wanting to take a hard pass on Knuth's brilliant but impenetrable theories, and the dense multi-page proofs found in most textbooks, will want to read Grokking Algorithms. This fully-illustrated and engaging guide makes it easy to learn how to use algorithms effectively.   Grokking Algorithms is a disarming take on a core computer science topic and shows readers how to apply common algorithms to practical problems faced in the day-to-day life of a programmer. It starts with problems like sorting and searching and builds up skills in thinking algorithmically. Then it tackles more complex concerns such as data compression or artificial intelligence. Whether writing business software, video games, mobile apps, or system utilities, readers will learn algorithmic techniques for solving problems that they thought were out of reach. By the end of this book, they will know some of the most widely applicable algorithms, as well as how and when to use them.   KEY SELLING POINTS   Disarming take on a core computer science topic Carefully presented examples Helpful diagrams and fully annotated code samples   AUDIENCE This easy-to-read, picture-heavy introduction is suitable for self-taught programmers, engineers, or anyone who wants to brush up on algorithms. Code examples are written in Python.   ABOUT THE TECHNOLOGY Algorithms are nothing more than step-by-step procedures for solving problems. They can make writing code faster, or make it possible to write code that might not have been able to be written without them.…

Soft cover. Condizione: Fair. 1st Edition. Coffee stain to page tail. Bleeds into pages but there is no waviness. Pages are clean and unmarked. Covers are in great shapes with sharp corners.

Paperback. Condizione: Very Good. Connecting readers with great books since 1972! Used books may not include companion materials, and may have some shelf wear or limited writing. We ship orders daily and Customer Service is our top priority.

Paperback. Condizione: Very good. Octavo, 238 pages. Firm binding; no loose pages. Book and cover with minimal wear.

Condizione: good. This book is in good condition, with minimal signs of wear and tear.

Paperback. Condizione: Good. 1st. Ships same day or next business day! UPS shipping available (Priority Mail for AK/HI/APO/PO Boxes). Used sticker and some writing and/or highlighting. Used books may not include working access code or dust jacket.

paperback. Condizione: Very Good.

paperback. Condizione: Very Good. Manning, c.2016, 3rd.trade paperbk.prtg., 238p., VG $.

Paperback. Condizione: Very Good. 2nd. It's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting.

Condizione: As New. Unread copy in mint condition.

Condizione: New. Brand New.

Condizione: New. New.

paperback. Condizione: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority.

Condizione: new.

paperback. Condizione: New. Ship within 24hrs. 100% Satisfaction is Our #1 Goal.

Condizione: very good. Gut/Very good: Buch bzw. Schutzumschlag mit wenigen Gebrauchsspuren an Einband, Schutzumschlag oder Seiten. / Describes a book or dust jacket that does show some signs of wear on either the binding, dust jacket or pages.

paperback. Condizione: New. Brand new book, sourced directly from publisher. Dispatch time is 24-48 hours from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely.

Condizione: New.

Condizione: new. Pages: 352 Language: Russian. Algoritmy - eto poshagovye instruktsii reshenija zadach, bolshinstvo iz kotorykh uzhe byli kem-to resheny, protestirovany i dokazali svoju effektivnost. Vtoroe izdanie "Grokaem algoritmy" uproschaet izuchenie, ponimanie i ispolzovanie algoritmov. V etoj knige vy najdete prostye i vnjatnye objasnenija, bolee 400 zabavnykh illjustratsij i desjatki primerov. Ee chtenie - luchshij sposob raskryt vsju mosch algoritmov i podgotovitsja k intervju po programmirovaniju. Glubokikh znanij matematiki ne trebuetsja! Vy uznaete o glavnykh algoritmakh, pozvoljajuschikh uskorit rabotu programm, uprostit kod i reshit rasprostranennye problemy programmirovanija. Nachnite s sortirovki i poiska, a zatem razvivajte svoi navyki dlja reshenija slozhnykh zadach, takikh kak szhatie dannykh i iskusstvennyj intellekt. Nauchites sravnivat effektivnost razlichnykh algoritmov. Vo vtorom izdanii dany novye bolee podrobnye opisanija derevev, NP-polnye zadachi, a kod primerov obnovlen na Python 3. Pora grokat algoritmy po-novomu! 9785446141722.…

Condizione: As New. Unread book in perfect condition.

PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

Soft cover. Condizione: New. 2nd Edition.

Paperback. Condizione: USED BOOKS. USED BOOKS ! Fast Delivery This is an International Edition and ship within 24-48 hours. Deliver by FedEx and Dhl, & Aramex, UPS, & USPS and we do accept APO and PO BOX Addresses. Order can be delivered worldwide within 6-10 days and we do have flat rate for up to 2LB. Extra shipping charges will be requested if the Book weight is more than 5 LB. This Item May be shipped from India, United states & United Kingdom. Depending on your location and availability.…