Bogosort

Start with a few of the strongest sections from the source topic. These are research directions, not a list of keywords you must use.

High-confidence facts extracted from structured source data. Use them as anchors for further research.

Average performance

Θ ( n × n ! ) {\displaystyle \Theta (n\times n!)}

Best-case performance

Ω ( n ) {\displaystyle \Omega (n)}

Class

Sorting

Data structure

Array

Worst-case performance

Unbounded (randomized version), O ( n × n ! ) {\displaystyle O(n\times n!)} (deterministic version)

Worst-case space complexity

O ( 1 ) {\displaystyle \mathrm {O} (1)}