FileEdit can edit file ,save file ,open file ,have basic simple functions for file .INSERT, BACKSPACE ,TAB,PGUP,PGDOWN,UP,DOWN,left,RIGHT AND SO ON
標簽： file functions FileEdit BACKSPAC
上傳時間： 2017-01-02
上傳用戶：風之驕子
void Knight(int i , int j) { // printf("％d ％dn",i,j) if (board[i][j] != 0 || i < 0 || i >= Size || j < 0 || j >= Size ) { return } step++ board[i][j]=step if (step == Size*Size) { showboard() system("PAUSE") return } //DFS Knight(i-2,j-1) //left Knight(i-2,j+1) Knight(i+2,j-1) //right Knight(i+2,j+1) Knight(i-1,j-2) //up Knight(i+1,j-2) Knight(i+1,j+2) //down Knight(i-1,j+2) // board[i][j]=0 step-- }
上傳時間： 2014-01-17
上傳用戶：cxl274287265
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)
標簽： contains Output convex planar
上傳時間： 2017-02-19
上傳用戶：wyc199288
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.
標簽： tree conditions completely satisfying
上傳時間： 2014-01-01
上傳用戶：gundan
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
標簽： Programmer Duchrows stripped torrent
上傳時間： 2017-03-02
上傳用戶：變形金剛
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.
上傳時間： 2013-12-28
上傳用戶：xfbs821
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
標簽： water interactive realistic fountain
上傳時間： 2013-12-19
上傳用戶：yuchunhai1990
HashTable實例 public class HashTable_msg { public HashTable_msg() { String sum_sql="select mobilenum,count(*) from SJSJ_Msg where (left(in_date,6)=(select left(CONVERT(varchar(12) , getdate(), 112 ),6)))group by mobilenum" Hashtable<String,Integer> ht = new Hashtable<String,Integer>() try{ ResultSet rs= DBAccess.getInstance().select(sum_sql) while(rs!=null) { ht.put(rs.getString(1),rs.getInt(2)) rs.next() } } catch (Exception e) { Logs.printError(e) } } }
標簽： HashTable_msg public HashTable sum_sql
上傳時間： 2014-12-07
上傳用戶：a6697238
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)
標簽： followingconditions tree completely satisfying
上傳時間： 2017-05-25
上傳用戶：2467478207
迷宮探險算法，一個CPP文件實現。在TC下編譯生成。生成的程序是dos exe。left/UP/RIGHT/DOWN 在迷宮中向左、上、右、下走一步。走過的路線顯示為黃色，回頭路顯示為紅色。
上傳時間： 2017-06-10
上傳用戶：
