Created
July 16, 2012 19:10
-
-
Save ttezel/3124434 to your computer and use it in GitHub Desktop.
Simple QuickSort in JS
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| function quickSort (arr) { | |
| if (!arr.length) | |
| return arr | |
| var pivot = arr.splice(0, 1) | |
| var less = [] | |
| var greater = [] | |
| arr.forEach(function (el) { | |
| if (el <= pivot) | |
| less.push(el) | |
| else | |
| greater.push(el) | |
| }) | |
| return quickSort(less).concat(pivot, quickSort(greater)) | |
| } | |
| var test = [ 1, 7, 3, 6, 8, 9, 10, 45, 23, 54, 4, 3 ] | |
| var sorted = quickSort(test) | |
| console.log('sorted', sorted) |
your code is my study material in 2023
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Great question @zero-t4, I'm curious about that too