npm package discovery and stats viewer.

Discover Tips

  • General search

    [free text search, go nuts!]

  • Package details

    pkg:[package-name]

  • User packages

    @[username]

Sponsor

Optimize Toolset

I’ve always been into building performant and accessible sites, but lately I’ve been taking it extremely seriously. So much so that I’ve been building a tool to help me optimize and monitor the sites that I build to make sure that I’m making an attempt to offer the best experience to those who visit them. If you’re into performant, accessible and SEO friendly sites, you might like it too! You can check it out at Optimize Toolset.

About

Hi, 👋, I’m Ryan Hefner  and I built this site for me, and you! The goal of this site was to provide an easy way for me to check the stats on my npm packages, both for prioritizing issues and updates, and to give me a little kick in the pants to keep up on stuff.

As I was building it, I realized that I was actually using the tool to build the tool, and figured I might as well put this out there and hopefully others will find it to be a fast and useful way to search and browse npm packages as I have.

If you’re interested in other things I’m working on, follow me on Twitter or check out the open source projects I’ve been publishing on GitHub.

I am also working on a Twitter bot for this site to tweet the most popular, newest, random packages from npm. Please follow that account now and it will start sending out packages soon–ish.

Open Software & Tools

This site wouldn’t be possible without the immense generosity and tireless efforts from the people who make contributions to the world and share their work via open source initiatives. Thank you 🙏

© 2025 – Pkg Stats / Ryan Hefner

dumb-sorts

v1.0.4

Published

collection of dumb sorting algorithms

Readme

Dumb Sorts

A collection of inefficient and absurd sorting algorithms that nobody should ever use.

Installation

npm install dumb-sorts

Usage

import { bogoSort, stalinSort, sleepSort } from 'dumb-sorts';

const unsortedArray = [3, 1, 4, 1, 5, 9, 2, 6];

// Synchronous sorts
const bogoSorted = bogoSort(unsortedArray);
const stalinSorted = stalinSort(unsortedArray);

// Asynchronous sorts
const sleepSorted = await sleepSort(unsortedArray);

Available Algorithms

Synchronous Sorts

Bogo Sort

Randomly shuffles the array until it happens to be sorted. Average time complexity: O(n * n!).

const sorted = bogoSort([3, 1, 4, 1, 5]);

Bozo Sort

Like Bogo Sort but only swaps two random elements at a time.

const sorted = bozoSort([3, 1, 4, 1, 5]);

Stalin Sort

Removes any element that is smaller than the previous one. The result is technically sorted.

const sorted = stalinSort([1, 5, 2, 7, 3, 9]);

Alphabetical Sort

Converts numbers to strings and sorts them alphabetically.

const sorted = alphabeticalSort([1, 10, 2, 20]);

Permutation Sort

Generates every possible permutation of the array until it finds the sorted one. Time complexity: O(n!).

const sorted = permutationSort([3, 1, 2]);

Asynchronous Sorts

Sleep Sort

Each number waits for a time proportional to its value, then adds itself to the result.

const sorted = await sleepSort([3, 1, 4, 1, 5]);

Gemini Sort

Uses Google's Gemini AI to sort your array.

const sorted = await geminiSort([3, 1, 4], 'your-api-key');

Performance Comparison

| Algorithm | Best Case | Average Case | Worst Case | Space | |-----------|-----------|--------------|------------|-------| | Bogo Sort | O(n) | O(n × n!) | O(∞) | O(1) | | Bozo Sort | O(n) | O(n × n!) | O(∞) | O(1) | | Stalin Sort | O(n) | O(n) | O(n) | O(n) | | Alphabetical Sort | O(n log n) | O(n log n) | O(n log n) | O(n) | | Permutation Sort | O(n × n!) | O(n × n!) | O(n × n!) | O(n!) | | Sleep Sort | O(max(array)) | O(max(array)) | O(max(array)) | O(n) | | Gemini Sort | O(HTTP) | O(HTTP + AI) | O(API limit) | O(internet) |

Why Would You Use This?

You probably shouldn't.