## Is Hand Shuffling reliable?

I Hand Shuffling reliable? If you are thinking this question, or you like card games, it is good for you to read this post.

I Hand Shuffling reliable? If you are thinking this question, or you like card games, it is good for you to read this post.

Recently, I create a project, Extension Object Pattern Sample, on github. It demonstrates Extension Object Pattern in C++. Extension Object Pattern is to anticipate that an object’s interface needs to be extended in the future. Additional interfaces are defined by extension objects. This pattern is introduced by Erich Gamma. For more detail, see his paper, Read the full article…

I upload a tiny suffix tree package, which is used to process word, and to find the longest common prefixes. You can find sample usages in comments. Click HERE to download the archive.

This post is about a simple mathematical problem, Which is offered by Dr. Blair at his Mathematical basis of computing class. My schoolmates and I provide several methods to solve it. I will discuss a common method and give some code to check the answer. PROMBLEM A trit is an element of the set {0, Read the full article…

A friend and I talked about Monte Carlo Method in simulating PI. Then, I wrote a program for her. As a result, when we take 2E7 times computation to aggregate the PI, the result we get is closed the PI. The code is as blow.

100 prisoners and a light bulb is a logic question which is usually popped during interviews. This post is talking about how many days the prisoners are expected to be set free, and what items influence the length of that period.

Suffix Tree, formally called PAT tree, is a data structure that presents the suffixes of strings in a way that allows for a particularly fast implementation of many important string operations, like searching, counting and etc.. In my senior year, Mr. Xia mentioned it in his data structure lecture. I made a sample of suffix Read the full article…