ผลต่างระหว่างรุ่นของ "ผู้ใช้:Jittat"
ไปยังการนำทาง
ไปยังการค้นหา
Twitter
Jittat (คุย | มีส่วนร่วม) |
|||
| แถว 1: | แถว 1: | ||
| + | == Stuff == | ||
| + | <pre> | ||
| + | public class SortedIntArray { | ||
| + | protected int maxSize; | ||
| + | protected int [] array; | ||
| + | protected int eltCount; | ||
| + | |||
| + | public SortedIntArray(int maxelts) { | ||
| + | maxSize = maxelts; | ||
| + | array = new int[maxSize]; | ||
| + | eltCount = 0; | ||
| + | } | ||
| + | |||
| + | public int getEltCount() { return eltCount; } | ||
| + | public int getElt(int idx){return array[idx];} | ||
| + | |||
| + | public void insert(int x) { | ||
| + | array[eltCount] = x; | ||
| + | eltCount++; | ||
| + | } | ||
| + | } | ||
| + | </pre> | ||
| + | |||
| + | |||
== My bookmarks == | == My bookmarks == | ||
* [[204512]] | * [[204512]] | ||
รุ่นแก้ไขเมื่อ 02:55, 23 พฤศจิกายน 2550
เนื้อหา
Stuff
public class SortedIntArray {
protected int maxSize;
protected int [] array;
protected int eltCount;
public SortedIntArray(int maxelts) {
maxSize = maxelts;
array = new int[maxSize];
eltCount = 0;
}
public int getEltCount() { return eltCount; }
public int getElt(int idx){return array[idx];}
public void insert(int x) {
array[eltCount] = x;
eltCount++;
}
}
My bookmarks
- 204512
- Software Testing Course
- ตารางอบรมกลางคืน ค่ายโอลิมปิครอบ 2
- New platform สำหรับ สอวน./โอลิมปิครอบแรก
Dynamic Programming Languages Bookmark
- Dynamic Programming Language (wikipedia), DLR
- Dynamic Language Group at MIT
- IEEE Computer article
- course on dynamic prog lang
Teen and Tech bookmark
- CBS GenTech June 2006
- Teen technology: it's really very simple TimesOnline uk Nov 2005
Media & Interactive
News
Blogs
Reading groups
- Randomized Algorithms. Focus on classic results. Some of the papers and references below are from Motwani and Raghavan.
- Routing. Valiant. A scheme for fast parallel communication. SIAM Journal on Computing, 11:350-361, 1982. (Should be available at AIT Library)
- Paging. Fiat, Karp, Luby, McGeoch, Sleator, and Young. Competitive paging algorithms. Journal of Algorithms, 12:685-699, 1991. [1]
- Byzantine agreement. Rabin. Randomized Byzantine generals. In Proceedings of the 24th Annual Symposium on Foundations of Computer Science, page 403-409, 1983. (Also, see Chor and Dwork. Randomization in Byzantine agreement. In Randomness and Computing pages 433-497. JAI Press, 1989)
- Min-cut.
- Derandomization. Nisan and Wigderson. Hardness vs. randomness. Journal of Computer and System Sciences, 49(2) pages: 149 - 167, 1994. [4]
- Zero-knowledge.
- Shafi Goldwasser, Silvio Micali, and Charles Rackoff. The knowledge complexity of interactive proof-systems. In Proceedings of 17th Symposium on the Theory of Computation, Providence, Rhode Island. 1985. [5]
- Oded Goldreich, Silvio Micali, Avi Wigderson. Proofs that yield nothing but their validity. Journal of the ACM, volume 38, issue 3, p.690-728. July 1991. [6]
- Isolating Lemma. Mulmuley, Vazirani, and Vazirani. Matching is as Easy as Matrix Inversion. in Proceedings of Symposium on the Theory of Computing, 1987. Combinatorica, Vol. 7, No. 1, 1987. [7]
- Primality testing.
- Lovasz Local Lemma.
Other possible topics:
