Search similar and duplicate fixed price jobs through jobreapr

I previously mentioned that our team has developed jobreapr the fixed price job search engine that searches through Fiverr alternatives and gives better results.

In the phase-2 release, team has worked hard to add few more sites and more importantly introduced similar and duplicate listing through new algorithm. With this version, user can quickly check for similar jobs across all sites and also find if the job is duplicated across other fixed price job sites--and then order the job in best place/site.

Comments

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?