It seems the general opinion (especially of sci-fi writers and doomsday predictors) is that eventually computer programs will become complex enough to be intelligent. In reality, there is nothing intelligent about most computer programs. Nothing. Making the programs more complicated … Continue reading
Monthly Archives: May 2012
Expensive Dinner
Problem: There are N people going to a restaurant, entering one at a time. Each person is unhappy upon sitting down if the total bill does not equal a multiple of that person’s integer identifier. So, person “3″ will not … Continue reading
Markov Chains
A markov chain is built by tracking the order data occurs in. We can then take this observation and create new data that will closely resemble the initially observed data. With enough data to analyze, this allows the creation of … Continue reading
Bribe The Prisoners
Problem: You are in charge of a prison with P number of cells in a straight line. Each cell has a window on the walls it shares with the neighbor cells. You need to release a certain number of prisoners, … Continue reading
Quick Sort
The quick sort partitions objects into two groups, one group of the objects with a value above a certain value, and another group with a value below. Each of these groups is further divided, and this action continues recursively until … Continue reading