Introducing Algorithms in C

Name: Introducing Algorithms in C
Brand: Springer Nature
SKU: 9781484256220
Availability: InStock

Best Price (Coupon Required):
Buy Introducing Algorithms in C for $31.50 at @ Link.springer.com when you apply the 10% OFF coupon at checkout.
Click “Get Coupon & Buy” to copy the code and unlock the deal.

Set a price drop alert to never miss an offer.

1 Offer Price Range: $34.99 - $34.99

BEST PRICE

Single Product Purchase

$31.50

@ Link.springer.com with extra coupon

Price Comparison

Seller	Contact Seller	List Price	On Sale	Shipping	Best Promo	Final Price	Volume Discount	Financing	Availability	Seller's Page
BEST PRICE 1 Product Purchase @ Link.springer.com		$34.99	$34.99		10% OFF This deals requires coupon	$31.50		See Site	In stock	Visit Store

Product Details

Brand

Springer Nature

Manufacturer

N/A

Part Number

GTIN

9781484256220

Condition

New

Product Description

Study elementary and complex algorithms with clear examples and implementations in C. This book introduces data types (simple and structured) and algorithms with graphical and textual explanations. In the next sections, youll cover simple and complex standard algorithms with their flowcharts: everything is integrated with explanations and tables to give a step-by-step evolution of the algorithms. The main algorithms are: the sum of three or n numbers in a loop, decimal-to-binary conversion, maximum and minimum search, linear/sequential search, binary search, bubble sort, selection sort, merging of two sorted arrays, reading characters from a file, stack management, and factorial and Fibonacci sequences. The last section of Introducing Algorithms in C is devoted to the introduction of the C language and the implementation of the code, which is connected to the studied algorithms. The book is full of screenshots and illustrations showingthe meaning of the code. What You Will Learn Implement algorithms in C Work with variables, constants, and primitive and structured types Use arrays, stacks, queues, graphs, trees, hash tables, records, and files Explore the design of algorithms Solve searching problems, including binary search, sorting, and bubble/selection sort Program recursive algorithms with factorial functions and Fibonacci sequences Who This Book Is For Primarily beginners: it can serve as a starting point for anyone who is beginning the study of computer science and information systems for the first time.

Available Colors

N/A

Available Sizes

N/A