C语言数据结构与算法入门教程

PDF文件

5星 · 超过95%的资源 | 下载需积分: 10 | 1.06MB | 更新于2024-08-02 | 62 浏览量 | 举报收藏

立即下载

C_Data_Structure是一本介绍C语言编程中数据结构和算法基础知识的教程，由讲师Jack Straub编著。该版本为2.04草稿，版权日期为1996年至2002年。本书旨在引导读者理解基本的编程概念，并通过实例讲解如何在C语言环境中实现数据结构和算法。第1章概述了课程的核心内容，包括： 1.1 目标：介绍学习目标，如掌握C语言的数据类型、数组和指针等基本概念。 1.2 `typedef`：讲解typedef的作用，强调其对于提高程序可移植性和组织代码结构的重要性。分别介绍了typedef与portability（可移植性）、structures（结构体）以及functions（函数）的关系。 1.3 Pointers and Arrays：介绍了指针和数组的概念，强调它们在内存管理中的作用，以及如何通过动态内存分配来处理数据。 1.5 部分内容深入到了核心模块的构建： 1.5.1 私有头文件：讲解如何创建和维护私有接口，保护代码细节。 1.5.2 主要源文件：阐述主程序文件的组织结构，可能包含函数定义和主程序逻辑。 1.5.3 公共头文件：讨论如何创建公共接口，以便于其他模块调用。第2章着重讲解了双链表（Doubly Linked Lists）： 2.1 目标：学习如何设计和实现一个双链表数据结构，包括节点的定义和操作方法。 2.2 概述：介绍双链表的基本概念，它是线性数据结构的一种，支持双向链接。 2.3 定义：详细说明了enqueuable item（可入队项）、anchor（锚点）和doubly linked list（双链表）的定义。 2.3.4 Methods：列出了关键方法，如ENQ_create_list（创建新双链表）、ENQ_create_item（创建新可入队项）和ENQ_is_item_empty（判断链表是否为空），展示了如何实现链表的基本操作。通过这个概览，我们可以看出C_Data_Structure这本书旨在通过实际编程示例帮助读者掌握C语言的数据结构和算法基础，特别是针对初学者，通过逐步递进的方式，让学习者能够理解和应用这些概念到实际项目中。书中还注重代码组织和模块化，这对于编写高效、可维护的C程序至关重要。

C Programming: Data Structures and Algorithms, Version 2.04 DRAFT

Section 1: Basics 16 4/1/02

1.5 The Core Module

I am going to leave a formal definition of the term module for later. For now, let’s just

say that a module is a collection of related facilities, including functions, macros, and

data type declarations. A module consists of a minimum of three files, a private header

file, a public header file and a principal source file. In this section we will develop the

core module, which will contain a collection of facilities to assist us in writing code

throughout the remainder of the course. The name of the module will be CDA (short for

C: Data Structures and Algorithms) and will consist of the following three files:

• cdap.h (the private header file),

• cda.h (the public header file) and

• cda.c (the principal source file)

Figure 1-6: Cover routine for malloc

1.5.1 The Private Header File

The concept of a private header file will occupy much of our time later in the course. For

our first module it must be present (in this course every module must have a private

header file), but otherwise has little significance. It consists entirely of an include

sandwich (recall the every header file must have an include sandwich), and a statement to

include the public header file. It is shown in its entirety in Figure 1-7.

Figure 1-7: CDA Module Private Header File cdap.h

#include <stdlib.h>

void *PROJ_malloc( size_t size )

{

void *mem = malloc( size );

if ( mem == NULL && size > 0 )

abort();

return mem;

}

#ifndef CDAP_H /* begin include sandwich */

#define CDAP_H /* second line of include sandwich */

#include <cda.h> /* include public header file */

#endif /* end include sandwich */

C Programming: Data Structures and Algorithms, Version 2.04 DRAFT

Section 1: Basics 18 4/1/02

• CDA_TRUE and CDA_FALSE merely help to make our code more

readable by giving us symbolic names for Boolean values.

• CDA_ASSERT, for now, is a simple cover for the standard library assert

macro. On many projects it is common to use alternative assert macros

that provide more detailed feedback then the standard assert macro. We

are not going to do that now; we do, however, want to leave open the

possibility of doing it later. So we will write a macro to use in place of the

usual assert and use it in all of our projects; later, if we decide to write a

new version, all we will have to do is change cda.h and recompile our

code in order to take advantage of it. Here is an example of its use:

Instead of:

assert( size <= MAXIMUM_SIZE );

Use:

CDA_ASSERT( size <= MAXIMUM_SIZE );

• CDA_CARD is simply a generic implementation of the CARD macro that

we saw in Section 0. For example:

int inx = 0;

int iarr[10];

for ( inx = 0 ; inx < CDA_CARD( iarr ) ; ++inx )

iarr[inx] = -1;

• CDA_NEW is a macro to encapsulate what we call a new operation; that is,

the allocation of memory to serve as a data structure instance, or a

component of a data structure instance. For example:

Instead of:

ADDRESS_p_t address = CDA_malloc( sizeof(ADDRESS_t) );

Use:

ADDRESS_p_t address = CDA_NEW( ADDRESS_t );

• CDA_NEW_STR and CDA_NEW_STR_IF encapsulate the operations

needed to make a copy of a string. This is an important activity, because

what we call a string in C is merely the address of an array of type char. If

you try to store such an address in a data structure you leave yourself open

to problems because that memory typically belongs to someone else, and it

can be modified or deallocated at any time; so, before storing a string in a

data structure, you must be certain that it occupies memory that you

control. CDA_NEW_STR unconditionally makes a copy of a string;

CDA_NEW_STR_IF evaluates to NULL if the target string is NULL, and

to CDA_NEW_STR if the string is non-NULL. Here is an example of their

use:

剩余164页未读，继续阅读

posche123456789

粉丝: 0

C语言数据结构与算法入门教程

data_structure_c.rar_Datastructure_data_structure_c_二叉树_二叉树 c++_

Data_structure_and_algorithm_study.zip_C++_algorithms_data struc

Fundamentals_of_Data_Structure_in_C.pdf

Ctest_Data_Structure_0804_数据结构_源码.zip

classic_data_structure_and_algorithm：具有C ++实现的典型算法

Advanced_data_structure

Dynamic_Data_Structure_library:此仓库用作SDLC文档，收集动态数据结构库设计代码

C++_data structure7

单链表SingleLinkedList.zip_data structure

data_structure_in_C.zip_iran

最新资源