insertion sort

Author: chen0040

README.md

@@ -191,3 +191,26 @@ for i=0,(a:size()-1) do
     print(a:get(i))
 end
 ```
+
+### Sorting (Insertion Sort)
+
+```lua
+local list = require("lualgorithms.data.list")
+local a = list.create()
+a:add(100)
+a:add(200)
+a:add(300)
+a:add(600)
+a:add(200)
+a:add(400)
+a:add(340)
+a:add(120)
+a:add(10)
+
+local insertion = require("lualgorithms.sorting.insertion")
+insertion.sort(a, function(a1, a2) return a1 - a2 end)
+
+for i=0,(a:size()-1) do
+    print(a:get(i))
+end
+```

note/publish.txt

@@ -1,6 +1,6 @@
 # follow this link: https://github.com/luarocks/luarocks/wiki/creating-a-rock
 
-git tag v1.0.4
+git tag v1.0.5
 git push --tags
 
-luarocks publish rockspecs/lualgorithms-1.0-4.rockspec --api-key=<api-key>
+luarocks publish rockspecs/lualgorithms-1.0-5.rockspec --api-key=<api-key>

rockspecs/lualgorithms-1.0-5.rockspec

@@ -0,0 +1,33 @@
+package = "lualgorithms"
+version = "1.0-5"
+source = {
+   url = "git://github.com/chen0040/lua-algorithms.git",
+   tag = "v1.0.5",
+}
+description = {
+   summary = "Lua Algorithms Library",
+   detailed = [[
+      Lua implementation for algorithms and data structures
+      found in Java
+   ]],
+   homepage = "https://github.com/chen0040/lua-algorithms",
+   license = "MIT/X11"
+}
+dependencies = {
+   "lua >= 5.1, < 5.4"
+}
+build = {
+   type = "builtin",
+   modules = {
+      -- Note the required Lua syntax when listing submodules as keys
+      ["lualgorithms.data.stack"] = "src/data/stack.lua",
+      ["lualgorithms.data.list"] = "src/data/list.lua",
+      ["lualgorithms.data.queue"] = "src/data/queue.lua",
+      ["lualgorithms.data.minpq"] = "src/data/minpq.lua",
+      ["lualgorithms.data.maxpq"] = "src/data/maxpq.lua",
+      ["lualgorithms.data.hashmap"] = "src/data/hashmap.lua",
+      ["lualgorithms.data.redblacktree"] = "src/data/redblacktree.lua",
+      ["lualgorithms.sorting.selection"] = "src/sorting/selection.lua",
+      ["lualgorithms.sorting.insertion"] = "src/sorting/insertion.lua",
+   }
+}

spec/insertion_sort_spec.lua

@@ -0,0 +1,32 @@
+--
+-- Created by IntelliJ IDEA.
+-- User: chen0
+-- Date: 28/6/2017
+-- Time: 9:16 AM
+-- To change this template use File | Settings | File Templates.
+--
+
+describe("Insertion Sort", function()
+    it("should sort ascendingly", function()
+        local list = require("data.list")
+        local a = list.create()
+        a:add(100)
+        a:add(200)
+        a:add(300)
+        a:add(600)
+        a:add(200)
+        a:add(400)
+        a:add(340)
+        a:add(120)
+        a:add(10)
+
+        local insertion = require("sorting.insertion")
+        insertion.sort(a, function(a1, a2) return a1 - a2 end)
+
+        for i=0,(a:size()-2) do
+            assert.is_true(a:get(i) <= a:get(i+1))
+        end
+
+    end)
+end)
+

src/sorting/insertion.lua

@@ -0,0 +1,31 @@
+--
+-- Created by IntelliJ IDEA.
+-- User: chen0
+-- Date: 28/6/2017
+-- Time: 10:44 AM
+-- To change this template use File | Settings | File Templates.
+--
+
+insertion = {}
+insertion.__index = insertion
+
+function insertion.sort(a, comparator)
+    local N = a:size()
+    for i=1,(N-1) do
+        for j=(i-1),0,-1 do
+            if comparator(a:get(j+1), a:get(j)) < 0 then
+                insertion.exchange(a, j, j+1)
+            else
+                break
+            end
+        end
+    end
+end
+
+function insertion.exchange(a, i, j)
+    local temp = a:get(i)
+    a:set(i, a:get(j))
+    a:set(j, temp)
+end
+
+return insertion