book

Advanced Topics in C: Core Concepts in Data Structures

Name: Advanced Topics in C: Core Concepts in Data Structures
Author: Noel Kalicharan
ISBN: 9781430264002

by Noel Kalicharan

October 2013

Intermediate to advanced

312 pages

8h 19m

English

Apress

Read now

Unlock full access

Title Page
Dedication
Contents at a Glance
Contents
About the Author
About the Technical Reviewer
Preface
CHAPTER 1: Sorting, Searching, and Merging
1.1 Sorting an Array: Selection Sort1.2 Sorting an Array: Insertion Sort1.3 Inserting an Element in Place1.4 Sorting an Array of Strings1.5 Sorting Parallel Arrays1.6 Binary Search1.7 Searching an Array of Strings1.8 Example: Word Frequency Count1.9 Merging Ordered Lists
CHAPTER 2: Structures
2.1 Defining Structures2.2 How to Declare a Structure2.3 Working with an Array of Structures2.4 Searching an Array of Structures2.5 Sorting an Array of Structures2.6 How to Read, Search, and Sort a Structure2.7 Nested Structures2.8 Working with Fractions2.9 A Voting Problem2.10 Passing Structures to Functions
CHAPTER 3: Pointers
3.1 Defining Pointers3.2 Passing Pointers as Arguments3.3 More on Passing an Array as an Argument3.4 Character Pointers3.5 Pointer Arithmetic3.6 Pointers to Structures3.7 Pointers to Functions3.8 Void Pointers

CHAPTER 4: Linked Lists
4.1 Defining Linked Lists4.2 Basic Operations on a Linked List 4.3 Dynamic Storage Allocation: malloc, calloc, sizeof, free4.4 Building a Linked List: Adding New Item at the Tail4.5 Insertion into a Linked List4.6 Building a Linked List: Adding a New Item at the Head4.7 Deletion from a Linked List4.8 Building a Sorted Linked List4.9 Example: Palindrome4.10 Saving a Linked List4.11 Arrays vs. Linked Lists4.12 Storing a Linked List Using Arrays4.13 Merging Two Sorted Linked Lists4.14 Circular and Two-Way Linked Lists
CHAPTER 5: Stacks and Queues
5.1 Abstract Data Types5.2 Stacks5.3 Creating a Stack Header File5.4 A General Stack Type5.5 Converting Infix to Postfix5.6 Queues
CHAPTER 6: Recursion
6.1 Recursive Definition6.2 Writing Recursive Functions in C6.3 Converting a Decimal Number to Binary Using Recursion6.4 Printing a Linked List in Reverse Order6.5 Towers of Hanoi6.6 Writing Power Functions6.7 Merge Sort6.8 static Variables6.9 Counting Organisms6.10 Finding a Path Through a Maze
CHAPTER 7: Random Numbers, Games, and Simulation
7.1 Random Numbers7.2 Random and Pseudorandom Numbers7.3 Generating Random Numbers by Computer7.4 A Guessing Game7.5 Drills in Addition7.6 Nim7.7 Non-uniform Distributions7.8 Simulation of Real-Life Problems7.9 Simulating a Queue7.10 Estimating Numerical Values Using Random Numbers
CHAPTER 8: Working with Files
8.1 Reading Data from a File8.2 Sending Output to a File8.3 Text and Binary Files8.4 Internal vs. External File Name8.5 fopen and fclose8.6 getc and putc8.7 feof and ferror8.8 fgets and fputs8.9 Input/Output for Binary File8.10 Random Access Files8.11 Indexed Files8.12 Updating a Random Access File
CHAPTER 9: Introduction to Binary Trees
9.1 Trees9.2 Binary Trees9.3 Traversing a Binary Tree9.4 Representing a Binary Tree9.5 Building a Binary Tree9.6 Binary Search Trees9.7 Building a Binary Search Tree9.8 An Array as a Binary Tree Representation9.9 Some Useful Binary Tree Functions9.10 Binary Search Tree Deletion
CHAPTER 10: Advanced Sorting
10.1 Heapsort10.2 Building a Heap Using siftUp10.3 Analysis of Heapsort10.4 Heaps and Priority Queues10.5 Sorting a List of Items with Quicksort10.6 Shell (Diminishing Increment) Sort
CHAPTER 11: Hashing
11.1 Hashing Fundamentals11.2 Solving the Search and Insert Problem by Hashing11.3 Resolving Collisions11.4 Example: Word Frequency Count
Index

Content preview from Advanced Topics in C: Core Concepts in Data Structures

Index

Advanced sorting See also Heapsort

nonrecursive quicksort

partition1 function

partitioning and pivot

partitioning—splitting

stage

shell (diminishing increment) sort

Binary search trees (BST)

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.

Read now

Unlock full access

More than 5,000 organizations count on O’Reilly

O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.

Julian F.

Head of Cybersecurity

I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.

Addison B.

Field Engineer

I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.

Amir M.

Data Platform Tech Lead

I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.

Mark W.

Embedded Software Engineer

Publisher Resources

ISBN: 9781430264002Purchase book

Cloud Computing

Data Engineering

Data Science

AI & ML

Programming Languages

Software Architecture

IT/Ops

Security

Design

Business

Soft Skills

Advanced Topics in C: Core Concepts in Data Structures

by Noel Kalicharan

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.