- 博客(1)
- 资源 (5)
- 收藏
- 关注
原创 Java 随机数比较和分析
概况: 本文概述2种jdk的随机数实现方式,旨在了解其运行机理。并得出运行效率比较。但这2种随机数生成还是会存在一定安全风险(伪随机数有可能会被猜出随机序列),最后还给出另一种相对更安全的随机数产生方式。附录还给出jdk的nextInt(n)函数的代码分析。 一. 2种产生方式: 一般通过jdk获取0~N(N为自然数)的随机数可以通过下面2种方式获取 1. Math.ran
2012-08-01 13:41:15 11753 1
Ubuntu8.04速成手册
转自嘉骏苑http://luckiss.blogcn.com(文章整理&原创by:嘉骏
内容涉及ubuntu8.04的安装配置,系统管理,初级入门,手把手教你玩转ubuntu
2009-06-18
Data Structures and Algorithm Analysis in C
经典数据结构教材
This book describes data structures, methods of organizing large amounts of data, and algorithm analysis, the estimation of the running time of algorithms. As computers become faster and faster, the need for programs that can handle large amounts of input becomes more acute. Paradoxically, this requires more careful attention to efficiency, since inefficiencies in programs become most obvious when input sizes are large. By analyzing an algorithm before it is actually coded, students can decide if a particular solution will be feasible. For example, in this text students look at specific problems and see how careful implementations can reduce the time constraint for large amounts of data from 16 years to less than a second. Therefore, no algorithm or data structure is presented without an explanation of its running time. In some cases, minute details that affect the running time of the implementation are explored.
Once a solution method is determined, a program must still be written. As computers have become more powerful, the problems they solve have become larger and more complex, thus requiring development of more intricate programs to solve the problems. The goal of this text is to teach students good programming and algorithm analysis skills simultaneously so that they can develop such programs with the maximum amount of efficiency.
This book is suitable for either an advanced data structures (CS7) course or a first-year graduate course in algorithm analysis. Students should have some knowledge of intermediate programming, including such topics as pointers and recursion, and some background in discrete math.
2009-05-14
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人