资源列表
prim
- prim算法,输出最小生成树,时间复杂度Nlog(n)-prim algorithm
canleder
- 打印万年日历，请输入一个年份会自动打印出改年的12个月的所有天数的具体位置-Print ten thousand calendar, please enter a year will be printed in the change of the 12 months of all days of specific position
zfxx
- 跳动的字符心形，通过字符*打印出几个心形，循环播放-Characters beating heart-shaped by the character* Print out a few heart-shaped loop
struct_details
- 1.给结构体赋值,打印结果。2.打印结构体每个成员变量的地址。3.打印该结构体的长度。4.按字节打印该结构体-1. To structure body assignment, print the results. 2. Each member variables print structures of the address. 3. Print this structure of the length of the body. 4. According to print the structur
bresnham
- the line-drawing routine so that it always increments x as it plots, it becomes clear that, having plotted a point at (x,y), the routine has a severely limited range of options as to where it may put the next point on the line: It may plot the p
main
- max heapify and heapsort sorting-max heapify and heapsort
Desktop
- a hello world code in C
haowan
- CTRL+F9 然后一直按住回车键，应该有一个动态效果-CTRL F9 Then press the Enter key, should have a dynamic effect
default-set-all-Print
- 获取默认打印机，获取所有打印机，设置默认打印机-Gets the default printer, access all printers, set the default printer
yuesefu
- 编号为1,2,3,4…,n的n个人按顺时针方向围坐一圈,每人 持有一个密码(正整数).一开始任选一个正整数作为报数的上 限值m,从第一个人开始按顺时针方向自1开始顺序报数,报到m 时停止.报m的人出列，将他的密码作为新的m值,从他在顺时针 方向上的下一人开始重新从1报数,如此下去,直到所有人全部 出列为止.编程打印出列顺序. -Numbered 1,2,3,4 ..., n of n individuals sitting around the circle
sleepyZzz
- 编写一个日志输出函数，并编写一个测试程序用于测试该函数的正确性 日志的输出格式为：[2013-04-17 12:23:17] [DEBUG] file no find 日志文件在超过1K大小后，自动新建一个日志文件。 当日志文件超过10个后，自动从第一个日志文件重新记录-Write a log output function, and write a test program for testing the correctness of the function log output
ProBar
- 进度条程序 完美运行 有注释 里面有两种实现方式，可以根据需要自己进行选择-The progress bar is a perfect run. There are two ways to achieve, you can choose according to their own needs