数据结构作业
River_Distance
这个作者很懒,什么都没留下…
展开
-
折半查找
#include<stdio.h>#include<iostream>using namespace std;int a[101];int key;int low=0,mid,high=100;int count=0;int Search_Bin(){ while(low<high) { mid=(low+high)/2; if(key==a[mid]) return mid; else if(key<a[mid]) high=mid-1;原创 2020-12-22 19:28:57 · 71 阅读 · 0 评论 -
广度优先搜索
/*@Author : 菜鸟大声笑@Github : https://github.com/cplasf911@Date : 2020-12-13 17:25:21@LastEditors : 菜鸟大声笑@LastEditTime : 2020-12-13 18:05:01@FilePath : /CC++/C++/ds.c@Description :*/#include <stdlib.h>#include <st原创 2020-12-22 18:56:23 · 76 阅读 · 0 评论 -
二叉树
#include "stdlib.h"#include "stdio.h"#include"conio.h"#define NULL 0typedef struct stu{ char data; struct stu *left,*right;}sn;sn *Create(sn *a){ char ch; scanf("%c",&ch); if(ch=='*') a=NULL; else { a=(sn *)malloc(sizeof(sn)); if (!a)原创 2020-12-01 20:16:59 · 67 阅读 · 0 评论 -
串的功能实现
#include "stdlib.h"#include "stdio.h"#define STRINGMAX 81#define LEN sizeof(struct string)struct string{ int len; char ch[STRINGMAX];};typedef struct string STRING;//--------------------函数声明------------------//void creat(STRING *s);void print(S原创 2020-11-10 20:34:22 · 139 阅读 · 0 评论 -
利用栈判断回文
#include<iostream.h>#include<stdlib.h>#include<string.h>//using namespace std;typedef struct StackNode{ int data; struct StackNode *next;}StackNode,*LinkStack;int InitStack(LinkStack &S){ S=NULL; return 1;}int Push(LinkS原创 2020-11-02 20:34:02 · 684 阅读 · 0 评论 -
进制转化
c#include<iostream.h>#include<stdlib.h>//using namespace std;typedef struct StackNode{ int data; struct StackNode *next;}StackNode,*LinkStack;int InitStack(LinkStack &S){ S=NULL; return 1;}int Push(LinkStack &S, int e){原创 2020-11-02 19:41:53 · 80 阅读 · 0 评论