Restructure in progress

Author: Ryo112358

Algorithms/DynamicProgramming/Knapsack.ts

@@ -0,0 +1,11 @@
+
+
+
+
+//---------------------------------------------------------------------
+// ----------                 MAIN PROGRAM                   ----------
+//---------------------------------------------------------------------
+if (import.meta.main) {
+
+    // RUN:   deno run Algorithms/DynamicProgramming/Knapsack.ts
+}

Big-O/Hello_Big_O.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)

Big-O/README.md

@@ -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

Playground/Challenges/Arrays/Compare_Arrays.test.ts renamed to Playground/ZTM Challenges/Arrays/Compare_Arrays.test.ts

@@ -1,43 +1,36 @@
 # Data Structures & Algorithms in TypeScript
 
+## Environment
+- <span title="July 2021">Deno 1.12.0</span>
+- V8 9.2.230.14
+- TypeScript 4.3.2
+
+
 ## Topics Overview
 
 ### Algorithmic Complexity Analysis
 - [X] Big O Notation
-- [X] Time Complexity
-- [X] Space Complexity
+  - [X] Time Complexity
+  - [X] Space Complexity
 
 ### Data Structures
-- [X] Arrays
-- [X] Hash Tables
-- [X] Stacks
-- [X] Queues
-- [X] Linked Lists
 - [X] Trees
 - [X] Graphs
+- [X] Hash Tables
+- [X] Linked Lists
+- [X] Arrays/Stacks/Queues
 
 ### Algorithms
-- [X] Recursion
-- [X] Dynamic Programming
 - [X] Comparison Sorting
   - [X] *Merge Sort*
   - [X] *Quicksort*
 - [X] Searching
-  - [X] Linear Search
-  - [X] Binary Search
+  - [X] Linear & Binary Search
   - [X] BFS & DFS
-
-## Environment
-- Deno 1.2.1
-- V8 8.5.216
-- TypeScript 3.9.2
+- [X] Recursion
+- [X] Dynamic Programming
 
 ## Resources
-- [Comprehensive List of Data Structures](https://en.wikipedia.org/wiki/List_of_data_structures "Wikipedia: DS List")
-- [Visualizing Data Structures & Algorithms](https://visualgo.net/en)
-- [The Big-O Algorithm Complexity Cheat Sheet](https://www.bigocheatsheet.com/ "Big O Cheat Sheet")
-- [Google Coding Interview](https://youtu.be/XKu_SEDAykw)
 - [Roadmap: Core Data Structures & Algorithms](https://coggle.it/diagram/W5E5tqYlrXvFJPsq/t/master-the-interview-click-here-for-course-link "Course and Mindmap by Andrei Neagoie")
-
-### Curated Articles
+- [The Big-O Algorithm Complexity Cheat Sheet](https://www.bigocheatsheet.com/ "Big O Cheat Sheet")
 - [Algorithms & DS – Real Use Cases: PragmaticEngineer](https://blog.pragmaticengineer.com/data-structures-and-algorithms-i-actually-used-day-to-day/)

Playground/Challenges/Arrays/Compare_Arrays.ts renamed to Playground/ZTM Challenges/Arrays/Compare_Arrays.ts

@@ -2,7 +2,7 @@
 export {
   assertEquals,
   assertNotEquals,
-} from "https://deno.land/std@0.63.0/testing/asserts.ts";
+} from "https://deno.land/std@0.101.0/testing/asserts.ts";
 
 // ------------------------ Miscellaneous ------------------------
 import * as all_deps from "./deps.ts";