bozosort


See On Github

Data

Contributor

Generic placeholder thumbnail

by Yonaba

in lua

Source Code

-- Bozosort description
-- See : http://en.wikipedia.org/wiki/Bogosort#Related_algorithms

-- Checks if an array is sorted
local function is_sorted(array, comp)
  local array_len = #array
  if array_len <= 1 then return true end
  for i = 2, array_len do
    if not comp(array[i-1], array[i]) then
      return false
    end
  end
  return true
end

-- The Bozosort implementation:
-- tbl  : a given table to be sorted
-- comp : (Optional) a comparison function.
--   defaults to function(a,b) return a < b end
-- Note: It is advised to use math.randomseed(os.time())
-- before calling this function. Lua's math.random() is
-- naturally deterministic and since Bozosort is based on
-- random swaps, this is necessary to ensure convergence
return function (tbl, comp)
  comp = comp or function(a, b) return a < b end
  local n = #tbl
  while not is_sorted(tbl, comp) do
    local i, j = math.random(n), math.random(n)
    tbl[i], tbl[j] = tbl[j], tbl[i]
  end
	return tbl
end
-- Tests for bozosort.lua
local bozosort = require 'bozosort'

local total, pass = 0, 0

local function dec(str, len)
	return #str < len
	   and str .. (('.'):rep(len-#str))
		  or str:sub(1,len)
end

local function run(message, f)
	total = total + 1
	local ok, err = pcall(f)
	if ok then pass = pass + 1 end
	local status = ok and 'PASSED' or 'FAILED'
	print(('%02d. %68s: %s'):format(total, dec(message,68), status))
end

-- Wrap for Lua's table sort so that it returns
-- the passed-in table
local function sort(t, comp)
	table.sort(t, comp)
	return t
end

-- Returns a copy of a an array
local function clone(t)
	local _t = {}
	for k,v in ipairs(t) do _t[k] = v end
	return _t
end

-- Checks if t1 and t2 arrays are the same
local function same(t1, t2)
	for k,v in ipairs(t1) do
		if t2[k] ~= v then return false end
	end
	return true
end


math.randomseed(os.time())

-- Note: Due to the nature of Bozosort, we will use
-- short tables to perform tests. For higher values of
-- n, we cannot predict the time it will take to perform the
-- sort.

run('Empty arrays', function()
	local t = {}
	assert(same(sort(clone(t)),bozosort(t)))
end)

run('Sorted array', function()
	local t = {1, 2, 3, 4, 5}
	assert(same(sort(clone(t)),bozosort(t)))
end)

run('Array sorted in reverse', function()
	local t = {5, 4, 3, 2, 1}
	assert(same(sort(clone(t)),bozosort(t)))
	local t = {5, 4, 3, 2, 1}
	local comp = function(a,b) return a>b end
	assert(same(sort(clone(t), comp),bozosort(t, comp)))
end)

run('Array containing multiple occurences of the same value', function()
	local t = {4, 4, 8, 2, 2}
	local comp = function(a,b) return a <= b end
	assert(same(sort(clone(t)),bozosort(t, comp)))
	local t = {0, 0, 0, 0, 0}
	local comp = function(a,b) return a <= b end
	assert(same(sort(clone(t)),bozosort(t, comp)))
end)

print(('-'):rep(80))
print(('Total : %02d: Pass: %02d - Failed : %02d - Success: %.2f %%')
	:format(total, pass, total-pass, (pass*100/total)))