登录
首页 » 电子书 » 从文件中读取一定量的数据,用分治法求出数组中的前K小元素。...

从文件中读取一定量的数据,用分治法求出数组中的前K小元素。...

于 2022-01-25 发布 文件大小:10.04 kB
0 156
下载积分: 2 下载次数: 1

代码说明:

从文件中读取一定量的数据,用分治法求出数组中的前K小元素。-read from the document a certain amount of data, with partition derived array of small elements of the former K.

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

发表评论

0 个回复

  • 一片好的介绍linux的,考要怎么长干啥的啊
    一片好的介绍linux的电子书,考要怎么长干啥的啊-A good introduction of e-books linux
    2022-03-14 02:00:36下载
    积分:1
  • 可编程逻辑器件PLD原理与应用 这是一部好对于PLD来说
    可编程逻辑器件PLD原理与应用 这是一部好书对于PLD来说-programmable logic device and the application of this principle is a good book for PLD run
    2022-02-02 00:02:31下载
    积分:1
  • XML从入门到精通,相当好的
    XML从入门到精通,相当好的书箱-XML from entry to the proficient, a very good book drops
    2022-03-12 08:50:04下载
    积分:1
  • WinCVS操作手册(与安装程序和参考)
    wincvs操作手册(附安装程序和参考资料)-wincvs operating manual (with the installation procedures and references)
    2023-08-14 03:25:05下载
    积分:1
  • 实时编程用户指南很好的
    Realtime C programming user guide very good book
    2022-03-25 08:31:29下载
    积分:1
  • 仿真习题,一个非常好的仿真习题。可以随便下载,值得一看...
    仿真习题,一个非常好的仿真习题。可以随便下载,值得一看-Simulation Exercise, a very good simulation exercises. Can easily download, an eye-catcher
    2022-05-26 02:00:37下载
    积分:1
  • 图论中最小生成树Kruskal算法 及画图程序 M
    图论中最小生成树Kruskal算法 及画图程序 M-函数 格式 [Wt,Pp]=mintreek(n,W):n为图顶点数,W为图的带权邻接矩阵,不构成边的两顶点之间的权用inf表示。显示最小生成树的边及顶点, Wt为最小生成树的权,Pp(:,1:2)为最小生成树边的两顶点,Pp(:,3)为最小生成树的边权,Pp(:,4)为最小生成树边的序号 附图,红色连线为最小生成树的图 例如 n=6 w=inf*ones(6) w(1,[2,3,4])=[6,1,5] w(2,[3,5])=[5,3] w(3,[4,5,6])=[5,6,4] w(4,6)=2 w(5,6)=6 [a,b]=mintreek(n,w) -Graph theory Kruskal minimum spanning tree algorithm and Paint program M-function format [Wt, Pp] = mintreek (n, W): n for the map Vertices, W for weighted graph adjacency matrix, does not constitute the edge of the two vertices of between the right to express with inf. Show the minimum spanning tree of edges and vertices, Wt right for the Minimum Spanning Tree, Pp (:, 1:2) for the minimum spanning tree edges of the two vertices, Pp (:, 3) for the minimum spanning tree of the right side, Pp ( :, 4) For the minimum spanning tree graph edge serial number, red connection for the minimum spanning tree of graph such as n = 6 w = inf* ones (6) w (1, [2,3,4]) = [ 6,1,5]
    2022-01-30 21:32:39下载
    积分:1
  • 用JCreator3.5作的APPLET小程序,可在仪表盘上设数字跳动!
    用JCreator3.5作的APPLET小程序,可在仪表盘上设数字跳动!-JCreator3.5 used for the APPLET small program in dashboards based on figures beat!
    2022-03-04 23:06:56下载
    积分:1
  • sst chip it can sumulater use keil C
    sst芯片它可以使用keil C
    2022-12-29 08:05:04下载
    积分:1
  • 惯性导航与GPS数据集成、基于模糊自适应Kalman滤波…
    惯性导航和GPS的数据融合,基于模糊自适应kalman滤波的方法-Inertial navigation and GPS data integration, based on fuzzy adaptive kalman filtering method
    2022-01-24 14:23:42下载
    积分:1
  • 696518资源总数
  • 106155会员总数
  • 8今日下载