Pointers in C Programming

Gain a better understanding of pointers, from the basics of how pointers function at the machine level, to using them for a variety of common and advanced scenarios. This short contemporary guide book on pointers in C programming provides a resource for professionals and advanced students needing in-depth hands-on coverage of pointer basics and advanced features. It includes the latest versions of the C language, C20, C17, and C14.

You'll see how pointers are used to provide vital C features, such as strings, arrays, higher-order functions and polymorphic data structures. Along the way, you'll cover how pointers can optimize a program to run faster or use less memory than it would otherwise.

There are plenty of code examples in the book to emulate and adapt to meet your specific needs.

What You Will Learn

• Work effectively with pointers in your C programming
• Learn how to effectively manage dynamic memory
• Program with strings and arrays
• Create recursive data structures

• Implement function pointers Who This Book Is For
  Intermediate to advanced level professional programmers, software developers, and advanced students or researchers. Prior experience with C programming is expected.

  Focuses exclusively on pointers in C programming Reduce your software or firmware application's memory footprint and optimize its performance Written by an an expert computational scientist and teacher with expertise in C and R

  Autorentext
  Thomas Mailund is an associate professor in bioinformatics at Aarhus University, Denmark. He has a background in math and computer science, including experience programming and teaching in the C and R programming languages. For the last decade, his main focus has been on genetics and evolutionary studies, particularly comparative genomics, speciation, and gene flow between emerging species.

  Inhalt
  1: Introduction.- 2: Memory, Objects, and Addresses.- 3: Pointers.- 4: Pointers and Types.- 5: Arrays.- 6: Working with Arrays.- 7: Strings.- 8: Substrings Through Ranges.- 9: Dynamic Memory Management.- 10: Generic Dynamic Arrays.- 11: Singly-linked Lists.- 12: Search Trees.- 13: Function Pointers.- 14: Generic Lists and Trees.- 15: Reference Counting Garbage Collection.- 16: Allocation Pools.- 17: Conclusions.