Input : A set S of planar points
Output : A convex hull for S
Step 1: If S contains no more than five points, use exhaustive searching to find the convex hull and return.
Step 2: Find a median line perpendicular to the X-axis which divides S into SL and SR SL lies to the LEFT of SR .
Step 3: Recursively construct convex hulls for SL and SR. Denote these convex hulls by Hull(SL) and Hull(SR) respectively.
Step 4: Apply the merging procedure to merge Hull(SL) and Hull(SR) together to form a convex hull.
Time complexity:
T(n) = 2T(n/2) + O(n)
= O(n log n)
A heap is a binary tree satisfying the following
conditions:
This tree is completely balanced.
If the height of this binary tree is h, then leaves
can be at level h or level h-1.
All leaves at level h are as far to the LEFT as
possible.
The data associated with all descendants of a
node are smaller than the datum associated
with this node.
JAVA多torrent下載程序P2P源碼
This is a stripped down version of Manfred Duchrows Programmer\ s Freind class
library. No code was changed, only classes irrelevant for Azureus were LEFT out
Java企業人事管理系統源碼javahr
配置Oracle數據庫
在配置Oracle數據庫時，請參見以下步驟：
（1）請確定數據庫已經成功啟動；
（2）請確認已經存在名稱為“PERSONNEL_MANAGE”的用戶，如果不存在，請先創建。
（3）將光盤\\TM\\03\\Database\\文件夾中的personnel_manage.dmp文件拷貝到C盤的根目錄下；
（4）依次單擊“開始”→“運行”，在彈出的窗口文本框中輸入“cmd”命令，然后單擊“確定”按鈕，打開DOS命令窗口；
（5）在DOS命令窗口輸入如下代碼：
imp PERSONNEL_MANAGE/MWQ@DBSQL file=C:\\personnel_manage.dmp fromuser=PERSONNEL_MANAGE ignore=y commit=y grants=y
（6）單擊回車鍵，即可成功導入Oracle數據庫了。
說明：第一個“PERSONNEL_MANAGE”為登錄數據庫的用戶名，第二個“MWQ”為登錄數據庫的密碼，“DBSQL”為欲登錄的數據庫名稱。
library. No code was changed, only classes irrelevant for Azureus were LEFT out.
An interactive water fountain.
A realistic water source in your pocket with full control.
Controls:
UP/DOWN - go closer/further
LEFT/RIGHT - rotate
# - stop rotation
1/7 - rotate camera up/down
3/9 - change water pressure
4/6 - change water rendering complexity
2/8 - ascend/descend
0 - bullet time
5 - 25 FPS limiter on/off
* - HUD on/off
Heapsort
1.A heap is a binary tree satisfying the followingconditions:
-This tree is completely balanced.
-If the height of this binary tree is h, then leaves can be at level h or level h-1.
-All leaves at level h are as far to the LEFT as possible.
-The data associated with all descendants of a node are smaller than the datum associated with this node.
Implementation
1.using a linear array not a binary tree.
-The sons of A(h) are A(2h) and A(2h+1).
2.time complexity: O(n log n)
this is very good application for face traccking.it contains more and good differnt features.if u rotate face right side it will show the direction for rignt side.if u rotate face LEFT side it will show the direction for LEFT side.
