shankyty

import java.util.Arrays;

/**
*	quickselect is a selection algorithm to find the kth smallest element in an 
*	unordered list. Like quicksort, it is efficient in practice and has good 
*	average-case performance, but has poor worst-case performance. Quickselect 
*	and variants is the selection algorithm most often used in efficient 
*	real-world implementations.
*	
*	Quickselect uses the same overall approach as quicksort, choosing one 

shankyty

function ( el ) {
    var x = 0;
    var y = 0;
    while( el && !isNaN( el.offsetLeft ) && !isNaN( el.offsetTop ) ) {
        x += el.offsetLeft - el.scrollLeft;
        y += el.offsetTop - el.scrollTop;
        el = el.offsetParent;
    }
    return { top: y, left: x };
}