- Home
- Juvenile Nonfiction
- Computers
- Completing Tasks (Using Algorithms) - 9781502629852
Completing Tasks (Using Algorithms) - 9781502629852
List Price:
$30.21
- Availability: Confirm prior to ordering
- Branding: minimum 50 pieces (add’l costs below)
- Check Freight Rates (branded products only)
Branding Options (v), Availability & Lead Times
- 1-Color Imprint: $2.00 ea.
- Promo-Page Insert: $2.50 ea. (full-color printed, single-sided page)
- Belly-Band Wrap: $2.50 ea. (full-color printed)
- Set-Up Charge: $45 per decoration
- Availability: Product availability changes daily, so please confirm your quantity is available prior to placing an order.
- Branded Products: allow 10 business days from proof approval for production. Branding options may be limited or unavailable based on product design or cover artwork.
- Unbranded Products: allow 3-5 business days for shipping. All Unbranded items receive FREE ground shipping in the US. Inquire for international shipping.
- RETURNS/CANCELLATIONS: All orders, branded or unbranded, are NON-CANCELLABLE and NON-RETURNABLE once a purchase order has been received.
Product Details
Author:
Derek L. Miller
Format:
Hardcover
Pages:
32
Publisher:
Cavendish Square Publishing, LLC (December 30, 2017)
Language:
English
ISBN-13:
9781502629852
ISBN-10:
1502629852
Weight:
9.28oz
Dimensions:
7.125" x 8.5"
File:
ROSEN-Rosen Master 020924-20240209-1.xml
Folder:
ROSEN
List Price:
$30.21
Series:
Everyday Coding
As low as:
$25.98
Publisher Identifier:
P-ROSEN
Discount Code:
C
Pub Discount:
62
Overview
At their most complex, algorithms are the step-by-step processes behind search engines, data compression, and more. However, algorithms are present in basic forms throughout our daily lives, like following a recipe or giving directions to your house. This book explains algorithms in understandable terms and provides examples of algorithms outside of computer science. It describes how algorithms help computer programs complete tasks and challenges readers to think critically about the effectiveness of particular algorithms over others.
