登录
首页 » 其他项目 » learning java development of a procedure (a very good example of beginners guide...

learning java development of a procedure (a very good example of beginners guide...

于 2023-08-11 发布 文件大小:978.00 B
0 164
下载积分: 2 下载次数: 1

代码说明:

学习java开发的第一个程序(初学者非常好的实例教程)-learning java development of a procedure (a very good example of beginners guide)

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

发表评论

0 个回复

  • Equivalence
    等价
    2023-01-20 07:40:03下载
    积分:1
  • Plug
    插件安装: 下载插件,将插件目录放入wp-content/plugins/目录下 插件管理页面激活插件 去模板widget页面增加blogshout的widget 在插件设置页面或者博客首页或者widget页面修改通告内容 -Plug-ins installed: Download plug-in, plug-ins directory Add to wp-content/plugins/directory under the plugin management page to activate plug-ins to increase blogshout page template widget in the widget plugin settings page or blog page or widget page modified circular content
    2023-05-07 04:40:02下载
    积分:1
  • vc,optical passive component auto test software.
    vc,optical passive component auto test software.
    2022-07-18 11:28:35下载
    积分:1
  • 汇集了1万种成语
    汇集了1万种成语-pool of 10,000 species of idioms
    2022-03-29 01:09:46下载
    积分:1
  • The explain of C4.5 document(data type,run environment)
    C4.5文档说明(数据类型,运行环境)-The explain of C4.5 document(data type,run environment)
    2022-07-05 10:27:10下载
    积分:1
  • 又一个经典的贪吃蛇游戏,用鼠标控制蛇移动的方向.
    又一个经典的贪吃蛇游戏,用鼠标控制蛇移动的方向.-also a classic Snake game with mouse control snake moving in the direction.
    2022-02-25 05:12:57下载
    积分:1
  • 本算法使用分治法求解最近点对问题。事先用O(nlogn)时间对x坐标进行排序,使得所有的点是按x坐标从小到大排好序的(x坐标相同时y坐标小的排前),然后取下标小...
    本算法使用分治法求解最近点对问题。事先用O(nlogn)时间对x坐标进行排序,使得所有的点是按x坐标从小到大排好序的(x坐标相同时y坐标小的排前),然后取下标小于n/2属于左边的点集PL,取下标大于n/2属于右边的点集PR,即用O(1)时间就可以将规模为n的问题分解为两个规模为n/2的、同类型的子问题。分割完毕之后就可以采用分治法,分别求出PL和PR中的最近点对,最终通过递归实现。-This algorithm uses divide and conquer to solve the problem closest point. Prior to use O (nlogn) time to sort the x coordinate so that all points are based on x coordinates from small to large sorted (x coordinates with the same y coordinates of the small, the top), and then remove the standard is less than n/2 the set of points belonging to the left PL, remove the standard is greater than n/2 set of points belonging to the right of PR, that is to use O (1) time can be the problem size n divided into two size n/2, the same type The sub-problems. Segmentation can be used after completion of sub-rule method, respectively, find the PL and PR in the last points and eventually through the recursion.
    2022-01-25 16:01:13下载
    积分:1
  • CC1020 SmartRF TI Chipcon
    cc1020 smartRf TI Chipcon -cc1020 smartRf TI Chipcon
    2022-03-18 22:30:17下载
    积分:1
  • repeat of the classic Tower of Hanoi. Courses designed to do so, not too good, h...
    重演经典的汉诺塔。 做课程设计时做的,不算太好,呵呵…… 不过还算基本规范吧。适合初学者。-repeat of the classic Tower of Hanoi. Courses designed to do so, not too good, huh ... but it still basic norms. For beginners.
    2022-03-23 14:12:05下载
    积分:1
  • Account registration with a batch of the software implementation, and be able to...
    用批处理实现帐号登记本软件,能够登记并查询信息,并且将数据隐藏在回收站的目录下。-Account registration with a batch of the software implementation, and be able to query the registration information and data hidden in the recycle bin directory.
    2022-11-15 19:25:02下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载