Skip to content

Added Miracle sort#26

Open
daenamnu wants to merge 1 commit into
mszula:mainfrom
daenamnu:main
Open

Added Miracle sort#26
daenamnu wants to merge 1 commit into
mszula:mainfrom
daenamnu:main

Conversation

@daenamnu
Copy link
Copy Markdown

@daenamnu daenamnu commented Apr 22, 2026

Miracle sort is the supreme way of sorting arrays.

Reasons for adding it:

  • It's elegant: Very little code is needed for its implementation.
  • It's memory efficient: Its space complexity is O(1).
  • It's performant: Data may be sorted instantly. Worst case performance is unmeasurable. (As far as I'm concerned no time complexity is better than some time complexity. Speaks for the algorithms time simplicity!)

@mszula
Copy link
Copy Markdown
Owner

mszula commented Apr 26, 2026

Hey there!
Nicely done. Lemme review it

@mszula
Copy link
Copy Markdown
Owner

mszula commented May 20, 2026

Well... I review it. Basically, the idea is good. The miracle sort is one of the ridiculous "sorting" algorithms. However, the behavior of this algorithm can be very confusing for the user, as it appears frozen in the visualization. I'm afraid we can't leave it in this state. Do you have any ideas on how to improve it?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants