Let a and b > 1 be constants, let f(n) be a function, and let T(n) be de...
Augmenting data structures Dynamic order statistics OS-Select(i) - retur...
Goal: get a search tree data structure that we can insert, delete and se...
Insert and delete insert 的整個(gè)思路很簡(jiǎn)單躯喇。其實(shí)只能加在最下面。所以從root開(kāi)始华畏,每次比較當(dāng)前node的值和需要ins...
Tree insert: searchs for that element A[i]Tree walk: Theorem: E[height o...
A fundamental weakness of hashing:For any choice of hash function, there...
io流分為字符流和字節(jié)流 然后下面又分為很多種目前我見(jiàn)到的使用io流的情況有三種 第一種是讀寫(xiě)txt文件 第二種是存儲(chǔ)object和讀取obje...
拿著String類型的類名欠窒,想創(chuàng)建對(duì)象坡锡,就這樣做
XML 指可擴(kuò)展標(biāo)記語(yǔ)言(eXtensible Markup Language)浪听。 XML 被設(shè)計(jì)用來(lái)傳輸和存儲(chǔ)數(shù)據(jù)。 創(chuàng)建xml文件 在ecl...