Introducing Algorithms in C: A Step by Step Guide to Algorithms in C [NulledPremium]

For More Ebooks Visit NulledPremium >>> NulledPremium.com



Book details
File Size: 2.78 MB
Format: pdf
Print Length: 146 pages
Publisher: Apress; 1st ed. edition (January 28, 2020)
Publication Date: January 28, 2020
Sold by: Amazon.com Services LLC
Language: English
ASIN: B084C2V5TV

Description
Introducing Algorithms in C: A Step by Step Guide to Algorithms in C



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 showing the 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.

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