Introducing algorithms in C : a step-by-step guide to algorithms in C / Luciano Manelli
By: Manelli, Luciano.
Contributor(s): Ohio Library and Information Network.
Publisher: [Place of publication not identified] : Apress, ©2020Description: 146 p.Content type: text Media type: computer Carrier type: online resourceISBN: 9781484256220.Subject(s): C (Computer program language) | Computer algorithmsGenre/Form: Print books.Current location | Call number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|
On Shelf | QA76.73.C15 M35 2020 (Browse shelf) | Available | AU00000000016974 |
Browsing Alfaisal University Shelves , Shelving location: On Shelf Close shelf browser
No cover image available | ||||||||
QA76.73.C15 D44 2022 C : how to program / | QA76.73.C15 G87 2020 Modern C / | QA76.73.C15 K36 2018 Let us C : / AUTHENTIC Guide To C PROGRAMMING Language. | QA76.73.C15 M35 2020 Introducing algorithms in C : a step-by-step guide to algorithms in C / | QA76.73.C15 S417 2020 Effective C : an introduction to professional C programming / | QA76.73 .C153 2017 Sams teach yourself C++ in 24 hours / | QA76.73 .C153 2021 Exploring C++20 : the programmer's introduction to C++ / |
Includes index
1. Data Structures -- 2. Design of Algorithms -- 3. Implementation of Algorithms in C
Available to OhioLINK libraries
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