⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 listings.html

📁 Data Structure Ebook
💻 HTML
字号:
<html><head>
<HTML><HEAD>
<TITLE>Data Structures and Algorithms: Source Listings</TITLE>

<META name="description" content="Data Structures and Algorithms Course Notes,
PLDS210 University of Western Australia">
<META name="keywords" content="data structures,algorithms,abstract data types,
ANSI C, source code">
</HEAD>
<BODY BGCOLOR="#ffffff">
<TABLE BGCOLOR="#00c0f0" WIDTH="100%" CELLSPACING=0 CELLPADDING=0>
<TR BGCOLOR="#00f0f0"><TD ALIGN=right>
<H3><I>Data Structures and Algorithms</I></H3></TD></TR>


<TR><TD><H2>Appendix B: Source Code Listings</H2></TD></TR>
</TABLE>
<P>
This section collects references to all the source code listings
inserted in other parts of the notes in one place.

<CENTER>
<TABLE BORDER CELLPADDING=4>
<TR><TH>Listing</TH><TH>Description</TH></TR>
<TR>
<TD><A HREF="collection.h" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/source/collection.h">collection.h</A></TD>
<TD>Generic collection specification</TD>
</TR>
<TR>
<TD><A HREF="collection.c" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/source/collection.c">collection.c</A></TD>
<TD>Array implementation of a collection</TD>
</TR>
<TR>
<TD><A HREF="collection_ll.c" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/source/collection_ll.c">collection_ll.c</A></TD>
<TD>Linked list implementation of a collection</TD>
</TR>
<TR>
<TD>
<A HREF="coll_a.h" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/source/coll_a.h">coll_a.h</A><BR>
<A HREF="coll_at.c" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/source/coll_at.c">coll_at.c</A><BR>
</TD>
<TD>Collection with ordering function set on construction<BR>
Implementation for a tree</TD>
</TR>
<TR>
<TD><A HREF="binsearch.c" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/source/binsearch.c">binsearch.c</A></TD>
<TD>Binary search</TD>
</TR>

<TR>
<TD>
<A HREF="tree_struct.c" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/source/tree_struct.c">tree_struct.c</A><BR>
<A HREF="tree_add.c" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/source/tree_add.c">tree_add.c</A><BR>
<A HREF="tree_find.c" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/source/tree_find.c">tree_find.c</A><BR>
</TD>
<TD>Trees</TD>
</TR>

<TR>
<TD>
<A HREF="heap_delete.c" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/source/heap_delete.c">heap_delete.c</A><BR>
</TD>
<TD>Heaps
</TD>
</TR>
<TR>
<TD><A HREF="RadixSort.h" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/source/RadixSort.h">RadixSort.h</A><BR>
<A HREF="RadixSort.c" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/source/RadixSort.c">RadixSort.c</A><BR>
<A HREF="Bins.h" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/source/Bins.h">Bins.h</A><BR>
<A HREF="Bins.c" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/source/Bins.c">Bins.c</A><BR>
</TD>
<TD>Radix Sort</TD>
</TR>
<TR>
<TD><A HREF="optbin.c" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/source/optbin.c">optbin.c</A>
</TD>
<TD>Optimal binary search tree</TD>
</TR>

</TABLE>
</CENTER>

<P>

<TABLE CELLPADDING=5 WIDTH="100%" BGCOLOR="#00f0f0" CELLSPACING=0>
<TR><TD>
Back to the <A HREF="ds_ToC.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/ds_ToC.html">Table of Contents</A>
</TD></TR></TABLE>
<SMALL>
&copy; <A HREF=mailto:morris@ee.uwa.edu.au>John Morris</A>, 1998
</SMALL>
</BODY>
</HTML>



⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -