big O algorithm -sorting

Question

I am learning big O algorithms and I learned all of them but now I can't remember the name for one of them. Let's say I have a deck of cards and I am trying to sort them by throwing them on the floor and hoping they get in order. What is that algorithm called? the one that jumbles the numbers in a list again and again until they are sorted. I know this is like the worst big O scenario but do not remember the name for it.

please help me

thank you

And just so you know, "big O" is a notation for measuring algorithm's complexity. Any algorithm's. You can't possibly have learned all the known algorithms, can you :) — D-side
– D-side, Commented Jul 16, 2015 at 20:01
Don't even try to learn all algorithms, it's way better if you learn where to find the relevant information. There are simply way too many algorithms and some are even just made out of fun/stupidity or simply to never be feasible at all (for example bogobogosort which is absolutely absurd). — AliciaBytes
– AliciaBytes, Commented Jul 16, 2015 at 20:05

Am_I_Helpful · Accepted Answer · 2015-07-16 22:01:26Z

4

This algorithm is called Bogosort .

edited Jul 16, 2015 at 22:01

Am_I_Helpful

19.2k7 gold badges53 silver badges76 bronze badges

answered Jul 16, 2015 at 20:00

theamateurdataanalyst

2,8546 gold badges42 silver badges78 bronze badges

Sign up to request clarification or add additional context in comments.

Comments

Maelstrom · Accepted Answer · 2015-07-16 21:30:54Z

-1

Bogosort - the name from bogus sort cause it's pretty bad when it comes to worst case big O(infinity).

answered Jul 16, 2015 at 21:30

Maelstrom

4532 silver badges9 bronze badges

Collectives™ on Stack Overflow

big O algorithm -sorting

2 Answers 2

Comments

Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

2 Answers 2

Comments

Comments

Your Answer

Sign up or log in

Post as a guest

Related