CoffeelessProgrammer
diff --git a/‎Algorithms/DynamicProgramming/Knapsack.ts
Lines changed: 11 additions & 0 deletions b/‎Algorithms/DynamicProgramming/Knapsack.ts
Lines changed: 11 additions & 0 deletions
diff --git a/‎Big-O/Hello_Big_O.ts
Lines changed: 1 addition & 1 deletion b/‎Big-O/Hello_Big_O.ts
Lines changed: 1 addition & 1 deletion
diff --git a/‎Big-O/README.md
Lines changed: 1 addition & 0 deletions b/‎Big-O/README.md
Lines changed: 1 addition & 0 deletions
diff --git a/‎Playground/Challenges/Arrays/Compare_Arrays.test.ts renamed to ‎Playground/ZTM Challenges/Arrays/Compare_Arrays.test.ts b/‎Playground/Challenges/Arrays/Compare_Arrays.test.ts renamed to ‎Playground/ZTM Challenges/Arrays/Compare_Arrays.test.ts
diff --git a/‎Playground/Challenges/Arrays/Compare_Arrays.ts renamed to ‎Playground/ZTM Challenges/Arrays/Compare_Arrays.ts b/‎Playground/Challenges/Arrays/Compare_Arrays.ts renamed to ‎Playground/ZTM Challenges/Arrays/Compare_Arrays.ts
diff --git a/‎Playground/Challenges/Arrays/Merge_Sorted_Arrays.ts renamed to ‎Playground/ZTM Challenges/Arrays/Merge_Sorted_Arrays.ts b/‎Playground/Challenges/Arrays/Merge_Sorted_Arrays.ts renamed to ‎Playground/ZTM Challenges/Arrays/Merge_Sorted_Arrays.ts
diff --git a/‎Playground/Challenges/Arrays/Reverse_String.ts renamed to ‎Playground/ZTM Challenges/Arrays/Reverse_String.ts b/‎Playground/Challenges/Arrays/Reverse_String.ts renamed to ‎Playground/ZTM Challenges/Arrays/Reverse_String.ts
diff --git a/‎Playground/Challenges/Arrays/Sum_Pair.ts renamed to ‎Playground/ZTM Challenges/Arrays/Sum_Pair.ts b/‎Playground/Challenges/Arrays/Sum_Pair.ts renamed to ‎Playground/ZTM Challenges/Arrays/Sum_Pair.ts
diff --git a/‎Playground/Challenges/Hash-Tables/Recurring_Symbol.test.ts renamed to ‎Playground/ZTM Challenges/Hash-Tables/Recurring_Symbol.test.ts b/‎Playground/Challenges/Hash-Tables/Recurring_Symbol.test.ts renamed to ‎Playground/ZTM Challenges/Hash-Tables/Recurring_Symbol.test.ts
diff --git a/‎Playground/Challenges/Hash-Tables/Recurring_Symbol.ts renamed to ‎Playground/ZTM Challenges/Hash-Tables/Recurring_Symbol.ts b/‎Playground/Challenges/Hash-Tables/Recurring_Symbol.ts renamed to ‎Playground/ZTM Challenges/Hash-Tables/Recurring_Symbol.ts
@@ -0,0 +1,11 @@
+
+
+
+
+//---------------------------------------------------------------------
+// ----------                 MAIN PROGRAM                   ----------
+//---------------------------------------------------------------------
+if (import.meta.main) {
+
+    // RUN:   deno run Algorithms/DynamicProgramming/Knapsack.ts
+}
@@ -1,7 +1,7 @@
 
 const nemo = ['nemo'];
 const fishColony = ['dory', 'bruce', 'marlin', 'nemo', 'gill', 'bloat', 'nigel', 'squirt', 'darla', 'hank'];
-const largeArr = new Array(10000000).fill('squish');
+const largeArr = new Array(10_000_000).fill('squish');
 
 function findNemo(fishes: Array<string>): string {
   let t0 = performance.now();   // O(1)
 
@@ -1,4 +1,5 @@
 # Algorithm Time-Complexity Analysis
+
 **Goal:** Understand how the runtime of an algorithm is affected by an increasing number of elements.
 
 ## 5 Rules
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,5 @@`
`1`	`1`	`# Algorithm Time-Complexity Analysis`
	`2`	`+`
`2`	`3`	`Goal: Understand how the runtime of an algorithm is affected by an increasing number of elements.`
`3`	`4`
`4`	`5`	`## 5 Rules`