cs19880320的专栏

原创 Tree头文件

#ifndef BINARY_TREE_H#define BINARY_TREE_H#include#define MAX 100using namespace std;typedef struct Bitree{   int data;   struct Bitree *lchild,*rchild;}Binode,*bitree;typedef bitr

原创 折半查找，冒泡排序

#include#includeusing namespace std;int search(int s[],int n,int key){ int low=0;int high=n-1; int mid; while(low { mid=(low+high)/2; if(s[mid]==key)  return s[mid]; else if(s[mi

原创 链表

#include#include "stdlib.h"#define NULL 0 typedef struct LNode{ int data; struct LNode *next;}LNode;typedef struct LNode LinkList; Create_List(void){LinkList *L; int data; Link

原创 C语言

<br /><br />#include<stdio.h><br />#include<malloc.h><br />struct stu<br />{int num;<br />struct stu *next;<br />} ;<br />struct stu *creat(void)<br />{int temp; struct stu *p1,*p2;<br />struct stu *head=NULL;<br />printf("/n input number:");<br />while(sc

原创 C语言

<br /><br />#include<stdio.h><br />#include<malloc.h><br />struct stu<br />{int num;<br />struct stu *next;<br />} ;<br />struct stu *creat(void)<br />{int temp; struct stu *p1,*p2;<br />struct stu *head=NULL;<br />printf("/n input number:");<br />while(sc

原创 C语言

<br /><br />#include<stdio.h><br />#include<malloc.h><br />struct stu<br />{int num;<br />struct stu *next;<br />} ;<br />struct stu *creat(void)<br />{int temp; struct stu *p1,*p2;<br />struct stu *head=NULL;<br />printf("/n input number:");<br />while(sc

原创 C语言

<br /><br />#include<stdio.h><br />#include<malloc.h><br />struct stu<br />{int num;<br />struct stu *next;<br />} ;<br />struct stu *creat(void)<br />{int temp; struct stu *p1,*p2;<br />struct stu *head=NULL;<br />printf("/n input number:");<br />while(sc

原创 帮帮忙看看

原创 C语言

我学的专业是计算机专业，在大一我认识了C语言，但是我对C语言的学习很不透彻，我很郁闷，我的前辈告诉我C语言很重要，尤其是指针的学习，所以我一直不放弃