
C语言
谦谦志成
管理+技术
展开
-
直接插入排序
#include "stdio.h"#include "malloc.h"#define MAX 100typedef int keyType;typedef int DateType;typedef struct{ int key; int info;}RecordNode;typedef struct{ RecordNode record[MAX]; int n;}So...原创 2010-10-11 13:50:12 · 93 阅读 · 0 评论 -
链表 队列
#include "stdio.h"#include "malloc.h"typedef struct Node{ int info; Node *link;}*PNode;typedef struct LinkQueue{ PNode f; PNode r;}*PLinkQueue;PLinkQueue createEmpty_link(){ PLinkQueue ...原创 2010-10-11 13:51:27 · 118 阅读 · 0 评论 -
顺序队列
#include "stdio.h"#include "malloc.h"#define MAX 100typedef struct SeqQueue{ int q[MAX]; int f,r;}*PSeqQueue;PSeqQueue createEmpty_seq(){ PSeqQueue paqu; paqu=(PSeqQueue)malloc(sizeof(SeqQ...原创 2010-10-11 13:52:13 · 102 阅读 · 0 评论 -
链式栈
#include "stdio.h"#include "malloc.h"typedef struct Node{ int info; Node *link;}*PNode;typedef struct LinkStack{ PNode top;}*PLinkStack;PLinkStack createEmpty_link(){ PLinkStack plastack; ...原创 2010-10-11 13:53:00 · 107 阅读 · 0 评论 -
顺序栈
#include "stdio.h"#include "malloc.h"#define MAX 100typedef struct SeqStack{ int s[MAX]; int t;}*PSeqStack;PSeqStack createEmptyStack_seq(){ PSeqStack pastack; pastack=(SeqStack*)malloc(si...原创 2010-10-11 13:53:37 · 112 阅读 · 0 评论 -
数据结构—单向链表
#include <stdio.h>#include <malloc.h>typedef struct Node{ int data; struct Node *next;}Node,*linklist;linklist create(int n){ int i; linklist head,p; for(i=0;i<n;++i) ...原创 2010-10-11 13:56:29 · 114 阅读 · 0 评论