サクサク読めて、アプリ限定の機能も多数!
トップへ戻る
災害への備え
www.keithschwarz.com
The final programming project is due tonight at 11:59PM. I will be holding extra office hours today from 1 - 4 instead of the usual 1 - 3, and Hrysoula will be holding office hours from 4 - 6. As always, feel free to email us or ask questions on Piazza. Congratulations on completing the final project of the quarter! How does it feel to have a working compiler? For those of you interested in learni
Last Major Update: January 7, 2011 A few years ago I heard about an interesting sorting algorithm (invented by the legendary Edsger Dijkstra) called smoothsort with great memory and runtime guarantees. Although it is a comparison sort and thus on average cannot run faster than Ω(n lg n), smoothsort is an adaptive sort, meaning that if the input is somewhat sorted, smoothsort will run in time close
Darts, Dice, and Coins: Sampling from a Discrete Distribution Last Major Update: December 29, 2011 Earlier this year, I asked a question on Stack Overflow about a data structure for loaded dice. Specifically, I was interested in answering this question: "You are given an n-sided die where side i has probability pi of being rolled. What is the most efficient data structure for simulating rolls of t
The Archive of Interesting Code is an (ambitious) effort on my part to research, intuit, and code up every interesting algorithm and data structure ever invented. In doing so, I hope both to learn the mathematical techniques that power these technologies and to improve my skills as a programmer. The examples on this site are in a variety of languages. I generally prefer to use C++ for algorithms,
このページを最初にブックマークしてみませんか?
『www.keithschwarz.com』の新着エントリーを見る
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く