Advanced Search

Return to Snippet

Revision: 44123
at April 6, 2011 15:18 by naren1012
Updated Code 
<html>
<head>
<script>
	function quickSort(input) {
		if (input.length <= 1) return input;
		var pivot = Math.floor(Math.random()*input.length)
		var less = [], greater=[];
		var pivotElem = input.splice(pivot,1)
		for (x in input) {
			if (input[x] <= pivotElem[0])
				less.push(input[x])
			else
				greater.push(input[x])
		}
		return [].concat(quickSort(less),pivotElem,quickSort(greater));
	}
	
	input = []
	inputSize = 1000
        highestInputValue = 100
	for (i=0;i<inputSize;i++) {
		input.push(Math.floor(Math.random()*highestInputValue))
	}
	document.writeln(quickSort(input))
</script>
</head>
	
</body>
</html>

Revision: 44122
at April 6, 2011 15:16 by naren1012
Initial Code 
<html>
<head>
<script>
	function quickSort(input) {
		if (input.length <= 1) return input;
		var pivot = Math.floor(Math.random()*input.length)
		var less = [], greater=[];
		var pivotElem = input.splice(pivot,1)
		for (x in input) {
			if (input[x] <= pivotElem[0])
				less.push(input[x])
			else
				greater.push(input[x])
		}
		return [].concat(quickSort(less),pivotElem,quickSort(greater));
	}
	
	input = []
	inputSize = 1000
        highestInputValue = 100
	for (i=0;i<inputSize;i++) {
		input.push(Math.floor(Math.random()*highestInputValue))
	}
	document.writeln(quickSort(input))
</script>
</head>
<body>
	
</body>
</html>
Initial URL 









Initial Description





This is implementation of pseudocode given in quicksort wikipedia page. Did it just for fun :)









Initial Title





Quicksort implementation in javascript









Initial Tags





javascript









Initial Language





JavaScript