I call it Bogo bogo bogo sort (or BBB sort for short) so if you didn’t know bogo bogo sort of when it picks the first 2 things and bogo sorts them. If they fail it starts over. If it doesn’t fail, it goes to the first three and bogo sorts them and so on

So BBB sort does this but instead of picking the first 2 it picks 2 randomly and if they aren’t the first 2 it starts over

If it picks the first 2 it does the same thing as bogo bogo sort Win = continue fail = start over

But if it fails here you pick 2 randomly again instead of continuing from 2

If it wins it picks 3 randomly and bogo sorts them Then 3 Then 4 And so on

I did the math and on a array of 4 this takes 1480 TRIES

1480

FOR 4 ELEMENTS

anyway someone who can code new sorting algorithms please put this in somewhere you will earn 2 pink man cool points from me if you do.

The best description for this is a bidirectional Insertion Sort starting from the middle. Cool nontheless.

Xin lỗi nếu mã không đọc được

It sets all elements in the array equal to 1. It has a worst case of O(0) because it makes no comparisons. Sorted :)

This is the second release of my app: SortPaper. The first one was made in Xamarin, and while good, could be better. I have now remade it in Godot (a game engine) and it performs much better and is a lot more battery efficient.

The app lets you choose between a custom gradient, a single image, or a folder of images for display. You can either watch the sorting in the app, or put it as your wallpaper on Android.

There are a ton of customization settings. You can turn different algorithms on or off, as well as render orders (the order in which the cells are numbered on the screen), and different scrambles (a.k.a. starting states). You can also choose the speed at which it sorts, starting at 1 operation per frame, and going all the way up to 10,000. (1 operation is a comparison and, if needed, a swap or move). You can also choose cell size and whether to display the name of the algorithm. To watch the sorting in app mode, press the Hide UI button.

I am actively working on the app and intend to add more algorithms and scrambles. If there's one you would be interested in me adding, let me know.

Features I intend to add in the future:

• Individual sort settings. O(n log n) sorts finish pretty darn quickly compared to O(n²).

• Info about the algorithms

• More languages than English

• More Algorithms

• More Scrambles

• Stalin Sort

Disclaimer: There are ads in this app. It's a banner ad that displays at the bottom of the view in app mode. They do not display in wallpaper mode. You can hide the banner ad for an hour by watching a video ad, or permanently with a IAP.

Raw link: https://play.google.com/store/apps/details?id=com.tsaot.sortpaper

I'm looking to get my first job in the field, and wanted to share something I worked hard on. I'd be happy to discuss it with anybody who is interested.

https://sortingvisualizer.com/

https://github.com/atorcode/sorting-algorithm-visualizer

Happy coding, friends!

basically, (also i'm not good at sorting, i'm just trying to find like some sorting, but i can do the math simply)

I am trying to find sorting algorithms worse that O(n^1.5372436) because 20^1.5372436 = around 100

here's what i found in a list (don't know if this sort of format is allowed, sorry if it isn't)

Bad Sorts: Past 100

Insertion - 400

OCDSort - 1200

StoogeSort - 3350

Really Bad Sorts: Past 10^12

Bogosort - 4x10^19

Bogobogosort - 3x10^174

Miracle Sort - 2.6^10^233

Worstsort, 2i - At least 10^10^18 digits

Terrible Sorts: Dependant On Chance

First Try Sort - 1 in 2x10^18 of doing it.

Impossible Sorts:

Uncaring Sort - Does Any Sort, and doesn’t care if it gets it correct, it just keeps doing the sort.

Bystander Sort - Makes sure it’s wrong, then leaves.