资源列表
排序选择：
JAVA 应用开发详解
- 开发/应用实列,确实是不可多得的学习方案.-development / application is listed, is a rare learning programs.
java-日历
- 一个用ＪＡＶＡ写的日历程序，学习的朋友可以参考一下。-a written using Java calendar procedures, learning reference for a friend.
kecsj_java
- JAVA课程设计!用线程来实现比较查找、排序算法的运行时间，第一部分是将顺序查找、折半查找算法设计成线程并同时运行来比较两种查找算法，第二部分是将冒泡排序、快速排序及选择排序设计成线程并同时运行来比较三种排序算法。本程序使用流行的GUI界面设计。-Java curriculum design! Using thread to achieve more search, algorithm running time, the first part of the order is to locate,
NIOS PWM inc
- NIOS环境PWM的USER LOGIC实例5-NIOS environment PWM USER Logic Case 5
NIOS PWM HAL
- NIOS环境PWM的USER LOGIC实例4-NIOS environment PWM USER LOGIC example 4
reg_file
- NIOS环境PWM的USER LOGIC实例3-NIOS environment PWM USER Logic Example 3
hello_2pwm
- NIOS环境PWM的USER LOGIC实例1-NIOS environment PWM USER an example LOGIC
avalon_slave_pwm
- NIOS环境PWM的USER LOGIC实例1-NIOS environment PWM USER an example LOGIC
c常用算法程序源代码
- 此压缩包为c语言算法源代码 可以用作学习研究 也可以用作开发参考-this compressed to C language source code algorithm can be used to study can also be used for the development of reference
Haokoo.net免费域名系统
- 文件系统，可以直接查到或者直接应用域名，不错的程序啊，看看吧-file system, can be found directly or direct application domain, the procedure ah good to see it
040320174
- 无和集问题。设s是一个正整数集合。s是一个无和集当且仅当x,y属于s,但x+y不属于s. 设计一个算法，计算f(n)的值-no problems and sets. S is a set up is a set of integers. S is a set - and if and only if x, y belong s, x y s. Design is not an algorithm to calculate f (n) values
040320152
- 整数变换问题，用最少的f和g变换次数将n变换为m.f(i)=3 g(i)=[i/2].-Integer Transform, with the least f and g frequency of transformation to transform m.f n (i) = 3 g (i) = [i / 2].