4 files changed, 0 insertions, 88 deletions
diff --git a/wk3/lab/bubble.c b/wk3/lab/bubble.c
deleted file mode 100644
index 3d95665..0000000
--- a/wk3/lab/bubble.c
+++ /dev/null
@@ -1,20 +0,0 @@
-#include <cs50.h>
-#include <ctype.h>
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-
-int main(void) {
-
-}
-
-
-/*
-    look at each pair of numbers i & i +1
-    if they're out of order swap them
-    repeat until completely sorted
-
-    worst sorting method
-    O(n^2)
-    Q(n)
-*/
diff --git a/wk3/lab/iteration.c b/wk3/lab/iteration.c
deleted file mode 100644
index 32a8a9d..0000000
--- a/wk3/lab/iteration.c
+++ /dev/null
@@ -1,21 +0,0 @@
-#include <cs50.h>
-#include <ctype.h>
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-
-void draw(int n);
-
-int main(void) {
-    int height = get_int("Height: ");
-    draw(height);
-}
-
-void draw(int n) {
-    for (int i = 0; i < n; i++) {
-        for (int j = 0; j < i + 1; j++) {
-            printf("#");
-        }
-        printf("\n");
-    }
-}
diff --git a/wk3/lab/notes.txt b/wk3/lab/notes.txt
deleted file mode 100644
index 9336a56..0000000
--- a/wk3/lab/notes.txt
+++ /dev/null
@@ -1,12 +0,0 @@
-
-Order
-    O(n^2): Selection, Bubble
-    O(n):
-    O(logn):
-    O(c):
-
-Omega
-    Q(n^2): Selection
-    Q(n): Bubble
-    Q(logn):
-    Q(c):
diff --git a/wk3/lab/selection.c b/wk3/lab/selection.c
deleted file mode 100644
index c6887b5..0000000
--- a/wk3/lab/selection.c
+++ /dev/null
@@ -1,35 +0,0 @@
-#include <cs50.h>
-#include <ctype.h>
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-
-int main(void) {
-    int arr[] =
-    int n = arr.length
-    for (int i = 0; i < n - 1; i++) {
-        int n;
-        int m;
-        for (int j = i; j < n - 1; j++) {
-            if (arr[j] < n || n === undefined) {
-                n = arr[j];
-                m = j;
-            }
-        }
-        int k = arr[i];
-        arr[i] = n;
-        arr[m] = k;
-    }
-}
-
-
-/*
-    grab the first value and record it
-    go throught each value and record the smallest
-    swap the 1st value and the smallest value
-    repeat
-
-    O(n^2)
-    Q(n^2)  Omega
-    0(n^2)
-*/