I have been looking around the web for a while and I am wondering if there is a 'stable' defacto implementation of quicksort that is generally used?  I can write my own but why reinvent the wheel......

I've never coded this myself before, unfortunately. My implementation operates on a custom class based on sorting the "date" field. Yes I am fully aware I can use the built-in Javascript sort and specify the comparator function but that&#...

My Quicksort is working perfectly and the code is here:  https://gist.github.com/RoloRobot/b2e15af9ab0d8c1bdbdd  What I want to do is make it sort not only numbers, but strings and objects as well. How would I go about doing that? Any help would be a...

I'm currently digging into the theoretical field of algorithms for university and I've implemented a version of the Quicksort based on how I understood the algorithm works. After that I've compared it to existing solutions and my implemen...

I tried to write some code to get quicksort running in javascript, but the final array is returned without duplicates (if it originally had some)  function quickSort(array) {   if (array.length <= 1) return array;   var pivot = array[0];  var left...

I have a table and I want to sort it by one field. However, I need to carry another field, which will provide the needed data for swapping the table entries. It works, but when the field that we sort by has a value 10 (maybe this will be a problem fo...

I'm wondering why i'm hitting an infinite loop in my recursive quick sort algorithm  when I try to run the return statement return (quicksort(less).concat([swapPos], quicksort(more)) it enters an infinite loop.  http://jsbin.com/uMAmIXA/1/edi...

I am learning selection sort.  I am getting the correct output for some values, but not for all the values, don't know why??  Please find below code snippet:   function selectionSortRecursion(arr,p){     if( arr.length === 1){         return p;...

I have a recursive function that sorts an array of numbers:  function quickSort(initArray) {     if (initArray.length <= 1) {          return initArray;     } else {          var left = [];         var right = [];         var newArray = [];...

Hoping to get some help with this Quicksort algorithm in Javascript (it's not for homework or anything, just fun) - it's not working and I'm not sure where I'm going wrong.  function quicksort ( arr ) {         // Launch the sorting p...