主要内容 2.1Java语言的特点 2.1.1简单的面向对象程序设计语言 2.1.2健壮安全的分布式语言 2.1.3结构中立、可移植性强的解释型语言 2.1.4高效能 2.1.5支持多线程的动态语言 2.1.6Java与几种常用语言的比较 2.2Java执行环境 2.2.1VM机制Java平台的基础 2.2.2自动垃圾收集 2.2.3保护域机制与沙箱模型 2.2.4类加载器一一启动引擎的点火器 2.3JDK的组成与安装设置 2.3.1Java平台的组成结构 2.3.2 SET PATHSET和 CLASSPATH的作用 2.4典型例子及常见问题 2.4.1编译器、解释器、小程序观察器和反编译器 2.4.2最简单的例子 2.4.3应用程序的主方法 2.4.4小程序的运行

Welcome to Introduction to Algorithms, Fall 2001 Handouts 1. Course Information 2. Calendar 3. Registration (MIT students only) 4. References 5. Objectives and Outcomes 6. Diagnostic Survey

The divide-and-conquer design paradigm 1. Divide the problem(instance) into subproblems 2. Conquer the subproblems by solving them recursively 3. Combine subproblem solutions

How fast can we sort? All the sorting algorithms we have seen so far are comparison sorts: only use comparisons to determine the relative order of elements E. g, insertion sort, merge sort, quicksort heapsort The best worst-case running time that weve seen for comparison sorting is O(nIgn) Is o(nlgn) the best we can do?

Symbol-table problem Symbol table T holding n records

Binary-search-tree sort 7∈ b Create an empty Bst for i=i to n do trEe-INSert(,AiD) Perform an inorder tree walk of t Example:

ynamic order statistics OS-SELECT(i, S): returns the i th smallest element in the dynamic set S. OS-RANK(, S): returns the rank ofx E S in the sorted order of s s elements IDEA: Use a red-black tree for the set S, but keep subtree sizes in the nodes

Fixed -universe successor problem Goal: maintain a dynamic subset s of size n of the universe 0=10, 1,.,u-1 of size u subject to these operations INSERT(X∈U\\S): Add x to s DELETE(X E S): Remove x from S

Dynamic programming Design technique, like divide-and-conquer Example: Longest Common Subsequence (LCs) Given two sequences x[l.. m] and yll.n], find a longest subsequence common to them both a' not the

Paths in graphs Consider a digraph g=(v, E)with edge-weight function w:E→>R. The weight of path p=v1→ →>…→> vi is defined to be (D)=∑(n,1)