Community Learn Tools Library Leisure

English

Home > Web Front-end > JS Tutorial > JavaScript method to implement quick sort_javascript skills

JavaScript method to implement quick sort_javascript skills

WBOY

Release： 2016-05-16 15:47:53

Original

1067 people have browsed it

The example in this article describes how to implement quick sorting in JavaScript. Share it with everyone for your reference. The specific implementation method is as follows:

<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>

Copy after login

I hope this article will be helpful to everyone’s JavaScript programming design.

Related labels：

javascript Quick sort

source：php.cn

Previous article：jquery-tips floating prompt plug-in sharing_jquery Next article：Summary of commonly used regular expressions in javascript_javascript skills

Statement of this Website

The content of this article is voluntarily contributed by netizens, and the copyright belongs to the original author. This site does not assume corresponding legal responsibility. If you find any content suspected of plagiarism or infringement, please contact admin@php.cn