March 2014 update

Task/Sorting-algorithms-Bead-sort/AutoHotkey/sorting-algorithms-bead-sort-1.ahk

@@ -0,0 +1,24 @@
+BeadSort(data){
+	Pole:=[]	, TempObj:=[], Result:=[]
+	for, i, v in data {
+		Row := i
+		loop, % v
+			MaxPole := MaxPole>A_Index?MaxPole:A_Index	, Pole[A_Index, row] := 1
+	}
+
+	for i , obj in Pole {
+		TempVar:=0	,	c := A_Index
+		for n, v in obj
+			TempVar += v
+		loop, % TempVar
+			TempObj[c, A_Index] := 1
+	}
+
+	loop, % Row {
+		TempVar:=0	,	c := A_Index
+		Loop, % MaxPole
+			TempVar += TempObj[A_Index,c]
+		Result[c] := TempVar
+	}
+	return Result
+}

Task/Sorting-algorithms-Bead-sort/AutoHotkey/sorting-algorithms-bead-sort-2.ahk

@@ -0,0 +1,3 @@
+for i, val in BeadSort([54,12,87,56,36])
+	res := val (res?",":"") res
+MsgBox % res