Merge pull request #1 from wakidurrahman/feat/section-big-o

sample 001 and note file created.

Author: wakidurrahman

section-big-o/note.txt

@@ -0,0 +1,8 @@
+/** importance links and note **/
+
+/*** 
+ * note
+***/
+1. Big O and Scalability.
+  we see that as our input grew, our function Find `Nemo` became slower and slower and slower.
+  Our runtime, how long it takes to run a certain problem through a function, increased.

section-big-o/sample-001.js

@@ -0,0 +1,21 @@
+// #1 -- For loop in Javascript
+const fish = ['dory', 'bruce', 'marlin', 'nemo'];
+const nemo = ['nemo'];
+const everyone = ['dory', 'bruce', 'marlin', 'nemo', 'gill', 'bloat', 'nigel', 'squirt', 'darla', 'hank'];
+const large = new Array(10).fill('nemo');
+
+
+function findNemo(array) {
+    let startTime = performance.now();
+    for (let index = 0; index < array.length; index++) {
+        const element = array[index];
+        if (element === 'nemo') {
+            console.log('Found NEMO');
+        }
+    }
+    let endTime = performance.now();
+    console.log(`Call to find Nemo took ${endTime - startTime} milliseconds.`)
+
+}
+
+findNemo(nemo)