2015年11月_codesailor

12月 11月

原创开心

今天过了数媒实验室的一面，作为一百三十个人中幸存的三十人我还是很开心的。今晚上要努力看java基础，临时抱一抱佛脚，明天的面试一定要争取拿下！！！

2015-11-21 23:53:39 231

原创栈－－最终版

#include <stdio.h>#include <Stdlib.h>typedef struct node{ int data; struct node *pNext;}NODE,*PNODE;typedef struct Stack{ PNODE pTop; PNODE pBottom;}STACK,* PSTACK;void init(PST

2015-11-19 21:42:30 296

原创链栈2

#include <stdio.h>#include <Stdlib.h>typedef struct node{ int data; struct node *pNext;}NODE,*PNODE;typedef struct Stack{ PNODE pTop; PNODE pBottom;}STACK,* PSTACK;void init(PST

2015-11-19 17:30:13 207

原创链式栈

#include <stdio.h>#include <Stdlib.h>typedef struct node{ int data; struct node *pNext;}NODE,*PNODE;typedef struct Stack{ PNODE pTop; PNODE pBottom;}STACK,* PSTACK;void init(PST

2015-11-19 17:04:11 265

转载单链表的程序实现

#include<stdio.h>//#include<malloc.h>#include<stdlib.h>typedef struct Node{ int data; struct Node * pnext;}NODE, * PNODE;PNODE create_list(){ PNODE phead=(PNODE)malloc(sizeof(NODE));

2015-11-16 20:29:20 356

转载结构体实现模拟时钟

#include <stdio.h>typedef struct clock{ int hour,minute,second;}CLOCK;//函数功能：时分秒时间的更新void Update(CLOCK *t){ t->second++; if (t->second == 60) { t->second=0; t->min

2015-11-15 17:16:53 2687 1

转载书上的代码总觉得有点问题

#include <stdio.h>#include <stdlib.h>struct link *AppendNopde(struct link *head);void DisplyNode(struct link *head);void DeleteMemory(struct link *head);struct link{ int data ; struct lin

2015-11-15 16:19:46 295

转载 p=p->next

p->next只不过是获取p这个节点的next域只有p=p->next,这种方式才是让p指向了下一个节点q->next=p;p->next=null;q=p;这个里面的q指向的永远是是要在当前节点添加下一个节点的哪个节点假设 q现在指的是1节点,执行q->next=p,就是在1节点后面添加了个节点2 p->next=null,就是把2节点的next域设置为null; q=p 就是把2节点地址给q

2015-11-13 01:34:09 2203 1

原创小学生管理系统V1.0

#include <stdio.h>#define N 30#define M 5void ReadScore(int score[],long num[],int n);int SumC(int score[],int n);void SortByScore(int score[],long num[],int n);void SortByNum(int score[],long nu

2015-11-09 08:02:50 920

转载冒泡冒泡冒泡

#include <stdio.h>#define N 10void Bubble(int a[],int n);int main(){ int n,a[N]; printf("Input n:"); scanf("%d",&n); printf("Input %d numbers :\n", n ); for (int i = 0; i < n; +

2015-11-08 16:12:46 598

转载无题

#include <stdio.h>#define N 20void Insert(int a[],int n,int x);int main(){ int a[N+1]; int x,i,n; printf("Input array size :"); scanf("%d",&n); printf("Input array:"); for (

2015-11-08 15:54:29 227

转载学生成绩小管理

#include <stdio.h>#define STUDENT_N 40#define COURSE_N 3void ReadScore(int score[][COURSE_N],long num[],int n);void AverforStud(int score[][COURSE_N],int sum[],float aver[],int n);void AverforC(int

2015-11-08 11:27:21 479

原创选择排序

#include <stdio.h>#define N 40int ReadScore(int score[],long num[]);int FindMax(int score[],int n);void DataSort(int score[],long num[],int n);void PrintScore(int score[],long nnum[],int n);int m

2015-11-08 10:24:40 217

原创查找算法

#include <stdio.h>#define N 40int ReadScore(int score[],long num[]);int LinSearch(long num[],long x,int n);int main(){ int score[N],n,pos; long num[N],x; n = ReadScore(score,num);

2015-11-08 10:23:08 342

转载汉诺塔

#include <stdio.h>void Move(int n,char a,char b){ printf("Move %d : from %c to %c\n",n,a,b);}//函数功能：用递方法将n个圆盘借助于柱子c从源柱子a移动到目标柱子b上void Hanoi(int n,char a,char b,char c){ if(n == 1) {

2015-11-07 23:55:42 279

原创小游戏

#include <stdio.h>int magic(int m);int main(){ int m,ret; printf("Input a sum:\n"); scanf("%d",&m); ret = magic(m); if (ret!=1) { printf("Wrong\n"); /*

2015-11-07 22:42:27 270

原创看不懂

#include <stdio.h>int Coconut(int n);int main(){ printf("y = %d\n",Coconut(5));return 0;}int Coconut(int n){int i = 1;float x=1,y;y = n*x+1;do{ y=y*n/(n-1)+1; i++;

2015-11-07 22:19:30 318

原创两个数的最大公约数

#include <stdio.h>#include <stdlib.h>void Gcd(int a,int b){for (int i = a<b?a:b; i > 0; --i){ if (a%i==0&&b%i==0) { printf("%d\n",i); exit(0); /* code */ } /

2015-11-07 20:58:34 202