JavaScript Sorting Algorithm: Bogosort

Last update on March 06 2025 11:48:51 (UTC/GMT +8 hours)

JavaScript Sorting Algorithm: Exercise-14 with Solution

Bogosort

Write a JavaScript program to sort a list of elements using Bogosort.

In computer science, bogosort is a particularly ineffective sorting algorithm based on the generate and test paradigm. The algorithm successively generates permutations of its input until it finds one that is sorted. It is not useful for sorting, but may be used for educational purposes, to contrast it with other more realistic algorithms.

Sample Solution: -

HTML Code:

<!DOCTYPE html>
  <html>
  <head>
  <meta charset="utf-8">
  <title>JavaScript program of Bogosort</title>
  </head>
  <body></body>
</html>

JavaScript Code:

function Bogosort(arr){
    var isSorted = function(arr){
        for(var i = 1; i < arr.length; i++){
            if (arr[i-1] > arr[i]) {
                return false;
            }
        }
        return true;
    };

    function shuffle(arr){
        var count = arr.length, temp, index;

        while(count > 0){
            index = Math.floor(Math.random() * count);
            count--;

            temp = arr[count];
            arr[count] = arr[index];
            arr[index] = temp;
        }

        return arr;
    }

   function sort(arr){
        var sorted = false;
        while(!sorted){
            arr = shuffle(arr);
            sorted = isSorted(arr);
        }
        return arr;
    }

    return sort(arr);
}


var arra = [3, 0, 2, 5, -1, 4, 1]; 
console.log("Original Array Elements"); 
console.log(arra); 
console.log("Sorted Array Elements"); 
console.log(Bogosort(arra));

Sample Output:

Original Array Elements
[3,0,2,5,-1,4,1]
Sorted Array Elements
[-1,0,1,2,3,4,5]

Flowchart:

JavaScript Searching and Sorting Algorithm Exercises: Bogosort

Live Demo:

See the Pen searching-and-sorting-algorithm-exercise-14 by w3resource (@w3resource) on CodePen.

For more Practice: Solve these Related Problems:

Write a JavaScript function that implements bogosort by generating random permutations until the array is sorted.
Write a JavaScript function that limits the number of shuffles to prevent infinite loops in bogosort.
Write a JavaScript function that logs the number of permutations tried before the array is sorted.
Write a JavaScript function that compares the performance of bogosort with a conventional sort on small arrays.

Improve this sample solution and post your code through Disqus

Previous: Write a JavaScript program to sort a list of elements using Pancake sort.
Next: Write a JavaScript program to sort an array of numbers, using the bucket sort algorithm.