Don't innovate!

Gopinath had a shocking news for me this morning... the site that we were cloning--cloning with additional features and innovations had just released a new version, but with six features taken from our version. Had we released it some days before, we might have grabbed the innovation pride. But...

The weirdest thing was that we're forced to clone including the landing page as in their previous version (and that is the reason for this delay), but when we're doing, they switched to our homepage version! Damn...

It doesn't stop here. I was pacifying myself and pushing the software to be released by afternoon--at least then to claim the innovation card. Now Kanagavel has another "good news" for me, that we have to "tune" the product to be exactly as in PSD that would take another week to ship...

Comments

abuthakir said…

we should document or blog the upcoming release items for proof

Jul 27, 2011, 5:42:00 AM

BehaviorS.js - An alternative to Behaviour.js, event:Selectors and Low Pro libs for unobtrusive JavaScript programming

BehaviorS.js yet another unobtrusive JavaScript library similar to Behaviour.js and event:Selectors but in implementation uses hash based lookup without extending elements; so presumably it should be faster than the rest. The original script and idea was by JLof ; I extended it for DOMContentLoaded support, optimized a bit to avoid scanning of more depths, and added new rules support. I wanted to document the plug a long time and just got time to do it. For the time being BehaviorS.js is available here Update (2006-09-11) : Coralized the link to BehaviorS.js so as to save the load on free brinkster.com webpage Update (2006-09-27) : If the coralized link to BehaviorS.js doesn't work, use http://www21.brinkster.com/guideme/BehaviorS/ Update (2025-06-07) : Now available in https://github.com/rrjanbiah/behaviorsjs

Photo got published in Kumudam magazine

I'm extremely surprised to find that the photo I took in Dakshina Chitra and later uploaded to Wikipedia got published in Kumudam magazine (dated July 1, 2009).

Interview question #2

This is related to PHP's array . An array has number of elements. All elements are integers and unique, which means there is no repetitive integers. (e.g.) $foo = array(7, 5, 9, 13, 2, 8); You have to sort the array, provided: You should scan the elements only once. You're not allowed to compare the elements when sorting. (i.e., you're not supposed to use any comparison operators) Sorted resultant array may not be the source array. How will you do that?