Basic sorting algorithms

Author: vtrbtf

.DS_Store

@@ -0,0 +1,16 @@
+#!/bin/bash -u
+items=("$@")
+len="${#items[@]}"
+i=1
+while [ $i -lt $len ]; do
+	key="${items[i]}"
+	j=$((i-1));
+	while  [ $j -ge 0 ] && [ ${items[j]} -gt $key ]; do
+		items[$((j+1))]=${items[j]}
+		j=$((j-1))
+	done
+	i=$((i+1))
+	items[$((j+1))]="${key}"
+done
+
+echo  "${items[@]}"

Classical/queue/shell/main.sh renamed to Classical/data-structures/queue/shell/main.sh

@@ -0,0 +1,18 @@
+#!/bin/bash
+
+items=("$@")
+len=${#items[@]}
+for (( i=0; i < $((len - 1)); i+=1)); do
+	min_index=$i
+	for (( j=i+1; j < len; j+=1)); do
+		if (( items[j] < items[min_index])); then
+			min_index=$j
+		fi
+	done
+
+	temp=${items[i]}
+	items[$i]=${items[min_index]}
+	items[min_index]=$temp
+done
+
+echo "${items[@]}"