null
Loading... Please wait...
FREE SHIPPING on All Unbranded Items LEARN MORE
Print This Page

Recursion (Mathematics and Python)

List Price: $140.99
SKU:
9781041149538
Quantity:
Minimum Purchase
25 unit(s)
  • 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
FULL DETAILS
  • 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:
    Yung-Hsiang Lu, George K. Thiruvathukal
    Format:
    Hardcover
    Pages:
    236
    Publisher:
    CRC Press (August 18, 2026)
    Imprint:
    CRC Press
    Language:
    English
    Audience:
    Professional and scholarly
    ISBN-13:
    9781041149538
    Weight:
    23.375oz
    Dimensions:
    6.125" x 9.1875"
    File:
    TAYLORFRANCIS-TayFran_260908042219609-20260908.xml
    Folder:
    TAYLORFRANCIS
    List Price:
    $140.99
    Country of Origin:
    United States
    Pub Discount:
    30
    As low as:
    $133.94
    Publisher Identifier:
    P-CRC
    Discount Code:
    H
  • Overview

    Designed to help readers develop a clear and systematic understanding of recursion as both a mathematical concept and a programming technique. The book emphasizes recursive thinking: how complex problems can be expressed, analyzed, and solved by breaking them into simpler instances of similar structures.