arraySort.js

Array.prototype._sortObj = function(sortProp, sortLH, startAt, endAt) {
	var returnArray = this;
	if(!sortProp) {
		console.error("Sorting property undefined");
		return;
	}
	var numeric = false;
	for(var i = 0; i < returnArray.length; i++) {
		if(typeof returnArray[i][sortProp] == undefined) {
			console.error("Not all objects have the requested property");
			return;
		}
		if(typeof returnArray[i][sortProp] == "number") {
			numeric = true;
		}
	}
	if(!sortLH) sortLH = false;
	if(!startAt) startAt = 0;
	if(!endAt) endAt = returnArray.length;
	switch(sortLH) {
		case false:
			for(var i = 0; i < returnArray.length; i++) {
				for(var j = i; j < returnArray.length; j++) {
					if(numeric == false) {
						if(returnArray[i][sortProp].toUpperCase() > returnArray[j][sortProp].toUpperCase()) {
							var prev = returnArray[i];
							returnArray[i] = returnArray[j];
							returnArray[j] = prev;
						}
					}
					if(numeric == true) {
						if(returnArray[i][sortProp] < returnArray[j][sortProp]) {
							var prev = returnArray[i];
							returnArray[i] = returnArray[j];
							returnArray[j] = prev;
						}
					}
				}
			}
			break;
		case true:
			for(var i = 0; i < returnArray.length; i++) {
				for(var j = i; j < returnArray.length; j++) {
					if(numeric == false) {
						if(returnArray[i][sortProp].toUpperCase() < returnArray[j][sortProp].toUpperCase()) {
							var prev = returnArray[i];
							returnArray[i] = returnArray[j];
							returnArray[j] = prev;
						}
					}
					if(numeric == true) {
						if(returnArray[i][sortProp] > returnArray[j][sortProp]) {
							var prev = returnArray[i];
							returnArray[i] = returnArray[j];
							returnArray[j] = prev;
						}
					}
				}
			}
			break;
	}
	var finalArray = [ ];
	var ctr = 0;
	for(var i = startAt; i < endAt; i++) {
		finalArray[ctr] = returnArray[i];
		ctr++;
	}
	return finalArray;
}

Usage
array._objSort(string, boolean);
The first argument (sortProp) determines by which object property should the array be sorted
The second argument (sortLH) determines if the returned array should be sorted from highest to lowest or lowest to highest