algorithm/JavaScript
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/JavaScript.git synced 2026-03-13 15:21:15 +08:00
Code Issues Packages Projects Releases Wiki Activity

style: Fixed most styles (according to standardjs)

Browse Source
This commit is contained in:
Rak Laptudirm
2021-05-21 11:16:11 +05:30
parent 37ef611136
commit ca4c1a62af
22 changed files with 176 additions and 176 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
Sorts/QuickSort.js
View File

@@ -17,16 +17,16 @@
*/
function quickSort (items) {
var length = items.length
const length = items.length
if (length <= 1) {
return items
}
var PIVOT = items[0]
var GREATER = []
var LESSER = []
const PIVOT = items[0]
const GREATER = []
const LESSER = []
for (var i = 1; i < length; i++) {
for (let i = 1; i < length; i++) {
if (items[i] > PIVOT) {
GREATER.push(items[i])
} else {
@@ -34,7 +34,7 @@ function quickSort (items) {
}
}
var sorted = quickSort(LESSER)
let sorted = quickSort(LESSER)
sorted.push(PIVOT)
sorted = sorted.concat(quickSort(GREATER))
@@ -43,7 +43,7 @@ function quickSort (items) {
// Implementation of quick sort
var ar = [0, 5, 3, 2, 2]
let ar = [0, 5, 3, 2, 2]
// Array before Sort
console.log(ar)
ar = quickSort(ar)