Introducing Algorithms in C : A Step by Step Guide to Algorithms in C
Luciano Manelli
Sold by AHA-BUCH GmbH, Einbeck, Germany
AbeBooks Seller since August 14, 2006
New - Soft cover
Condition: New
Quantity: 1 available
Add to basketSold by AHA-BUCH GmbH, Einbeck, Germany
AbeBooks Seller since August 14, 2006
Condition: New
Quantity: 1 available
Add to basketnach der Bestellung gedruckt Neuware - Printed after ordering - 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, you'll 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 ForPrimarily 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.
Seller Inventory # 9781484256220
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, you’ll 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
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.
"About this title" may belong to another edition of this title.
General Terms and Conditions and Customer Information / Privacy Policy
I. General Terms and Conditions
§ 1 Basic provisions
(1) The following terms and conditions apply to all contracts that you conclude with us as a provider (AHA-BUCH GmbH) via the Internet platforms AbeBooks and/or ZVAB. Unless otherwise agreed, the inclusion of any of your own terms and conditions used by you will be objected to
(2) A consumer within the meaning of the following regulations is any natural person who concludes...
More InformationWe ship your order after we received them
for articles on hand latest 24 hours,
for articles with overnight supply latest 48 hours.
In case we need to order an article from our supplier our dispatch time depends on the reception date of the articles, but the articles will be shipped on the same day.
Our goal is to send the ordered articles in the fastest, but also most efficient and secure way to our customers.