相关文档

• 数字逆序输出栈实现C语言代码.docx

  define _CRT_SECURE_NO_WARNINGSinclude<>include<>define N 50struct mystack{int topint date[N]}struct mystack selfstack = { -1 { 0 } }int isempty()void setempty()int push(int num)int pop()int isempty

• c源代码下栈的实现.doc

  #

• 顺序栈c实现.docx

  顺序栈c实现SqStack.hinclude <iostream>using std::coutusing std::endltemplate <class T>class SqStack{??? public:??????? SqStack(int init=50 int incr=10)??????? bool StackEmpty() const判断栈是否为空??? ??? T Get

• C逆波兰式的实现代码.doc

  #

• AES加密C语言实现代码.doc

  define BPOLY 0x1b < Lower 8 bits of (x8x4x3x1) ie. (x4x3x1).define BLOCKSIZE 16 < Block size in number of bytes.define KEY_COUNT 3if KEY_COUNT == 1 define KEYBITS 128 < Use AES128.elif KEY_COUNT =

• 数据结构C语言实现遍历代码.doc

  include<>include<>define maxsize 100typedef struct node{char datastruct node lchildrchild}bitreebitree Q[maxsize]bitree CREATREE(){char chint frontrearbitree rootsroot=NULLfront=1rear=0ch=getchar()

• C语言程序源代码.doc

  C语言程序源代码include <> 51寄存器定义include define control P1 P1_0:A相P1_1:B相P1_2:C相P1_3:D相define discode P0 显示代码控制端口define uchar unsigned char 定义无符号型变量define uint unsigned int sbit en_dm=P30 显示代码锁存控制sbit e

• C语言排序源代码.doc

  C语言排序源代码(1)冒泡法 冒泡法大家都较熟悉其原理为从a[0]开始依次将其和后面的元素比较若a[0]>a[i]则交换它们一直比较到a[n]同理对a[1]a[2]...a[n-1]处理即完成排序下面列出其代码：void bubble(int aint n) 定义两个参数：数组首地址与数组大小 { int ijtemp for(i=0i<n-1i) for(j=i1j<nj) 注意循环的上下

• Msp430频率计c语言代码实现.doc

  Msp430频率计c语言代码实现include <msp430x14x.h>define uint unsigned int uint ifunsigned char table[] = Hz延时函数 void delay(uint z) { uint ty for(t=zt>0t--) for(y=110y>0y--) }写命令void

• 计算器（c--语言）实现源代码.doc

  计算器(c语言)实现源代码.txt用快乐去奔跑用心去倾听用思维去发展用努力去奋斗用目标去衡量用爱去生活钱多钱少常有就好人老人少健康就好家贫家富和睦就好include <iostream>using namespace stddefine STACK_INIT_SIZE 100define STACKINCREMENT 10--------------------------------------