added text info

Vitalii Telychko · Vitalii Telychko · commit aee4fcc17b3c · 2018-11-04T21:51:48.000+02:00
diff --git a/MIT_Introduction_to_algorithms/1. The Role of Algorithms in Computing b/MIT_Introduction_to_algorithms/1. The Role of Algorithms in Computing
@@ -0,0 +1,6 @@
+1. An algorithm is any well-defined computational procedure that takes
+some value, or set of values, as input and produces some value, or set of values, as
+output. An algorithm is thus a sequence of computational steps that transform the
+input into the output. The algorithm describes a specific computational procedure for achieving that input/output relationship.
+
+2.
diff --git a/combinatorics/shuffle.js b/combinatorics/shuffle.js
diff --git a/data_structures/array/array.js b/data_structures/array/array.js
diff --git a/data_structures/linkedList/linkedList.js b/data_structures/linkedList/linkedList.js
@@ -33,6 +33,7 @@ function display() {
         currNode = currNode.next;
     }
 }
+
 function findPrevious(item) {
     var currNode = this.head;
     while (!(currNode.next === null) && (currNode.next.element !== item)) {
@@ -54,4 +55,4 @@ cities.insert('RusselVille', 'Conway');
 cities.insert('Alma', 'RusselVille');
 cities.display();
 cities.find('Alma');
-console.log(cities);
+cities.display();
diff --git a/index.html b/index.html
@@ -8,6 +8,6 @@
 </head>
 <body>
 
-<script src="optimization_algorithms/dynamic_programming/the_knapsack_problem.js"></script>
+<script src="sorting_algorithms/quicksort.js"></script>
 </body>
 </html>
diff --git a/must_know b/must_know
@@ -0,0 +1,2 @@
+1. Шпаргалка по асимптотической сложности алгоритмов - https://habr.com/post/188010/.
+2. Метод доказательства по индукции - базовый случай / индукционный переход (принцип домино).
diff --git a/sorting_algorithms/insertionsort.js b/sorting_algorithms/insertionsort.js
@@ -15,6 +15,4 @@ for(i = 0; i < size; i += 1) {
         j -= 1;
     }
     arr[j + 1] = temp;
-}
-
-// console.log(arr);
+}
diff --git a/sorting_algorithms/mergesort.js b/sorting_algorithms/mergesort.js
@@ -1,7 +1,5 @@
 function mergeSort(arr) {
-    if(arr.length === 1) {
-        return arr;
-    }
+    if(arr.length === 1) return arr;
 
     const middle = Math.floor(arr.length / 2),
           left = arr.slice(0, middle),
diff --git a/sorting_algorithms/quicksort.js b/sorting_algorithms/quicksort.js
@@ -0,0 +1,12 @@
+function quickSort(list) {
+  var lesser = [], greater = [], pivot = list[0], i, size = list.length, item;
+  if(size === 0) return [];
+  for(i = 1; i < size; i += 1) {
+    item = list[i];
+    item < pivot ? lesser.push(item) : greater.push(item);
+  }
+  return quickSort(lesser).concat(pivot, quickSort(greater));
+}
+
+const list = [2, 5, 1, 3, 7, 2, 3, 8, 6, 3];
+quickSort(list);
diff --git a/sorting_algorithms/shellsort.js b/sorting_algorithms/shellsort.js
@@ -0,0 +1,13 @@
+// function shellSort() {
+//   for (var g = 0; g < this.gaps.length; ++g) {
+//     for (var i = this.gaps[g]; i < this.dataStore.length; ++i) {
+//       var temp = this.dataStore[i];
+//       for (var j = i; j >= this.gaps[g] && this.dataStore[j - this.gaps[g]] > temp; j -= this.gaps[g]) {
+//         this.dataStore[j] = this.dataStore[j - this.gaps[g]];
+//       }
+//       this.dataStore[j] = temp;
+//     }
+//   }
+// }
+//
+// shellSort();

Original file line number	Diff line number	Diff line change
`@@ -33,6 +33,7 @@ function display() {`
`33`	`33`	`currNode = currNode.next;`
`34`	`34`	`}`
`35`	`35`	`}`
	`36`	`+`
`36`	`37`	`function findPrevious(item) {`
`37`	`38`	`var currNode = this.head;`
`38`	`39`	`while (!(currNode.next === null) && (currNode.next.element !== item)) {`
`@@ -54,4 +55,4 @@ cities.insert('RusselVille', 'Conway');`
`54`	`55`	`cities.insert('Alma', 'RusselVille');`
`55`	`56`	`cities.display();`
`56`	`57`	`cities.find('Alma');`
`57`		`-console.log(cities);`
	`58`	`+cities.display();`
Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,2 @@`
	`1`	`+1. Шпаргалка по асимптотической сложности алгоритмов - https://habr.com/post/188010/.`
	`2`	`+2. Метод доказательства по индукции - базовый случай / индукционный переход (принцип домино).`
Original file line number	Diff line number	Diff line change
`@@ -15,6 +15,4 @@ for(i = 0; i < size; i += 1) {`
`15`	`15`	`j -= 1;`
`16`	`16`	`}`
`17`	`17`	`arr[j + 1] = temp;`
`18`		`-}`
`19`		`-`
`20`		`-// console.log(arr);`
	`18`	`+}`