Bogosort Algorithm

Bogosort Data set

Bogosort Description

Bogosort is an inefficient sorting Algorithm. It is one of the only sorting algorithms to have a best case of O(n) and a worst case of O(infinity).

Bogosort Steps

  1. Randomize Positions of Data
  2. Check if sorted

References:

Wikipedia