∫ntegrabℓε ∂iﬀerentiαℓs · unorganised notes, code, and writings of random topics

Huang & Langston (1988) Practical In-Place Merging

March 22, 2012 paper

A paper I read because of a mention in StackOverflow about merging two sorted arrays. However, despite it claims that it can merge two lists in \(O(n)\) time and \(O(1)\) space, it seems that it does not work for arrays but linked lists. One key feature of the paper’s \(O(n)\)... [more]

Repeated Hash and Collision

March 14, 2012 blog code math

Reading an article from Umumble but it seems not very well formatted. So I do the math here again. [more]

Stolz-Cesàro theorem

March 5, 2012 blog math

L’Hôpital’s rule: for functions \(f\) and \(g\) which are differentiable on \(I \backslash\{c\}\) , where \(I\) is an open interval containing \(c\), if [more]

Erlang & Poisson distribution

March 1, 2012 blog math

Poisson distribution (PDF): \(f(k;x,\lambda) = \frac{(\lambda x)^k e^{-\lambda x}}{k!}\quad\textrm{for }x,\lambda\ge 0\) [more]

Replace a Search Tree with Skiplist for Performance

February 26, 2012 blog code

Reading http://www.codeproject.com/Articles/27799/Stree-A-fast-std-map-and-std-set-replacement, learned about the paper Deterministic skip lists by Munro, Papadakis, and Sedgewick in 1992. [more]