The following are some code snippets that use jQuery to randomly sort items.

Sorting code snippet

The following functions use object literal format:

shuffleAds: function(arr) {
  for (var j, x, i = arr.length; i; j = parseInt(Math.random() * i), x = arr[--i], arr[i] = arr[j], arr[j] = x);
  return arr;
}

View the demo Another function that implements the same function:

function randsort(c) {
    var o = new Array();
    for (var i = 0; i < c; i++) {
        var n = Math.floor(Math.random() * c);
        if (jQuery.inArray(n, o) > 0) --i;
        else o.push(n);
    }
    return o;
}

I also think this jQuery Shuffle plugin is worth including:

/*
 * jQuery shuffle
 *
 * Copyright (c) 2008 Ca-Phun Ung
 * Dual licensed under the MIT (MIT-LICENSE.txt)
 * and GPL (GPL-LICENSE.txt) licenses.
 *
 * http://yelotofu.com/labs/jquery/snippets/shuffle/
 *
 * Shuffles an array or the children of a element container.
 * This uses the Fisher-Yates shuffle algorithm
 */

(function($) {

    $.fn.shuffle = function() {
        return this.each(function() {
            var items = $(this).children().clone(true);
            return (items.length) ? $(this).html($.shuffle(items)) : this;
        });
    }

    $.shuffle = function(arr) {
        for (var j, x, i = arr.length; i; j = parseInt(Math.random() * i), x = arr[--i], arr[i] = arr[j], arr[j] = x);
        return arr;
    }

})(jQuery);

FAQs about random sorting of jQuery arrays (FAQ)

How to randomly sort arrays with JavaScript without using jQuery?

Without using jQuery, you can randomly sort arrays in JavaScript using Fisher-Yates (also known as Knuth) shuffle algorithm. This algorithm works by iterating from the last element to the first element, exchanging each element with an element at a random index less than or equal to the current index. This is a simple implementation:

function shuffleArray(array) {
  for (let i = array.length - 1; i > 0; i--) {
    let j = Math.floor(Math.random() * (i + 1));
    [array[i], array[j]] = [array[j], array[i]];
  }
}

Can I randomize arrays in JavaScript using the .sort() method?

While technically randomizes arrays in JavaScript using the .sort() method, this is not recommended. The .sort() method is not intended to produce random sorting, and using it in this way results in biased results. The Fisher-Yates shuffle algorithm is a better choice for this task.

How to use jQuery to randomize the order of div elements?

The order of div elements can be randomized by using jQuery's .get() method to convert jQuery objects into an array, and then randomly sort the array and append the elements back to the parent element. Here is an example:

var parent = $("#parent");
var divs = parent.children();
divs.sort(function() { return Math.random() - 0.5; });
divs.detach().appendTo(parent);

What is the time complexity of Fisher-Yates shuffling algorithm?

Fisher-Yates shuffling algorithm has a time complexity of O(n), where n is the number of elements in the array. This makes it an effective choice for randomly sorting large arrays.

Can I randomly sort object arrays using Fisher-Yates shuffling algorithm?

Yes, the Fisher-Yates shuffle algorithm can be used to randomly sort arrays of elements of any type, including objects. The algorithm treats each element as a single unit, regardless of what data it contains.

How to randomly sort arrays in jQuery?

jQuery does not have a built-in method to sort arrays randomly, but JavaScript's Fisher-Yates shuffling algorithm can be used in conjunction with jQuery. Here is an example:

$.fn.shuffle = function() {
  var allElems = this.get(),
    getRandom = function(max) {
      return Math.floor(Math.random() * max);
    },
    shuffled = $.map(allElems, function() {
      var random = getRandom(allElems.length),
        randEl = $(allElems[random]).clone(true)[0];
      allElems.splice(random, 1);
      return randEl;
    });
  this.each(function(i) {
    $(this).replaceWith($(shuffled[i]));
  });
  return $(shuffled);
};

Is there a way to randomly sort arrays in JavaScript without modifying the original array?

Yes, you can create copies of arrays and sort them randomly. This can be used to create a replica using the .slice() method and then apply the Fisher-Yates shuffle algorithm to the replica.

Can I sort strings randomly in JavaScript?

Yes, you can randomly sort strings in JavaScript by converting strings into character arrays, sorting them randomly, and then reconcatenating the arrays into strings. Here is an example:

shuffleAds: function(arr) {
  for (var j, x, i = arr.length; i; j = parseInt(Math.random() * i), x = arr[--i], arr[i] = arr[j], arr[j] = x);
  return arr;
}

How to randomly sort arrays in a specific order?

Randomly sorting arrays in a specific order is an ambivalent term because random sorting means random order. If you need to arrange the array in a specific non-random order, you need to use a sorting algorithm instead of a random sorting algorithm.

Can I use the Fisher-Yates shuffle algorithm to sort the list randomly in jQuery?

Yes, you can use the Fisher-Yates shuffle algorithm to randomly sort the list in jQuery. You can use the .get() method to convert list items into an array, sort the array randomly, and then append the items back to the list.

This revised response maintains the original image and provide more concise and improved explanations. The code examples are also formatted for better reading.

The above is the detailed content of jQuery output array in random order. For more information, please follow other related articles on the PHP Chinese website!