Skip to main content
SpringerLink
Log in
Apress
Book cover

Introducing Algorithms in C

A Step by Step Guide to Algorithms in C

  • Book
  • © 2020

Overview

Authors:
  1. Luciano Manelli

    1. Taranto, Italy

    View author publications

    You can also search for this author in PubMed   Google Scholar

  • A unique pocket book to learning and using algorithms in C programming language

  • Useful for both professionals and computer science students

  • Contains step-by-step explanations of each algorithm

  • 7333 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 34.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 44.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (3 chapters)

  1. Front Matter

    Pages i-xiii
    Download chapter PDF

  2. Data Structures

    • Luciano Manelli
    Pages 1-12

  3. Design of Algorithms

    • Luciano Manelli
    Pages 13-68

  4. Implementation of Algorithms in the C Programming Language

    • Luciano Manelli
    Pages 69-141

  5. Back Matter

    Pages 143-146
    Download chapter PDF
Back to top

Keywords

About this book

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. 

 


Authors and Affiliations

  • Taranto, Italy

    Luciano Manelli

About the author

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.  

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation