Skip to main content


Showing posts from April, 2013

Power of Confession

The second half of this semester goes really fast. It is indeed the exam week now.
In the past week, I experienced the most intensive reading week in my four-year's university life in NUS.Actually, the last three weeks are the most intensive weeks in my whole life. I guess I will never forget these sleepless days, staying overnight with the passionate and super intelligent team mates.
Some highlights: 1. Wednesday's Project Demo. Our app turns out to be very popular. Though we didn't know that we were supposed to provide a project id for voters to vote until the project showcase was almost finished, it is still encouraging to find out that we received very good feedback from the few only voters.
All positive! I have problem to sleep over time for meetings or lectures. This app really helps to address the problem by integrate some games in suitable difficulties and nice group event message!!  Interesting app Interesting idea "Very easy to use and a lot of interesting f…

Intensive and Rewarding Weeks

These past two weeks, I've been experiencing the most intensive days ever. Almost every night, I stayed with my teammates in PL1,mostly doing project development(sometimes telling jokes). It becomes a biological clock to go for supper together in the midnight(order from MCdonalds' or go to a nearby Taiwan restaurant),continue coding until early in the morning,then sleep until the afternoon and continue the circle again. It is a super intensive, but certainly awarding experience. That would be one of the most valuable memories in my life, to work with these intelligent and passionate teammates. Sometimes, I'm not so efficient, bothered with FYP deadlines and other assignments.However,they help share the pain. I also share my passion and engagement.That is a great time.

Some highlights:
 1. Cat vs Dog puzzle.
     It is a tough one. Undirected weighted bipartite graph, to calculate the maximum flow.Still have problem solvin…

Some Highlights

1. A puzzle about sorting.
Given n double numbers, print the top m in a descending order. If two of the numbers have the same value, then the one appear earlier would have a higher weight.

This doesn't sound so hard. However, there are quite a number of tricks here. 1. Efficiency. 2. In Place Sorting.

I first tried quick sort. It supposed to be quite fast. However, I kept getting the wrong answer feedback. The reason is that when two numbers have equal value, quick sort doesn't make the original order in place.

Then bubble sort. Well, the answers would be correct, however, it's not efficient enough. Run Time Error.

Try merge sort, which is supposed to be in place and quite efficient. However,  still Run Time Error. When n is very large and m is small, it's too heavy to perform a sort to the n numbers then pick the top m.

It reminds me of heap, which keeps a good order during construction(heapify). However, it's also n…