//顺序表的建立、查找、插入与删除 #include <stdio.h> #include <malloc.h> #include <stdlib.h> #define ListSize 100 //表最大长度 //结构定义 typedef struct SeqList { int node[ListSize] //存放表结点 int length //当前表长度 } SeqList //插入元素 insertList(SeqList *List, int e) { int i=List->length-1 //先将i指定为最后一项 if(i>=ListSize-1) //表已经达到最大长度ListSize { printf("表已满，不能增加新的项!\n")
上传时间： 2014-01-17
上传用户：dongqiangqiang
Memory Management—Algorithms and implementation in C/C++ Introduction Chapter 1 - Memory Management Mechanisms Chapter 2 - Memory Management Policies Chapter 3 - High-Level Services Chapter 4 - Manual Memory Management Chapter 5 - Automatic Memory Management Chapter 6 - Miscellaneous Topics Index List of Figures List of Tables List of Case Studies List of Sidebars
标签： Memory implementation Introduction Management
上传时间： 2013-12-25
上传用户：541657925
Connector/Net 5.0.6 Release Notes --- --- --- Welcome to the release notes for Connector/Net 5.0.6. Important Changes --------------------- There are no major changes in this version. Please see the changelog for the List of bugs fixed.
标签： Connector Net Release Welcome
上传时间： 2013-12-16
上传用户：zyt
This is GPS Matlab findPreambles finds the first preamble occurrence in the bit stream of each channel. The preamble is verified by check of the spacing between preambles [6sec] and parity checking of the first two words in a subframe. At the same time function returns List of channels, that are in tracking state and with valid preambles in the nav data stream.
标签： findPreambles occurrence the preamble
上传时间： 2013-12-23
上传用户：秦莞尔w
能添加删除通讯录，简单的通讯录模板，3个界面，welcome caverns；add form；phone List。
上传时间： 2014-08-24
上传用户：从此走出阴霾
Write a program to decide if a graph has a cycle or not. The given graph can be a directed or undirected graph, which is indicated at the time of reading the input (0 for directed graph and 1 for undirected graphs). The input is given as an adjacency List.
标签： graph directed program decide
上传时间： 2013-12-23
上传用户：cursor
Edge Disjoint Cycles. You are given an input graph that is either directed or undirected. Write a program that reads in a vertex number and Lists the number of edge disjoint cycles that start and end at this vertex. The output should also List the edges in each of the cycle discovered. Input will be the adjacency matrix preceded by a 0 or 1 representing Directed or Undirected graphs respectively.
标签： undirected Disjoint directed Cycles
上传时间： 2017-04-08
上传用户：13188549192
Urwid is a Python library for making text console applications. It has many features including fluid interface resizing, support for UTF-8 and CJK encodings, standard and custom text layout modes, simple markup for setting text attributes, and a powerful, dynamic List box that handles a mix of widget types. It is flexible, modular, and leaves the developer in control.
标签： applications including features console
上传时间： 2013-12-16
上传用户：refent
This document specifies a subset of the C programming language which is intended to be suitable for embedded automotive systems up to and including safety integrity level 3 (as defined in the MISRA Guidelines). It contains a List of rules concerning the use of the C programming language together with justifications and examples.
标签： programming specifies document language
上传时间： 2013-12-11
上传用户：cursor
program which uses hashing techniques for storing and retrieving the data. Input to the program: Some random numbers. Input will be from a file. Output: First the program reads all the input and store it properly using some hash techniques. Once your program reads the complete input,it waits for the user input (prompt to the user). User now enters some number.program displays if this number exists in the List or not. it also display the time taken in the search operation.
标签： program techniques retrieving the
上传时间： 2017-04-27
上传用户：shus521
