Bogo sort, you must be joking ?

Slow runtimes are no laughing matter Mr. Joker sir !
class Array   def sorted?     for x in 1 ... self.length      return false if self[x-1] > self[x]     end  return true end  def bogosort   self.shuffle! until self.sorted?    return self  end end#This is what Bogo sort looks like in Ruby ! 
Notice the other runtimes on this chart, way faster then Bogo Sort.

--

--

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store