[−][src]Trait bad::StalinSort

pub trait StalinSort {
    fn stalin_sort(&mut self);

    fn stalin_sorted(&self) -> Self
    where
        Self: Clone,
    { ... }
}

A single pass, no-nonsense sorting algorithm with O(n) complexity that removes elements until the value is sorted.

This is a reference to Joseph Stalin's horrible regime over Russia.

Official records reveal 799,455 documented executions in the Soviet Union between 1921 and 1953; 681,692 of these were carried out between 1937 and 1938, the years of the Great Purge.

Source

I came up with a single pass O(n) sort algorithm I call StalinSort. You iterate down the list of elements checking if they're in order. Any element which is out of order is eliminated. At the end you have a sorted list.
- mathew ✅ (@mathew@mastodon.social)

Examples

These methods can be used similarly to how one would use sort.

An extra stalin_sorted method is added for convenience for when the type implements Clone.

use bad::StalinSort;

let values = vec![1, 2, 3, 0, 42, -2];
assert_eq!(values.stalin_sorted(), [1, 2, 3, 42]);

Required methods

fn stalin_sort(&mut self)

Removes unsorted elements until self is sorted.

Complexity: O(n)

Loading content...

Provided methods

fn stalin_sorted(&self) -> Self where
    Self: Clone, 

Returns a copy of self that's sorted by removing unsorted elements.

Complexity: O(n)

Loading content...

Implementations on Foreign Types

impl<A: PartialOrd> StalinSort for Vec<A>[src]

Loading content...

Implementors

Loading content...