文件名 文件描述 浏览
◆ A 2D Array Implemented as a Queue.htm

2D Array Implemented as a Queue

作为队列来实现2维的数组

浏览
◆ A 2D Array Implemented as a Stack.htm

2D Array Implemented as a Stack (array notation)

作为堆栈(阵列符号)来实现2维的数组

浏览
◆ A 2DArray Implemented .htm

A 2DArray Implemented as a Stack(pointer notation)

作为堆栈(指针符号)来实现2维的数组

浏览
◆ AI for dummies .htm

Ok, so I had a "way cool" example of demonstrating the basic concept of neural networks up here and some people didn't seem to get it. And whats more? they started insulting and accusing me. Well I had to protect my dignity here. I am a PhD student backin

有关神经网络基本概念的介绍

浏览
◆ Allocate an array .htm

Monthly Checkbook Program

根据用户的输入来分配一个数组

浏览
◆ Asociative Array.htm

(I purposely misspelled this because it would not let me submit my code with word "a(double s)" )This code implements aszociative arrays in C++. An aszociative array is an array, whose values can be refrenced by passing a string. For example, you can say

数组的值可以通过字符串来引用

浏览
◆ AVL Tree and Data File.htm

This program creates an efficient search data structure without random access whose balance factor can never be more than |1|. The program can traverse inorder, preorder, & postorder. In addition, the following operations may be performed on a node: searc

有效的搜索数据结构

浏览
◆ Balancing an AVL tree on fly.htm

it balances an AVL tree on the fly. that is the balance of the tree is maintained whenever you insert or delete something. so it reduces the search complexity

在插入和删除的时候维持树的平衡

浏览
◆ Binary Search Tree.htm

This program implements a doubly linked list as a binary search tree and includes functions to: traverse inorder, preorder & postorder, insert and delete a node, search for a node, and count the height of a given leaf

二进制搜索树

浏览
◆ Bitset tutorial.htm

Demonstration of the use of C++'s bitset

C++位集的使用指南

浏览
◆ Char Int Conversions.htm

Takes a random array of either integers or characters and converts them to the opposite, integer or character arrays. This program is created to help show YOU how to convert between int and char data types, with a simple type-casting, no need for any buil

实现一个随机整数数组或字符数组的互换

浏览
◆ David Nugent's.htm

Implementation of class node, list & iteratorDavid Nugent

链表容器类

浏览
◆ Double ended queue functions.htm

Generic double ended queue (Deque pronounced DEK) for handling any data types, with sorting. By use of various functions in this module the caller can create stacks, queues, lists, doubly linked lists, sorted lists, indexed lists. All lists

能够处理各种数据类型的双向队列

浏览
◆ Double linked lists.htm

This generic doubly linked-list code includes an iterator. very useful, fast and cheap. It is a template not a void* list so your compiler must support templates... New update, minor bugfixes

很有用的双向链表

浏览
◆ Doubly linked list BLOB functions.htm

Generic Doubly Linked Lists for Binary Large OBjects. Linked Lists for variable size data-items. This is a 'front end' for the generic LLD module

双向链表BLOB函数

浏览
◆ Doubly linked list functions.htm

Generic Doubly Linked List for fixed size data-items

固定大小的双向链表

浏览
◆ Doubly Linked List Template.htm

Template for a doubly linked-list data structure, can be used also for queues and stacks

能用于队列和堆栈的双向链表模板

浏览
◆ DynArray.htm

A light weight dynamic array class for C++ developers who always had an urge to do something like int a[n]; supports lossless resize operations on the array

为C++开发者的动态数组类

浏览
◆ Hash table functions.htm

Hash table management by Jerry Coffin, with improvements by HenkJan Wolthuis

哈希表函数

浏览
◆ Hilobyte.H.htm

Extract high, low bytes from an int

从一个整数中得到高位和低位字节

浏览
◆ Link list (queue).htm

produces a link list as a queue. it is part of my billing project and so uses order placing. nothing complicated

产生作为队列的链表

浏览
◆ Linked Lists through user input.htm

This will create a linked list through user input, and will output the linked list. This is to help you how to get linked list through user input, instead of writing it out the long way. This can be useful for those of you in high school who will be takin

通过用户输入来创建一个链表并可输出

浏览
◆ LLL implemented as a Queue.htm

This program illustrates using a self-referential list of structures implemented as a queue

作为一个队列来执行的LLL链表

浏览
◆ Matrices.htm

The Purpost of my example is to show how Matries are used. Matrices are a two point array ex: array[2][2]; . This is very usefully because even more data can be held in one varible/array. This example also shows nested loops and a do/while loop

关于矩阵用法的实例

浏览
◆ Multi-dimensional array allocation.htm Allocates a multidimensional array dynamically, at runtime, so that 1: its elements can be accessed using multiple indirection 2: it can be deallocated using a call to the standard free() function Note: On PC's the max array size is 64K Paul Schlyter在PC机上小于64K的多维数组的动态分配 浏览
◆ Multi-dimentional array .htm

mdalloc - a multi dimensional array allocator mdfree - a companion function to mdalloc for freeing storage synopsis: void *mdalloc(int ndim, int width, ...); where: ndim: number of array dimensions width: size of elements in array

任意大小的多维数组的内存分配和释放

浏览
◆ Palindrome tester.htm

This program is a homework assignment CS freshman course at Widener University. It asks you to enter a string of text and then tells you number of characters of that string and whether the string a palindrome or not. (Palindrome is text that reads same ba

有关字符的Palindrome测试器

浏览
◆ Self referential .htm

LLL implemented as a Stack

作为堆栈使用的LLL链表

浏览
◆ Simple phone number database.htm

This is a simple example of capturing data into a record and then displaying it, which explores the joys of structure passing and access in Visual C++

.简单的电话号码数据库

浏览
◆ Binary Large OBjects.htm

Generic Singly Linked List for Binary Large OBjects. Linked Lists for variable size data-items. v1.00 94-08-11 - Based on the LLS module for fixed size data-items

通用的单向Binary Large OBjects链表

浏览
◆ Singly linked list functions.htm

Generic Singly Linked Lists for fixed size data. Each List has its own specific data size. This version uses a dummy head node, which prevents special handling of the first node

通用的固定大小单向链表函数

浏览
◆ Stack management functions.htm

Many times I wanted to have one or more stacks for the program I was working on

堆栈管理函数

浏览
◆ Stack management.htm

Stack for variable sized items. Implemented by making a stack of 'Blob Descriptors' and duplicating the item in malloc'ed memory. Localizing the stack number storage required interface functions to the stack module. The Pop function has two 'mo

用于Binary Large OBjects的堆栈管理函数

浏览
◆ Stack managment functions.htm

Stack manager - init, push, pop, count

能初始化,弹入和弹出等的堆栈管理函数

浏览
◆demonstrating array sorting.htm

MDASORT.C - Test program for mdalloc()/amalloc() demonstrating sorting用 mdalloc()/amalloc()

来演示排序的测试程序

浏览
◆ What is a linked list.htm

An introduction to linked lists for beginners. I know there are already some. I guess it won't hurt to have another

适合于初学者的链表介绍

浏览