Submission Here

or just fork repo

Slow Sorting Algorithm Challenge:

The coder must write a sorting algorithm that sorts a list of integers in ascending order.

The algorithm must be intentionally designed to be as slow as possible without any manual slowdowns of the code. ex:

• Adding deliberate wait times or sleep functions to the code.
• Adding unnecessary loops or iterations to the code.
• No redundant variables, operations, loops etc.

The algorithm must not use any built-in sorting functions or libraries.

The algorithm must not use any external resources or libraries.

The algorithm must be implemented in a language of the coder's choice.

The algorithm must be able to handle lists of any length (tho the given inputs are of length 50, 1k, 10k and 1m).

The algorithm must be deterministic, meaning that given the same input, it should produce the same output every time.

Time complexity analysis and an explanation of the design choices made to intentionally slow down the algorithm are welcome (example)

Extra smiles for well-documented (example) and readable code (don't use single letter variable names please)

The algorithm must be functional and able to correctly sort a list of integers in ascending order.

The point of this is to come up with creative but stupid sorts

Input format

n // size of list
A1 // list of numbers
A2
...
An

constraints: -size <= An <= size

Participation

• You can implement your algorithm in slow_sort.py slow_sort() function
• You can verify the correctness of your algorithm by running verifier.py
• You can compare your algorithm to Bubble Sort by running compare.py (This can take long!)
• Solutions can be submitted here (or just fork repo)