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

A Step by Step Guide to Algorithms in C
 
 
Apress
  • erscheint ca. am 24. März 2020
 
  • Buch
  • |
  • Softcover
  • |
  • 137 Seiten
978-1-4842-5622-0 (ISBN)
 

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.

1st ed.
  • Englisch
  • CA
  • |
  • USA
  • Für Beruf und Forschung
  • 70 s/w Abbildungen
  • |
  • 5 Illustrations, color; 66 Illustrations, black and white; XIV, 137 p. 71 illus., 5 illus. in color.
  • Höhe: 23.5 cm
  • |
  • Breite: 15.5 cm
978-1-4842-5622-0 (9781484256220)
10.1007/978-1-4842-5623-7
weitere Ausgaben werden ermittelt
Luciano Manelli is a professionally certified engineer and author of several IT books for different publishers. In 2014 he started working for the Taranto Port Authority, after working for 13 years for InfoCamere SCpA. In 2012, he received a PhD in computer science from the Department of Informatics, University of Bari Aldo Moro. In his doctoral thesis, he analyzed grid computing and distributed abstract state machines and published the results in international publications. He is a contract professor at the Polytechnic of Bari (foundations of computer science) and at the University of Bari Aldo Moro (programming for the Web, computer science, and computer lab). He graduated in electronic engineering from the Polytechnic of Bari at 24 years of age and then served as an officer in the navy.
1. Data Structures2. Design of Algorithms3. Implementation of 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.

You will:

- 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
DNB DDC Sachgruppen

Noch nicht erschienen

29,95 €
inkl. 7% MwSt.
Vorbestellen