IRKFDB.IN

For Rajinikanth, NP-Hard = O(1).

Rajinikanth is actually the front man for Apple. He let's Steve Jobs run the show when he's on a mission. Rajinikanth is always on a mission.

Rajinikanth's Internet connection is faster upstream than downstream because even data has more incentive to run from him than to him.

Rajinikanth solved the Travelling Salesman problem in O(1) time. Here's the pseudo-code: Break salesman into N pieces. Kick each piece to a different city.

No statement can catch the RajiniKanthException.

Rajinikanth doesn't pair program.

Rajinikanth can write multi-threaded applications with a single thread.

Rajinikanth doesn't need to use AJAX because pages are too afraid to postback anyways.

Rajinikanth doesn't use reflection, reflection asks politely for his help.

There is no Esc key on Rajinikanth's keyboard, because no one escapes Rajinikanth.

Rajinikanth can binary search unsorted data.

Rajinikanth breaks RSA 128-bit encrypted codes in milliseconds.

Rajinikanth doesn't needs try-catch, exceptions are too afraid to raise.

Rajinikanth went out of an infinite loop.

If Rajinikanth writes code with bugs, the bugs fix themselves.