登录
首页 » 算法 » 串的插入算法程序实现

串的插入算法程序实现

于 2022-02-22 发布 文件大小:211.67 kB
0 203
下载积分: 2 下载次数: 1

代码说明:

串的插入算法程序实现-Series insertion algorithm Program

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • 用CORDIC算法实现的2参数反正切。结果的精度与CORDIC的迭代次数有关,迭代次数越多,精度越高。本例子中精确到小数点后4位。要提高迭代次数,还得把增加1Q...
    用CORDIC算法实现的2参数反正切。结果的精度与CORDIC的迭代次数有关,迭代次数越多,精度越高。本例子中精确到小数点后4位。要提高迭代次数,还得把增加1QN格式的位数,比如32位long,程序多处需要修改,有需要的话自己改吧。 -CORDIC algorithm with the two parameters arc tangent. And the accuracy of the CORDIC iteration number, the more the number of iteration, the higher the accuracy. This case accurate to four decimal places. To raise the number of iterations, it has to the increase in a 2:30 format of the median, such as 32 long, multiple procedures need to change, the need to reform it themselves.
    2022-03-16 10:55:29下载
    积分:1
  • Programmer en C sous Linux
    2022-06-16 10:30:45下载
    积分:1
  • 先序遍历非递归算法 #define maxsize 100 typedef struct { Bitree Elem[maxsize] int top }SqS...
    先序遍历非递归算法 #define maxsize 100 typedef struct { Bitree Elem[maxsize] int top }SqStack void PreOrderUnrec(Bitree t) { SqStack s StackInit(s) p=t while (p!=null !StackEmpty(s-preorder non- recursive algorithm# define maxsize 100 typedef struct (Bitree Elem [maxsize]) int top SqStack void PreOrderUnrec (Bitree t) (SqStack s StackInit (s) p = t while (p! = Null! StackEmpty (s
    2022-12-23 05:40:03下载
    积分:1
  • 一个求解Josephus问题的函数
      #include #include #define NULL 0 #include typedef struct Lnode {  int data;  struct Lnode *next; }Josephus; void CreateList(Josephus*&L,int n)//建立循环链表 {  int i;  Josephus *p,*s;  s=(Josephus*)malloc(sizeof(Josephus));  s->data=1;  L=p=s;  for(i=2;idata=i;  p->next=s;  p=s;  }  p->next=L; } void DeleteList(Josephus*&L,Josephus*p,Josephus*q) {  q->next=p->next;  free(p); } void Josephus1(Josephus*&L,int s,int m)
    2022-01-27 23:12:59下载
    积分:1
  • 真正的公农历转换类.vip
    真正的公农历转换类.vip-genuine public Lunar conversion type. Vip
    2023-01-19 22:00:04下载
    积分:1
  • 基于密度聚类算法
    DBSCAN(Density-Based Spatial Clustering of Applications with Noise)是一个比较有代表性的基于密度的聚类算法。与划分和层次聚类方法不同,它将簇定义为密度相连的点的最大集合,能够把具有足够高密度的区域划分为簇,并可在噪声的空间数据库中发现任意形状的聚类。
    2022-05-26 05:44:16下载
    积分:1
  • Hough变换的matlab代码
    Hough变换的matlab代码-Hough Transform Matlab code
    2022-01-25 18:18:59下载
    积分:1
  • 自己写的贪吃蛇的c语言代码
    应用背景有趣的贪吃蛇代码,用c语言实现,简单易懂,不会很复杂。虽然网上已经有很多类似的游戏代码,但这是我亲自写,亲自测试的,一定能用。相信你会从中找到乐趣。关键技术简单的图形实现,关键的贪吃蛇算法,不是很难的,就是最基本的,有一点c基础的应该都能理解,也没有什么关键的技术与算法。
    2023-01-17 17:30:03下载
    积分:1
  • sdfsdf sdfsdf sd 自卫队自卫队 sd s fsdfsdf
    sdfsdf sdfsdf sd 自卫队自卫队 sd s fsdfsdfsdfsdf sdfsdf sd sdf sdf sd s fsdfsdfsdfsdf sdfsdf sd sdf sdf sd s fsdfsdfsdfsdf sdfsdf sd sdf sdf sd s fsdfsdfsdfsdf sdfsdf sd sdf sdf sd s fsdfsdfsdfsdf sdfsdf sd sdf sdf sd s fsdfsdfsdfsdf sdfsdf sd sdf sdf sd s fsdfsdfsdfsdf sdfsdf sd sdf sdf sd s fsdfsdfsdfsdf sdfsdf sd sdf sdf sd s fsdfsdfsdfsdf sdfsdf sd sdf sdf sd s fsdfsdfsdfsdf sdfsdf sd sdf sdf sd s fsdfsdfsdfsdf sdfsdf sd自卫队自卫队 sd s fsdfsdfsdfsdf sdfsdf sd sdf sdf sd s fsdfsdfsdfsdf sdfsdf sd sdf sdf sd s fsdfsdfsdfsdf sdfsdf sd sdf sdf sd s fsdfsdfsdfsdf sdfsdf sd sdf sdf sd s fsdfsdfsdfsdf sdfsdf sd sdf sdf sd s fsdfsdfsdfsdf sdfsdf sd sdf sdf sd s fsdfsdfsdfsdf sdfsdf sd sdf sdf sd s fsdfsdfsdfsdf sdfsdf sd sdf sdf sd s fsdfsdfsdfsdf sdfsdf sd sdf sdf sd s fsdfsdfsdfsdf sdfsdf sd sdf sdf sd s fsdfsdfsdfsdf sdfsdf sd sdf sdf sds fsdfsdfsdfsdf sdfsdf sd sdf sdf sd s fsdfsdfsdfsdf sdfsdf sd 自卫队自卫队 sd s fsdfsdfsdfsdf sdfsdf sd sdf sdf sd s fsdfsdfsdfsdf sdfsdf sd sdf sdf sd s fsdfsdfsdfsdf
    2022-11-04 12:55:03下载
    积分:1
  • 利用该程序计算,作为程序开发的相应功能函数
    利用该程序计算,作为程序开发的相应功能函数-Calculated using the program as a development of the corresponding function
    2022-08-17 07:45:12下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载