A Few Sorting Algorithms

mods = {
  { name = "ComputerCraft", version = "1.7", mcVersion = "1.7", author = "dan200" },
  { name = "Redpower", version = "2.0.6", mcVersion = "1.4.6", author = "Eloraam" },
  { name = "Not Enough Items", version = "1.0.5.104", mcVersion = "1.8", author = "ChickenBones" }
}

local function compare(data1,data2)
  local sortOrder = {"version","name","mcVersion","author"} -- Sorts in this order, first is the top priority
  for a,b in pairs(sortOrder) do --# Iterates through sortOrder
	if data1[b] ~= data2[b] then --# Example: data1 is mods[1] and b is 'name'
	  return data1[b]>data2[b] --# REMEMBER: use the '>' sign for INSERTION sort, '<=' for MERGE sort
	end
  end
  return true --# The enteries are the same, just pretend data1 is bigger
end

local function compare(data1,data2)
  return data1 <= data2 --# REMEMBER: <= is REQUIRED for MERGE SORT
end
local function lMerge2(array, p, q, r)
  local n1 = q - p + 1
  local n2 = r - q
  local i
  local j
  local left = {}
  for i = 1, n1 do
	left[i] = array[p + i - 1]
  end
  left[n1 + 1] = math.huge
  local right = {}
  for j = 1, n2 do
	right[j] = array[q + j]
  end
  right[n2 + 1] = math.huge
  i = 1
  j = 1
  for k = p, r do
	if compare(left[i],right[j]) then
	  array[k] = left[i]
	  i = i + 1
	else
	  array[k] = right[j]
	  j = j + 1
	end
  end
end
local function lMerge(array, p, r)
  p = p or 1
  r = r or #array
  if p < r then
	local q = math.floor((p + r) / 2)
	lMerge(array, p, q)
	lMerge(array, q + 1, r)
	lMerge2(array, p, q, r)
  end
end
function merge(tableToSort)
  local copyTable = {}
  for i = 1, #tableToSort do
	copyTable[i] = tableToSort[i]
  end
  lMerge(copyTable)
  return copyTable
end

local function compare(data1,data2)
  return data1 > data2 --# REMEMBER: Use > for INSERTION SORT
end
function insertion(tToSort)
  local copyToSort = {}
  for i = 1, #tToSort do
	copyToSort[i] = tToSort[i]
  end
  local len = #copyToSort
  for j = 2, len do
	local key = copyToSort[j]
	local i = j - 1
	while i > 0 and compare(copyToSort[i],key) do
	  copyToSort[i + 1] = copyToSort[i]
	  i = i - 1
	end
	copyToSort[i + 1] = key
  end
  return copyToSort
end