diff --git a/.idea/.gitignore b/.idea/.gitignore
new file mode 100644
index 0000000000000000000000000000000000000000..bea6afbbdf28d9866e696e24d3062b09042387d1
--- /dev/null
+++ b/.idea/.gitignore
@@ -0,0 +1,8 @@
+# Default ignored files
+/shelf/
+/workspace.xml
+# Datasource local storage ignored files
+/../../../:\lec08-sort\.idea/dataSources/
+/dataSources.local.xml
+# Editor-based HTTP Client requests
+/httpRequests/
diff --git a/.idea/lec08-sort.iml b/.idea/lec08-sort.iml
new file mode 100644
index 0000000000000000000000000000000000000000..d6ebd4805981b8400db3e3291c74a743fef9a824
--- /dev/null
+++ b/.idea/lec08-sort.iml
@@ -0,0 +1,9 @@
+
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/.idea/misc.xml b/.idea/misc.xml
new file mode 100644
index 0000000000000000000000000000000000000000..40674af8d699c0ff4e92f9e8639ff4904ce4bdea
--- /dev/null
+++ b/.idea/misc.xml
@@ -0,0 +1,6 @@
+
+
+
+
+
+
\ No newline at end of file
diff --git a/.idea/modules.xml b/.idea/modules.xml
new file mode 100644
index 0000000000000000000000000000000000000000..0457c01140e665c375999f05ea6c23d137e9e041
--- /dev/null
+++ b/.idea/modules.xml
@@ -0,0 +1,9 @@
+
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/.idea/vcs.xml b/.idea/vcs.xml
new file mode 100644
index 0000000000000000000000000000000000000000..35eb1ddfbbc029bcab630581847471d7f238ec53
--- /dev/null
+++ b/.idea/vcs.xml
@@ -0,0 +1,6 @@
+
+
+
+
+
+
\ No newline at end of file
diff --git a/work/src/Bubblesort.java b/work/src/Bubblesort.java
new file mode 100644
index 0000000000000000000000000000000000000000..54f677939197b01ed4b383efae37250a7334f694
--- /dev/null
+++ b/work/src/Bubblesort.java
@@ -0,0 +1,20 @@
+public class Bubblesort {
+ public class BubbleSort {
+ public void sort(int[] array) {
+ for (int i = 0; i < array.length; i++) {
+ for (int n = 0; n < array.length - 1 - i; n++) {
+ if (array[n] > array[n + 1]) {
+ swap(array, n, n + 1);
+ }
+ }
+ }
+ }
+
+ private void swap(int[] array, int minIndex, int index) {
+ int temp = array[index];
+ array[index] = array[minIndex];
+ array[minIndex] = temp;
+ }
+
+ }
+}
diff --git a/work/src/Insertionsort.java b/work/src/Insertionsort.java
new file mode 100644
index 0000000000000000000000000000000000000000..0e9ed405a5ba0d3aea5e4fcd0efec7ee5d890573
--- /dev/null
+++ b/work/src/Insertionsort.java
@@ -0,0 +1,17 @@
+public class Insertionsort {
+ public class InsertionSort {
+ public void sort(int[] array) {
+ for (int i = 1; i < array.length; i++) {
+ for (int n = i; n > 0 && array[n] < array[n - 1]; n--) {
+ swap(array, n, n - 1);
+ }
+ }
+ }
+
+ private void swap(int[] array, int minIndex, int maxIndex) {
+ int temp = array[minIndex];
+ array[minIndex] = array[maxIndex];
+ array[maxIndex] = temp;
+ }
+ }
+}
diff --git a/work/src/MergeSort.java b/work/src/MergeSort.java
new file mode 100644
index 0000000000000000000000000000000000000000..25a15f4dcc92699382a2d59ddf430ad19aaa62ae
--- /dev/null
+++ b/work/src/MergeSort.java
@@ -0,0 +1,41 @@
+public class MergeSort {
+ public static int[] sort(int[] array) {
+ return sort(array, 0, array.length-1);
+ }
+
+ private static int[] sort(int[] array, int left, int right) {
+ if (left == right) {
+ int temp = array[left];
+ int[] newNum = {temp};
+ return newNum;
+ }
+
+ int mid = left + (right - left) / 2;
+ int[] leftArr = sort(array, left, mid);
+ int[] rightArr = sort(array, mid + 1, right);
+ int[] newNum = new int[leftArr.length + rightArr.length];
+
+ int m = 0, i = 0, j = 0;
+ while (i < leftArr.length && j < rightArr.length) {
+ if (leftArr[i] < rightArr[j]) {
+ newNum[m] = leftArr[i];
+ i++;
+ } else {
+ newNum[m] = rightArr[j];
+ j++;
+ }
+ m++;
+ }
+ while (i < leftArr.length) {
+ newNum[m] = leftArr[i];
+ m++;
+ i++;
+ }
+ while (j < rightArr.length) {
+ newNum[m] = rightArr[j];
+ m++;
+ j++;
+ }
+ return newNum;
+ }
+}
diff --git a/work/src/QuickSort.java b/work/src/QuickSort.java
new file mode 100644
index 0000000000000000000000000000000000000000..721ac6a6b1c2cca23ea79a30db4b3d126e638142
--- /dev/null
+++ b/work/src/QuickSort.java
@@ -0,0 +1,29 @@
+public class QuickSort {
+ public static void sort(int[] array) {
+ sort(array, 0, array.length - 1);
+ }
+
+ public static void sort(int[] array, int start, int end) {
+ if (start < end) {
+ int i = start, j = end, x = array[start];
+ while (i < j) {
+ while (i < j && array[j] >= x) {
+ j--;
+ }
+ if (i < j) {
+ array[i++] = array[j];
+ }
+
+ while (i < j && array[i] < x) {
+ i++;
+ }
+ if (i < j) {
+ array[j--] = array[i];
+ }
+ }
+ array[i] = x;
+ sort(array, start, i - 1);
+ sort(array, i + 1, end);
+ }
+ }
+}
\ No newline at end of file
diff --git a/work/src/SelectionSort.java b/work/src/SelectionSort.java
new file mode 100644
index 0000000000000000000000000000000000000000..a9736bfc9b64706d3c943c45bb5667cec8de4154
--- /dev/null
+++ b/work/src/SelectionSort.java
@@ -0,0 +1,19 @@
+public class SelectionSort {
+ public static void sort(int[] array) {
+ for (int i = 0; i < array.length - 1; i++) {
+ int minIndex = i;
+ for (int n = i + 1; n < array.length; n++) {
+ if (array[minIndex] > array[n]) {
+ minIndex = n;
+ }
+ }
+ swap(array, minIndex, i);
+ }
+ }
+
+ private static void swap(int[] array, int minIndex, int index) {
+ int temp = array[index];
+ array[index] = array[minIndex];
+ array[minIndex] = temp;
+ }
+}
diff --git a/work/src/ShellsSort.java b/work/src/ShellsSort.java
new file mode 100644
index 0000000000000000000000000000000000000000..b8f0b8225930a8783689fa8c1a1293dc73ed112d
--- /dev/null
+++ b/work/src/ShellsSort.java
@@ -0,0 +1,19 @@
+public class ShellsSort {
+ public static void sort(int[] array) {
+ int gap = array.length;
+ do {
+ gap /= 2;
+ for (int i = 0; i < gap; i++) {
+ for (int j = i + gap; j < array.length; j += gap) {
+ int k = j - gap;
+ while (k >= 0 && array[k] > array[k + gap]) {
+ int temp = array[k];
+ array[k] = array[k + gap];
+ array[k + gap] = temp;
+ k -= gap;
+ }
+ }
+ }
+ } while (gap != 1);
+ }
+}
diff --git a/work/work.iml b/work/work.iml
new file mode 100644
index 0000000000000000000000000000000000000000..c90834f2d607afe55e6104d8aa2cdfffb713f688
--- /dev/null
+++ b/work/work.iml
@@ -0,0 +1,11 @@
+
+
+
+
+
+
+
+
+
+
+
\ No newline at end of file