feat: examples from chapter 6

Author: damianobacci

chapter-4/2_quadratic_problem.ts

@@ -13,7 +13,7 @@ function hasDuplicateValueQuadratic(array: number[]): boolean { // this function
 }
 
 function hasDuplicateValueLinear(array: number[]): boolean { // This function has efficiency O(N), because we are only running comparisons through one loop
-    let existingNumbers: (number | undefined)[] = [] // will be something like [undefined, 1, undefined, undefined, 1], where "1" marks the if the number in that index has been seen
+    let existingNumbers: (number | undefined)[] = [] // will be something like [undefined, 1, undefined, undefined, 1], where "1" marks the place if the number in that index has been seen
     for (let i = 0; i < array.length; i++) {
         if (existingNumbers[array[i]] === 1) {
             return true

chapter-6/1_insertion_sort.py

@@ -0,0 +1,13 @@
+def insertion_sort(array):
+    for index in range(1, len(array)):
+        temp_value = array[index]
+        position = index - 1
+
+        while position >= 0:
+            if array[position] > temp_value:
+                array[position + 1] = array[position]
+                position = position - 1
+            else:
+                break
+        array[position + 1] = temp_value
+    return array

chapter-6/2_intersection.js

@@ -0,0 +1,24 @@
+function intersection(firstArray, secondArray){
+    let result = []
+
+    for (let i = 0; i < firstArray.length; i++) {
+        for (let j = 0; j < secondArray.length; j++) {
+            if (firstArray[i] === secondArray[j]) {
+                result.push(firstArray[importScripts])
+            }
+        }
+    }
+}
+
+function intersection(firstArray, secondArray){
+    let result = []
+
+    for (let i = 0; i < firstArray.length; i++) {
+        for (let j = 0; j < secondArray.length; j++) {
+            if (firstArray[i] === secondArray[j]) {
+                result.push(firstArray[importScripts])
+                break
+            }
+        }
+    }
+}