gustavo-depaula / stalin-sort Goto Github PK

Add a stalin sort algorithm in any language you like ❣️ if you like give us a ⭐️

License: MIT License

JavaScript 2.29% C 10.42% Python 19.76% Go 3.54% Ruby 0.93% Kotlin 10.64% C# 9.99% Gnuplot 0.25% Haskell 1.25% Brainfuck 0.60% Java 6.01% Haxe 1.03% Perl 2.61% PHP 0.83% Swift 2.32% Erlang 0.60% Standard ML 1.42% C++ 22.61% Lua 1.52% Common Lisp 1.39%

hacktoberfest stalin-sort

stalin-sort's People

Contributors

Stargazers

Watchers

Forkers

raul4247 jemaf nicolasmota walteraa gegen07 vijiatjack nfd9001 snchlsn aftoul konung tatsuki-i vprjct zonuexe christopherrogers zeek0x nagahshi jorgenbele gabrielcarneiro97 schktjm caotic123 molpheus willianszwy angeart yt8492 mauricioszabo bokutin ry-itto uzimaru0000 suzu2469 oliveira-julio pv42 akiakishitai andrewpoulton watosar jasom maxhaton arthur-techempower harshadptl scottsedgwick pjb3005 tux9001 tjpalmer ebridge2 tmistui naoyaikeda 607011 freeonterminate rukletsov teamwau nickproud fwten chaw laskonka18 lhutyra devonparsons cykooz longjohnson freaky ktakahiro1729 moreheadm krundetz kisaragieffective momosetkn noslope-radio alphya kentarousuzuki mogron yammesicka wpwoodjr cmiram meilcli robjperez kanaya guesslin shanliwa1 fumiya-kume victor8733 shirbr510 hivewang mcichecki dimitrit sivabasker luksamuk lktk gauravgs nakamurakyo sergiolibe hamza-dar v0idpwn parka015 victorperin rodrigogribeiro tmaxthomas philipdb bluoxy andre-torbitoni jorge-leon fvilers jzheng2017 arkadye

stalin-sort's Issues

Other sorting algorithms?

I wonder how other sorting algorithms like: TrumpSort, PutinSort, BidenSort will look like? ))

BogoStalinSort

I propose addition of a new sorting algorithm which combines the best features of both stalinsort and bogosort.

The algorithm is fairly simple:
Just randomly remove elements until the array is in order.

Complexity ranges from O(n) to O(n²)

Hope this will make the world a better place!

hitler>satalin

Python code is incorrect

It gives unsorted array on input 1,5,2,4

More precise algorithm definition

As this project gets larger and larger, lol, we may need a less vague algorithm definition than a tweet so that it is easier to know if a PR is wrong.

Proposal: LeninSort

Example

(1 2 5 3 5 7) -> total = 23, avg = 3.8
(1 2 5 3 5 7) -> low < 3.8
(1 2 5 3 5 7) -> high > 3.8
(1 2 5 3 5 7) -> (1 2 3) save low in source, (5 5 7) move high to other container

Additional steps:
5. Try sort other containers with LeninSort
6. Merge all first containers
7. You can sort merged container with StalinSort

Peer Review

It seems like you have implemented StalinSort in more than 30 languages. But have the source codes been peer reviewed enough so that they only contain generic template classes that permits the development of general programs, and do not depend on the underlying container.

I really like this idea because it avoids function overhead and pays strict attention to time complexity of algorithm (always O(N)). But I hope this repository actually provide a structured generic components that can actually be used in a seamless way.

So 3, 4, 5, 6, 7, 8 and 9 are out of order in this array? [1, 2, 50, 3, 4, 5, 6, 7, 8, 9]

Any element which is out of order is eliminated

The 50 is the asshole here, why did the others have to die? Whyyy god whyy?

Test folder

I belive that would be good to have a folder with some default inputs and outputs, so anyone that wants to add some solution in any given language must post with it the outputs of his code too, its kind important to have some sort of validation to the added codes.

My idea is to create a folder with numbered folders in it, related to the number of the test, so if exists 20 tests, the folder tests will contain 20 folders numbered from 1 to 20.

stalin-sort/tests/1...20

In each of this folders will exist 2 .txt files, one called input and other one called output. This files will contain numbers with pipes ( | ) between them.

EXAMPLE

stalin-sort/tests/1

input.txt

1|2|3|4|5|2

output.txt

1|2|3|4|5