Rumble.Bozosort 0.0.2

bozosort

Implementation of the bozosort sorting algorithm.

This repository contains the Rumble.Bozosort class library and Rumble.Bozosort.Demo.Runnable console application. All the content in the repository is an original work created as a personal project, and serves as a .NET C# adaptation of the infamous bozosort algorithm.

Description

The Rumble.Bozosort is a .NET C# implementation of Bozosort — a highly inefficient sorting algorithm that operates by repeatedly selecting two elements of the list at random and swapping them if they are in the wrong order. This process continues until the entire list is sorted. Due to its random nature, Bozosort has an unbounded worst-case time complexity, and is typically used as a humorous example of how not to design an algorithm.

The Rumble.Bozosort.Demo.Runnable is a console application demonstrating the usage of the Rumble.Bozosort library.

Usage

WARNING: The Rumble.Bozosort library is NOT intended for use in any real-world, production-level software. It is highly inefficient and is provided here for educational and entertainment purposes only.

Rumble.Bozosort Library

using System;
using Rumble.Bozosort;

var sequence = new int[] { 3, 2, 4, 1, 5 };
var sorter = Bozosorter<int>.Factory.New();

sorter.Started += (sender, args) => Console.WriteLine($"Sorting has been started");
sorter.Completed += (sender, args) => Console.WriteLine($"Sorting has been completed in {args.ElapsedTime.TotalSeconds} seconds");
sorter.IterationCompleted += (sender, args) => Console.WriteLine
(
    $"Iteration: {args.IterationNumber}. " +
    $"Changes: {args.FirstElement} <=> {args.SecondElement}. " +
    $"Sequence: {string.Join(separator: " ", args.Sequence)}."
);

sorter.Run(sequence);

Rumble.Bozosort.Demo.Runnable Console Application

After building the solution, run the Rumble.Bozosort.Demo.Runnable console application. It demonstrates a simple usage of the Rumble.Bozosort library.

History

The original creator of the bozosort algorithm isn't definitively known, as it's more of a concept used to illustrate an inefficient sorting method rather than a formally recognized algorithm.

Note

This project is made out of pure love for .NET C#. It serves as a pet-project written just-for-fun. All the code here is 100% original.