From e51b9552c5cd37422d153004051c66da31fbb01d Mon Sep 17 00:00:00 2001 From: mikekavouras Date: Thu, 10 Dec 2015 15:08:19 -0500 Subject: [PATCH 001/126] some stuff --- README.md | 0 1 file changed, 0 insertions(+), 0 deletions(-) create mode 100644 README.md diff --git a/README.md b/README.md new file mode 100644 index 0000000..e69de29 From 46d1561d25c8f91067c8325d72359e0ab78af30a Mon Sep 17 00:00:00 2001 From: mikekavouras Date: Thu, 10 Dec 2015 15:17:43 -0500 Subject: [PATCH 002/126] lessons --- lessons/week-0/2016_01_05.md | 0 lessons/week-0/2016_01_07.md | 0 lessons/week-0/2016_01_09.md | 0 lessons/week-0/2016_01_10.md | 0 lessons/week-1/2016_01_12.md | 0 lessons/week-1/2016_01_14.md | 0 lessons/week-1/2016_01_16.md | 0 lessons/week-1/2016_01_17.md | 0 lessons/week-2/2016_01_19.md | 0 lessons/week-2/2016_01_21.md | 0 lessons/week-2/2016_01_23.md | 0 lessons/week-2/2016_01_24.md | 0 12 files changed, 0 insertions(+), 0 deletions(-) create mode 100644 lessons/week-0/2016_01_05.md create mode 100644 lessons/week-0/2016_01_07.md create mode 100644 lessons/week-0/2016_01_09.md create mode 100644 lessons/week-0/2016_01_10.md create mode 100644 lessons/week-1/2016_01_12.md create mode 100644 lessons/week-1/2016_01_14.md create mode 100644 lessons/week-1/2016_01_16.md create mode 100644 lessons/week-1/2016_01_17.md create mode 100644 lessons/week-2/2016_01_19.md create mode 100644 lessons/week-2/2016_01_21.md create mode 100644 lessons/week-2/2016_01_23.md create mode 100644 lessons/week-2/2016_01_24.md diff --git a/lessons/week-0/2016_01_05.md b/lessons/week-0/2016_01_05.md new file mode 100644 index 0000000..e69de29 diff --git a/lessons/week-0/2016_01_07.md b/lessons/week-0/2016_01_07.md new file mode 100644 index 0000000..e69de29 diff --git a/lessons/week-0/2016_01_09.md b/lessons/week-0/2016_01_09.md new file mode 100644 index 0000000..e69de29 diff --git a/lessons/week-0/2016_01_10.md b/lessons/week-0/2016_01_10.md new file mode 100644 index 0000000..e69de29 diff --git a/lessons/week-1/2016_01_12.md b/lessons/week-1/2016_01_12.md new file mode 100644 index 0000000..e69de29 diff --git a/lessons/week-1/2016_01_14.md b/lessons/week-1/2016_01_14.md new file mode 100644 index 0000000..e69de29 diff --git a/lessons/week-1/2016_01_16.md b/lessons/week-1/2016_01_16.md new file mode 100644 index 0000000..e69de29 diff --git a/lessons/week-1/2016_01_17.md b/lessons/week-1/2016_01_17.md new file mode 100644 index 0000000..e69de29 diff --git a/lessons/week-2/2016_01_19.md b/lessons/week-2/2016_01_19.md new file mode 100644 index 0000000..e69de29 diff --git a/lessons/week-2/2016_01_21.md b/lessons/week-2/2016_01_21.md new file mode 100644 index 0000000..e69de29 diff --git a/lessons/week-2/2016_01_23.md b/lessons/week-2/2016_01_23.md new file mode 100644 index 0000000..e69de29 diff --git a/lessons/week-2/2016_01_24.md b/lessons/week-2/2016_01_24.md new file mode 100644 index 0000000..e69de29 From f42ef2e4b2b143affb7e7331c2fe25eee8f198b5 Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Thu, 10 Dec 2015 15:20:31 -0500 Subject: [PATCH 003/126] Update README.md --- README.md | 7 +++++++ 1 file changed, 7 insertions(+) diff --git a/README.md b/README.md index e69de29..6f9133c 100644 --- a/README.md +++ b/README.md @@ -0,0 +1,7 @@ +###Unit 4 Schedule +|Week|Day|Activity| +|---|---|---| +|0|Tuesday 01/05|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_05.md| +|0|Thursday 01/07|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_07.md| +|0|Saturday 01/09|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_09.md| +|0|Sunday 01/10|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_10.md| From afb43e4a2b206bdf1532d3b5b044c3ef25f6fb65 Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Thu, 10 Dec 2015 15:23:12 -0500 Subject: [PATCH 004/126] Update README.md --- README.md | 8 ++++++++ 1 file changed, 8 insertions(+) diff --git a/README.md b/README.md index 6f9133c..ec25992 100644 --- a/README.md +++ b/README.md @@ -5,3 +5,11 @@ |0|Thursday 01/07|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_07.md| |0|Saturday 01/09|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_09.md| |0|Sunday 01/10|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_10.md| +|1|Tuesday 01/12|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_12.md| +|1|Thursday 01/14|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_14.md| +|1|Saturday 01/16|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_16.md| +|1|Sunday 01/17|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_17.md| +|2|Tuesday 01/19|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_19.md| +|2|Thursday 01/21|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_21.md| +|2|Saturday 01/23|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_23.md| +|2|Sunday 01/24|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_24.md| From a4218b7a9e30ba7f1123357ebb2cc3838677e351 Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Thu, 10 Dec 2015 15:27:39 -0500 Subject: [PATCH 005/126] Update README.md --- README.md | 28 ++++++++++++++-------------- 1 file changed, 14 insertions(+), 14 deletions(-) diff --git a/README.md b/README.md index ec25992..10bab0d 100644 --- a/README.md +++ b/README.md @@ -1,15 +1,15 @@ ###Unit 4 Schedule -|Week|Day|Activity| -|---|---|---| -|0|Tuesday 01/05|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_05.md| -|0|Thursday 01/07|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_07.md| -|0|Saturday 01/09|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_09.md| -|0|Sunday 01/10|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_10.md| -|1|Tuesday 01/12|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_12.md| -|1|Thursday 01/14|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_14.md| -|1|Saturday 01/16|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_16.md| -|1|Sunday 01/17|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_17.md| -|2|Tuesday 01/19|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_19.md| -|2|Thursday 01/21|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_21.md| -|2|Saturday 01/23|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_23.md| -|2|Sunday 01/24|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_24.md| +|Week|Day|Date|Activity| +|---|---|---|---| +|0|Tuesday|01/05|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_05.md| +|0|Thursday|01/07|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_07.md| +|0|Saturda|01/09|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_09.md| +|0|Sunday|01/10|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_10.md| +|1|Tuesday|01/12|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_12.md| +|1|Thursday|01/14|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_14.md| +|1|Saturday|01/16|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_16.md| +|1|Sunday|01/17|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_17.md| +|2|Tuesday|01/19|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_19.md| +|2|Thursday|01/21|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_21.md| +|2|Saturday|01/23|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_23.md| +|2|Sunday|01/24|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_24.md| From 4ae6c45c9bc2aa8f88216abd6d26a7113c308544 Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Fri, 11 Dec 2015 11:41:57 -0500 Subject: [PATCH 006/126] Update README.md --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 10bab0d..f67508c 100644 --- a/README.md +++ b/README.md @@ -3,7 +3,7 @@ |---|---|---|---| |0|Tuesday|01/05|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_05.md| |0|Thursday|01/07|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_07.md| -|0|Saturda|01/09|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_09.md| +|0|Saturday|01/09|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_09.md| |0|Sunday|01/10|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_10.md| |1|Tuesday|01/12|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_12.md| |1|Thursday|01/14|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_14.md| From 380834c23197a1bde8a6b165a5b70d1994c4d5be Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Fri, 11 Dec 2015 13:07:13 -0500 Subject: [PATCH 007/126] Update 2016_01_05.md --- lessons/week-0/2016_01_05.md | 4 ++++ 1 file changed, 4 insertions(+) diff --git a/lessons/week-0/2016_01_05.md b/lessons/week-0/2016_01_05.md index e69de29..bec590a 100644 --- a/lessons/week-0/2016_01_05.md +++ b/lessons/week-0/2016_01_05.md @@ -0,0 +1,4 @@ +#Objectives +* What is Swift? +* Why Swift vs. Objective-C? +* What are playgrounds and how to use them. From e70ce7939705e4f2ba10ddb2b7b20a1b0b69754a Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Fri, 11 Dec 2015 13:09:38 -0500 Subject: [PATCH 008/126] Update 2016_01_07.md --- lessons/week-0/2016_01_07.md | 3 +++ 1 file changed, 3 insertions(+) diff --git a/lessons/week-0/2016_01_07.md b/lessons/week-0/2016_01_07.md index e69de29..8527a94 100644 --- a/lessons/week-0/2016_01_07.md +++ b/lessons/week-0/2016_01_07.md @@ -0,0 +1,3 @@ +# Objectives +* primitives, functions, protocols, structs*, enums* +* Review MVC From 8523d28d11833449bf89b711b5fb21edf8314fa0 Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Fri, 11 Dec 2015 13:12:17 -0500 Subject: [PATCH 009/126] Update 2016_01_09.md --- lessons/week-0/2016_01_09.md | 5 +++++ 1 file changed, 5 insertions(+) diff --git a/lessons/week-0/2016_01_09.md b/lessons/week-0/2016_01_09.md index e69de29..5ee8755 100644 --- a/lessons/week-0/2016_01_09.md +++ b/lessons/week-0/2016_01_09.md @@ -0,0 +1,5 @@ +# Objective +* What is a data structure? +* What is an object? (pass by reference vs. pass by value) +* How are data structure defined relative to oop (Is a data structure an object? Is an object a data structure?) +difference between class and object? From 7cebceb05463852ef7ff2843e2e0f34faa90847f Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Fri, 11 Dec 2015 13:13:31 -0500 Subject: [PATCH 010/126] Update 2016_01_10.md --- lessons/week-0/2016_01_10.md | 2 ++ 1 file changed, 2 insertions(+) diff --git a/lessons/week-0/2016_01_10.md b/lessons/week-0/2016_01_10.md index e69de29..6250616 100644 --- a/lessons/week-0/2016_01_10.md +++ b/lessons/week-0/2016_01_10.md @@ -0,0 +1,2 @@ +# Objectives +Exercises From 7eb0d108677f205f92db8d359c6d1a175d0cb228 Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Fri, 11 Dec 2015 13:14:06 -0500 Subject: [PATCH 011/126] Update README.md --- README.md | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/README.md b/README.md index f67508c..6ff57f9 100644 --- a/README.md +++ b/README.md @@ -1,10 +1,10 @@ ###Unit 4 Schedule |Week|Day|Date|Activity| |---|---|---|---| -|0|Tuesday|01/05|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_05.md| -|0|Thursday|01/07|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_07.md| -|0|Saturday|01/09|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_09.md| -|0|Sunday|01/10|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_10.md| +|0|Tuesday|01/05|[Intro to Swift](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_05.md)| +|0|Thursday|01/07|[Unit 0 Recap (in Swift) + MVC](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_07.md)| +|0|Saturday|01/09|[Intro to data structures](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_09.md)| +|0|Sunday|01/10|[Basic interview questions](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_10.md)| |1|Tuesday|01/12|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_12.md| |1|Thursday|01/14|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_14.md| |1|Saturday|01/16|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_16.md| From 4634dd7f5c5627a320c9891b9b7961b2c4be65ce Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Fri, 11 Dec 2015 13:16:09 -0500 Subject: [PATCH 012/126] Update README.md --- README.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/README.md b/README.md index 6ff57f9..1fdd915 100644 --- a/README.md +++ b/README.md @@ -5,8 +5,8 @@ |0|Thursday|01/07|[Unit 0 Recap (in Swift) + MVC](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_07.md)| |0|Saturday|01/09|[Intro to data structures](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_09.md)| |0|Sunday|01/10|[Basic interview questions](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_10.md)| -|1|Tuesday|01/12|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_12.md| -|1|Thursday|01/14|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_14.md| +|1|Tuesday|01/12|[Big O]](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_12.md)| +|1|Thursday|01/14|[Discrete Math and Logic](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_14.md)| |1|Saturday|01/16|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_16.md| |1|Sunday|01/17|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_17.md| |2|Tuesday|01/19|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_19.md| From 1af9939b6026249902972fa885239e4ef9092f78 Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Fri, 11 Dec 2015 13:16:16 -0500 Subject: [PATCH 013/126] Update README.md --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 1fdd915..6d1b62e 100644 --- a/README.md +++ b/README.md @@ -5,7 +5,7 @@ |0|Thursday|01/07|[Unit 0 Recap (in Swift) + MVC](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_07.md)| |0|Saturday|01/09|[Intro to data structures](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_09.md)| |0|Sunday|01/10|[Basic interview questions](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_10.md)| -|1|Tuesday|01/12|[Big O]](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_12.md)| +|1|Tuesday|01/12|[Big O](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_12.md)| |1|Thursday|01/14|[Discrete Math and Logic](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_14.md)| |1|Saturday|01/16|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_16.md| |1|Sunday|01/17|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_17.md| From bdd7cc3e84b40a7a9c241e41d533029b1f6fa276 Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Fri, 11 Dec 2015 13:16:39 -0500 Subject: [PATCH 014/126] Update README.md --- README.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/README.md b/README.md index 6d1b62e..4f6d296 100644 --- a/README.md +++ b/README.md @@ -7,8 +7,8 @@ |0|Sunday|01/10|[Basic interview questions](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_10.md)| |1|Tuesday|01/12|[Big O](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_12.md)| |1|Thursday|01/14|[Discrete Math and Logic](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_14.md)| -|1|Saturday|01/16|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_16.md| -|1|Sunday|01/17|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_17.md| +|1|Saturday|01/16|[Sorts](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_16.md)| +|1|Sunday|01/17|[Sorts](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_17.md)| |2|Tuesday|01/19|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_19.md| |2|Thursday|01/21|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_21.md| |2|Saturday|01/23|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_23.md| From baf8fc5ae005c8a1490520abed4b7bfd89f9d68f Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Fri, 11 Dec 2015 13:17:15 -0500 Subject: [PATCH 015/126] Update README.md --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 4f6d296..1922001 100644 --- a/README.md +++ b/README.md @@ -8,7 +8,7 @@ |1|Tuesday|01/12|[Big O](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_12.md)| |1|Thursday|01/14|[Discrete Math and Logic](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_14.md)| |1|Saturday|01/16|[Sorts](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_16.md)| -|1|Sunday|01/17|[Sorts](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_17.md)| +|1|Sunday|01/17|[Sorts + Assessment](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_17.md)| |2|Tuesday|01/19|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_19.md| |2|Thursday|01/21|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_21.md| |2|Saturday|01/23|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_23.md| From c7daf6e3ffd20867e10a50c836e3c22d31ac3125 Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Fri, 11 Dec 2015 13:35:45 -0500 Subject: [PATCH 016/126] Update README.md --- README.md | 12 ++++++------ 1 file changed, 6 insertions(+), 6 deletions(-) diff --git a/README.md b/README.md index 1922001..61dbe0a 100644 --- a/README.md +++ b/README.md @@ -3,13 +3,13 @@ |---|---|---|---| |0|Tuesday|01/05|[Intro to Swift](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_05.md)| |0|Thursday|01/07|[Unit 0 Recap (in Swift) + MVC](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_07.md)| -|0|Saturday|01/09|[Intro to data structures](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_09.md)| +|0|Saturday|01/09|[How to frame Access Code + Intro to data structures](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_09.md)| |0|Sunday|01/10|[Basic interview questions](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_10.md)| |1|Tuesday|01/12|[Big O](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_12.md)| |1|Thursday|01/14|[Discrete Math and Logic](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_14.md)| -|1|Saturday|01/16|[Sorts](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_16.md)| +|1|Saturday|01/16|[Job materials (workshop) + Sorts](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_16.md)| |1|Sunday|01/17|[Sorts + Assessment](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_17.md)| -|2|Tuesday|01/19|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_19.md| -|2|Thursday|01/21|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_21.md| -|2|Saturday|01/23|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_23.md| -|2|Sunday|01/24|https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_24.md| +|2|Tuesday|01/19|[Intro to Stack + Heap](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_19.md)| +|2|Thursday|01/21|[Quick Sort](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_21.md)| +|2|Saturday|01/23|[Recursion + Merge Sort](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_23.md)| +|2|Sunday|01/24|[Recursion + Merge Sort + Exercises](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_24.md)| From 4d46dcdfb9b398db1eaee91a39e96f70bc258507 Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Fri, 11 Dec 2015 13:36:54 -0500 Subject: [PATCH 017/126] Update README.md --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 61dbe0a..3c63b7e 100644 --- a/README.md +++ b/README.md @@ -11,5 +11,5 @@ |1|Sunday|01/17|[Sorts + Assessment](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_17.md)| |2|Tuesday|01/19|[Intro to Stack + Heap](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_19.md)| |2|Thursday|01/21|[Quick Sort](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_21.md)| -|2|Saturday|01/23|[Recursion + Merge Sort](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_23.md)| +|2|Saturday|01/23|[Behavioral interview questions (workshop) + Recursion + Merge Sort](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_23.md)| |2|Sunday|01/24|[Recursion + Merge Sort + Exercises](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_24.md)| From 4d6f5ca8ed2ca7d7c06a2c25618a759bb5da4ddc Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Fri, 11 Dec 2015 13:38:36 -0500 Subject: [PATCH 018/126] Update README.md --- README.md | 28 ++++++++++++++-------------- 1 file changed, 14 insertions(+), 14 deletions(-) diff --git a/README.md b/README.md index 3c63b7e..7b6fa4c 100644 --- a/README.md +++ b/README.md @@ -1,15 +1,15 @@ ###Unit 4 Schedule -|Week|Day|Date|Activity| -|---|---|---|---| -|0|Tuesday|01/05|[Intro to Swift](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_05.md)| -|0|Thursday|01/07|[Unit 0 Recap (in Swift) + MVC](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_07.md)| -|0|Saturday|01/09|[How to frame Access Code + Intro to data structures](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_09.md)| -|0|Sunday|01/10|[Basic interview questions](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_10.md)| -|1|Tuesday|01/12|[Big O](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_12.md)| -|1|Thursday|01/14|[Discrete Math and Logic](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_14.md)| -|1|Saturday|01/16|[Job materials (workshop) + Sorts](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_16.md)| -|1|Sunday|01/17|[Sorts + Assessment](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_17.md)| -|2|Tuesday|01/19|[Intro to Stack + Heap](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_19.md)| -|2|Thursday|01/21|[Quick Sort](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_21.md)| -|2|Saturday|01/23|[Behavioral interview questions (workshop) + Recursion + Merge Sort](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_23.md)| -|2|Sunday|01/24|[Recursion + Merge Sort + Exercises](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_24.md)| +|Week|Day|Date|Activity|Non-technical| +|---|---|---|---|---| +|0|Tuesday|01/05|[Intro to Swift](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_05.md)|| +|0|Thursday|01/07|[Unit 0 Recap (in Swift) + MVC](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_07.md)|| +|0|Saturday|01/09|[How to frame Access Code + Intro to data structures](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_09.md)|x| +|0|Sunday|01/10|[Basic interview questions](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_10.md)|| +|1|Tuesday|01/12|[Big O](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_12.md)|| +|1|Thursday|01/14|[Discrete Math and Logic](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_14.md)|| +|1|Saturday|01/16|[Job materials (workshop) + Sorts](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_16.md)|x| +|1|Sunday|01/17|[Sorts + Assessment](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_17.md)|| +|2|Tuesday|01/19|[Intro to Stack + Heap](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_19.md)|| +|2|Thursday|01/21|[Quick Sort](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_21.md)|| +|2|Saturday|01/23|[Behavioral interview questions (workshop) + Recursion + Merge Sort](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_23.md)|x| +|2|Sunday|01/24|[Recursion + Merge Sort + Exercises](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_24.md)|| From c2896ab83fb0cd18069bb32ab09877b5e8cd4ccd Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Fri, 11 Dec 2015 13:38:59 -0500 Subject: [PATCH 019/126] Update README.md --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 7b6fa4c..b12569e 100644 --- a/README.md +++ b/README.md @@ -9,7 +9,7 @@ |1|Thursday|01/14|[Discrete Math and Logic](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_14.md)|| |1|Saturday|01/16|[Job materials (workshop) + Sorts](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_16.md)|x| |1|Sunday|01/17|[Sorts + Assessment](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_17.md)|| -|2|Tuesday|01/19|[Intro to Stack + Heap](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_19.md)|| +|2|Tuesday|01/19|[Intro to Stack + Heap (memory)](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_19.md)|| |2|Thursday|01/21|[Quick Sort](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_21.md)|| |2|Saturday|01/23|[Behavioral interview questions (workshop) + Recursion + Merge Sort](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_23.md)|x| |2|Sunday|01/24|[Recursion + Merge Sort + Exercises](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_24.md)|| From 42698ece2f0772e36fbf269e5b0f943afdcc9442 Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Fri, 11 Dec 2015 13:43:36 -0500 Subject: [PATCH 020/126] Update README.md --- README.md | 4 ++++ 1 file changed, 4 insertions(+) diff --git a/README.md b/README.md index b12569e..8364e40 100644 --- a/README.md +++ b/README.md @@ -13,3 +13,7 @@ |2|Thursday|01/21|[Quick Sort](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_21.md)|| |2|Saturday|01/23|[Behavioral interview questions (workshop) + Recursion + Merge Sort](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_23.md)|x| |2|Sunday|01/24|[Recursion + Merge Sort + Exercises](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_24.md)|| +|3|Tuesday|01/26|[Lists + Stacks + Queues](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_26.md)| +|3|Thursday|01/28|[Sets](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_28.md)| +|3|Saturday|01/30|[Whiteboarding tips + tricks Hashmaps](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_30.md)| +|3|Sunday|01/31|[Exercises + Assessment](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_31.md)| From 39a1cfc8d33c703a05f3c957a6bde9e71228ac2b Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Fri, 11 Dec 2015 13:43:49 -0500 Subject: [PATCH 021/126] Update README.md --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 8364e40..0f1eac2 100644 --- a/README.md +++ b/README.md @@ -15,5 +15,5 @@ |2|Sunday|01/24|[Recursion + Merge Sort + Exercises](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_24.md)|| |3|Tuesday|01/26|[Lists + Stacks + Queues](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_26.md)| |3|Thursday|01/28|[Sets](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_28.md)| -|3|Saturday|01/30|[Whiteboarding tips + tricks Hashmaps](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_30.md)| +|3|Saturday|01/30|[Whiteboarding tips + tricks Hashmaps](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_30.md)|x| |3|Sunday|01/31|[Exercises + Assessment](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_31.md)| From 3d013994ac1b624c04e021cca19261a2adef444d Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Tue, 15 Dec 2015 10:08:42 -0500 Subject: [PATCH 022/126] Update README.md --- README.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/README.md b/README.md index 0f1eac2..d0b5aa7 100644 --- a/README.md +++ b/README.md @@ -8,12 +8,12 @@ |1|Tuesday|01/12|[Big O](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_12.md)|| |1|Thursday|01/14|[Discrete Math and Logic](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_14.md)|| |1|Saturday|01/16|[Job materials (workshop) + Sorts](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_16.md)|x| -|1|Sunday|01/17|[Sorts + Assessment](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_17.md)|| +|1|Sunday|01/17|[Lists + Sorts + Assessment](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_17.md)|| |2|Tuesday|01/19|[Intro to Stack + Heap (memory)](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_19.md)|| |2|Thursday|01/21|[Quick Sort](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_21.md)|| |2|Saturday|01/23|[Behavioral interview questions (workshop) + Recursion + Merge Sort](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_23.md)|x| |2|Sunday|01/24|[Recursion + Merge Sort + Exercises](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_24.md)|| -|3|Tuesday|01/26|[Lists + Stacks + Queues](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_26.md)| +|3|Tuesday|01/26|[Stacks + Queues](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_26.md)| |3|Thursday|01/28|[Sets](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_28.md)| |3|Saturday|01/30|[Whiteboarding tips + tricks Hashmaps](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_30.md)|x| |3|Sunday|01/31|[Exercises + Assessment](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_31.md)| From 6ee381dc4b8c9ab7e43405238da6828654df0464 Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Sat, 19 Dec 2015 10:50:54 -0500 Subject: [PATCH 023/126] Update README.md --- README.md | 30 +++++++++++++++--------------- 1 file changed, 15 insertions(+), 15 deletions(-) diff --git a/README.md b/README.md index d0b5aa7..0f27a9b 100644 --- a/README.md +++ b/README.md @@ -1,19 +1,19 @@ ###Unit 4 Schedule |Week|Day|Date|Activity|Non-technical| |---|---|---|---|---| -|0|Tuesday|01/05|[Intro to Swift](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_05.md)|| -|0|Thursday|01/07|[Unit 0 Recap (in Swift) + MVC](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_07.md)|| -|0|Saturday|01/09|[How to frame Access Code + Intro to data structures](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_09.md)|x| -|0|Sunday|01/10|[Basic interview questions](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_10.md)|| -|1|Tuesday|01/12|[Big O](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_12.md)|| -|1|Thursday|01/14|[Discrete Math and Logic](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_14.md)|| -|1|Saturday|01/16|[Job materials (workshop) + Sorts](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_16.md)|x| -|1|Sunday|01/17|[Lists + Sorts + Assessment](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_17.md)|| -|2|Tuesday|01/19|[Intro to Stack + Heap (memory)](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_19.md)|| -|2|Thursday|01/21|[Quick Sort](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_21.md)|| -|2|Saturday|01/23|[Behavioral interview questions (workshop) + Recursion + Merge Sort](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_23.md)|x| -|2|Sunday|01/24|[Recursion + Merge Sort + Exercises](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_24.md)|| -|3|Tuesday|01/26|[Stacks + Queues](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_26.md)| -|3|Thursday|01/28|[Sets](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_28.md)| -|3|Saturday|01/30|[Whiteboarding tips + tricks Hashmaps](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_30.md)|x| +|0|Tuesday|01/05|[How to frame Access Code + Intro to Swift](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_05.md)|x| +|0|Thursday|01/07|[Intro to data structures / algorithms](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_07.md)| | +|0|Saturday|01/09|[Recap unit 0 in Swift + MVC](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_09.md)| | +|0|Sunday|01/10|[iOS Personal Project + Big O](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_10.md)| | +|1|Tuesday|01/12|[Job materials (workshop)](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_12.md)|x| +|1|Thursday|01/14|[Discrete Math and Logic](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_14.md)| | +|1|Saturday|01/16|[Lists + Sorts](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_16.md)|| +|1|Sunday|01/17|[Sorts + Assessment](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_17.md)|| +|2|Tuesday|01/19|[Behavioral interview questions (workshop)](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_19.md)|| +|2|Thursday|01/21|[Intro to Stack + Heap (memory)](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_21.md)|| +|2|Saturday|01/23|[Quick Sort + Recursion](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_23.md)|x| +|2|Sunday|01/24|[Merge Sort + Exercises](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_24.md)|| +|3|Tuesday|01/26|[LinkedIn profile workshop @ LinkedIn](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_26.md)|x| +|3|Thursday|01/28|[Stacks + Queues](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_28.md)| +|3|Saturday|01/30|[Sets + Hashmaps](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_30.md)|x| |3|Sunday|01/31|[Exercises + Assessment](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_31.md)| From a31568f9ef11a93edde3444bb3700015d6930610 Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Sat, 19 Dec 2015 10:51:39 -0500 Subject: [PATCH 024/126] Update README.md --- README.md | 18 +++++++++--------- 1 file changed, 9 insertions(+), 9 deletions(-) diff --git a/README.md b/README.md index 0f27a9b..53c4c49 100644 --- a/README.md +++ b/README.md @@ -7,13 +7,13 @@ |0|Sunday|01/10|[iOS Personal Project + Big O](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_10.md)| | |1|Tuesday|01/12|[Job materials (workshop)](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_12.md)|x| |1|Thursday|01/14|[Discrete Math and Logic](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_14.md)| | -|1|Saturday|01/16|[Lists + Sorts](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_16.md)|| -|1|Sunday|01/17|[Sorts + Assessment](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_17.md)|| -|2|Tuesday|01/19|[Behavioral interview questions (workshop)](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_19.md)|| -|2|Thursday|01/21|[Intro to Stack + Heap (memory)](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_21.md)|| -|2|Saturday|01/23|[Quick Sort + Recursion](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_23.md)|x| -|2|Sunday|01/24|[Merge Sort + Exercises](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_24.md)|| +|1|Saturday|01/16|[Lists + Sorts](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_16.md)| | +|1|Sunday|01/17|[Sorts + Assessment](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_17.md)| | +|2|Tuesday|01/19|[Behavioral interview questions (workshop)](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_19.md)|x| +|2|Thursday|01/21|[Intro to Stack + Heap (memory)](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_21.md)| | +|2|Saturday|01/23|[Quick Sort + Recursion](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_23.md)| | +|2|Sunday|01/24|[Merge Sort + Exercises](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_24.md)| | |3|Tuesday|01/26|[LinkedIn profile workshop @ LinkedIn](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_26.md)|x| -|3|Thursday|01/28|[Stacks + Queues](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_28.md)| -|3|Saturday|01/30|[Sets + Hashmaps](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_30.md)|x| -|3|Sunday|01/31|[Exercises + Assessment](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_31.md)| +|3|Thursday|01/28|[Stacks + Queues](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_28.md)| | +|3|Saturday|01/30|[Sets + Hashmaps](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_30.md)| | +|3|Sunday|01/31|[Exercises + Assessment](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_31.md)| | From e6e9d2e88ced1f01b2451854f363326c6b576298 Mon Sep 17 00:00:00 2001 From: benstone1 Date: Tue, 29 Dec 2015 18:13:19 -0500 Subject: [PATCH 025/126] Update README.md --- README.md | 7 ++++--- 1 file changed, 4 insertions(+), 3 deletions(-) diff --git a/README.md b/README.md index 53c4c49..e617b18 100644 --- a/README.md +++ b/README.md @@ -5,15 +5,16 @@ |0|Thursday|01/07|[Intro to data structures / algorithms](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_07.md)| | |0|Saturday|01/09|[Recap unit 0 in Swift + MVC](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_09.md)| | |0|Sunday|01/10|[iOS Personal Project + Big O](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_10.md)| | -|1|Tuesday|01/12|[Job materials (workshop)](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_12.md)|x| +|1|Tuesday|01/12|[Technical Pathways with Dion and Job materials (workshop)](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_12.md)|x| |1|Thursday|01/14|[Discrete Math and Logic](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_14.md)| | |1|Saturday|01/16|[Lists + Sorts](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_16.md)| | |1|Sunday|01/17|[Sorts + Assessment](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_17.md)| | |2|Tuesday|01/19|[Behavioral interview questions (workshop)](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_19.md)|x| +|2|Friday|01/22|LinkedIn profile workshop @ LinkedIn|x| |2|Thursday|01/21|[Intro to Stack + Heap (memory)](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_21.md)| | |2|Saturday|01/23|[Quick Sort + Recursion](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_23.md)| | |2|Sunday|01/24|[Merge Sort + Exercises](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_24.md)| | -|3|Tuesday|01/26|[LinkedIn profile workshop @ LinkedIn](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_26.md)|x| -|3|Thursday|01/28|[Stacks + Queues](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_28.md)| | +|3|Tuesday|01/26|[Entrepreneurship Talk](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_26.md)|x| +|3|Thursday|01/28|[Lists, Stacks + Queues](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_28.md)| | |3|Saturday|01/30|[Sets + Hashmaps](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_30.md)| | |3|Sunday|01/31|[Exercises + Assessment](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_31.md)| | From 30d433bf41db02f86975520faad84246c17f0066 Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Sun, 3 Jan 2016 23:34:58 -0500 Subject: [PATCH 026/126] Update 2016_01_07.md --- lessons/week-0/2016_01_07.md | 5 +++-- 1 file changed, 3 insertions(+), 2 deletions(-) diff --git a/lessons/week-0/2016_01_07.md b/lessons/week-0/2016_01_07.md index 8527a94..e83cc3a 100644 --- a/lessons/week-0/2016_01_07.md +++ b/lessons/week-0/2016_01_07.md @@ -1,3 +1,4 @@ +# Instructor +Cameron + # Objectives -* primitives, functions, protocols, structs*, enums* -* Review MVC From 88b9385a1d6c62b8eb815d5fcc9169d5abf136b2 Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Sun, 3 Jan 2016 23:35:19 -0500 Subject: [PATCH 027/126] Update 2016_01_14.md --- lessons/week-1/2016_01_14.md | 2 ++ 1 file changed, 2 insertions(+) diff --git a/lessons/week-1/2016_01_14.md b/lessons/week-1/2016_01_14.md index e69de29..9a34d27 100644 --- a/lessons/week-1/2016_01_14.md +++ b/lessons/week-1/2016_01_14.md @@ -0,0 +1,2 @@ +# Instructor +Cameron From 66566cda8a1b27060db75980d8b59bf38cf75b43 Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Sun, 3 Jan 2016 23:35:42 -0500 Subject: [PATCH 028/126] Update 2016_01_21.md --- lessons/week-2/2016_01_21.md | 2 ++ 1 file changed, 2 insertions(+) diff --git a/lessons/week-2/2016_01_21.md b/lessons/week-2/2016_01_21.md index e69de29..9a34d27 100644 --- a/lessons/week-2/2016_01_21.md +++ b/lessons/week-2/2016_01_21.md @@ -0,0 +1,2 @@ +# Instructor +Cameron From 1e987759d5c564d26e5bb02874bb963e64f99dff Mon Sep 17 00:00:00 2001 From: mikekavouras Date: Sun, 3 Jan 2016 23:37:25 -0500 Subject: [PATCH 029/126] new dates --- lessons/week-3/2016_01_26.md | 0 lessons/week-3/2016_01_28.md | 0 lessons/week-3/2016_01_30.md | 0 lessons/week-3/2016_01_31.md | 0 4 files changed, 0 insertions(+), 0 deletions(-) create mode 100644 lessons/week-3/2016_01_26.md create mode 100644 lessons/week-3/2016_01_28.md create mode 100644 lessons/week-3/2016_01_30.md create mode 100644 lessons/week-3/2016_01_31.md diff --git a/lessons/week-3/2016_01_26.md b/lessons/week-3/2016_01_26.md new file mode 100644 index 0000000..e69de29 diff --git a/lessons/week-3/2016_01_28.md b/lessons/week-3/2016_01_28.md new file mode 100644 index 0000000..e69de29 diff --git a/lessons/week-3/2016_01_30.md b/lessons/week-3/2016_01_30.md new file mode 100644 index 0000000..e69de29 diff --git a/lessons/week-3/2016_01_31.md b/lessons/week-3/2016_01_31.md new file mode 100644 index 0000000..e69de29 From 5cb0dbf8f817c487ec16e365123581e04a3a0919 Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Sun, 3 Jan 2016 23:49:50 -0500 Subject: [PATCH 030/126] Update README.md --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index e617b18..e16b597 100644 --- a/README.md +++ b/README.md @@ -10,8 +10,8 @@ |1|Saturday|01/16|[Lists + Sorts](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_16.md)| | |1|Sunday|01/17|[Sorts + Assessment](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_17.md)| | |2|Tuesday|01/19|[Behavioral interview questions (workshop)](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_19.md)|x| -|2|Friday|01/22|LinkedIn profile workshop @ LinkedIn|x| |2|Thursday|01/21|[Intro to Stack + Heap (memory)](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_21.md)| | +|2|Friday|01/22|LinkedIn profile workshop @ LinkedIn|x| |2|Saturday|01/23|[Quick Sort + Recursion](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_23.md)| | |2|Sunday|01/24|[Merge Sort + Exercises](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_24.md)| | |3|Tuesday|01/26|[Entrepreneurship Talk](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_26.md)|x| From 6af27aab9e2bc72ee3e8e85753d84134960b221f Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Sun, 3 Jan 2016 23:50:13 -0500 Subject: [PATCH 031/126] Update 2016_01_07.md --- lessons/week-0/2016_01_07.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/lessons/week-0/2016_01_07.md b/lessons/week-0/2016_01_07.md index e83cc3a..5690b1d 100644 --- a/lessons/week-0/2016_01_07.md +++ b/lessons/week-0/2016_01_07.md @@ -1,4 +1,4 @@ -# Instructor +## Instructor Cameron -# Objectives +## Objectives From f167555b2a436c50dfca5323adca0bd33d3d9379 Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Sun, 3 Jan 2016 23:50:23 -0500 Subject: [PATCH 032/126] Update 2016_01_14.md --- lessons/week-1/2016_01_14.md | 4 +++- 1 file changed, 3 insertions(+), 1 deletion(-) diff --git a/lessons/week-1/2016_01_14.md b/lessons/week-1/2016_01_14.md index 9a34d27..5690b1d 100644 --- a/lessons/week-1/2016_01_14.md +++ b/lessons/week-1/2016_01_14.md @@ -1,2 +1,4 @@ -# Instructor +## Instructor Cameron + +## Objectives From 17ab6d1df10eca90715415d82a5d3b92853af853 Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Sun, 3 Jan 2016 23:50:41 -0500 Subject: [PATCH 033/126] Update 2016_01_21.md --- lessons/week-2/2016_01_21.md | 4 +++- 1 file changed, 3 insertions(+), 1 deletion(-) diff --git a/lessons/week-2/2016_01_21.md b/lessons/week-2/2016_01_21.md index 9a34d27..688b842 100644 --- a/lessons/week-2/2016_01_21.md +++ b/lessons/week-2/2016_01_21.md @@ -1,2 +1,4 @@ -# Instructor +## Instructor Cameron + +## Objectives From 03f595f9dc0e0f4ca6afa4116439e511ab9f629a Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Sun, 3 Jan 2016 23:50:59 -0500 Subject: [PATCH 034/126] Update 2016_01_28.md --- lessons/week-3/2016_01_28.md | 4 ++++ 1 file changed, 4 insertions(+) diff --git a/lessons/week-3/2016_01_28.md b/lessons/week-3/2016_01_28.md index e69de29..688b842 100644 --- a/lessons/week-3/2016_01_28.md +++ b/lessons/week-3/2016_01_28.md @@ -0,0 +1,4 @@ +## Instructor +Cameron + +## Objectives From 3e7ae0f1ab80668946fafe609895f0d087fbd0ab Mon Sep 17 00:00:00 2001 From: benstone1 Date: Mon, 4 Jan 2016 16:56:19 -0500 Subject: [PATCH 035/126] Update README.md --- README.md | 5 +++++ 1 file changed, 5 insertions(+) diff --git a/README.md b/README.md index e16b597..f1c1d09 100644 --- a/README.md +++ b/README.md @@ -18,3 +18,8 @@ |3|Thursday|01/28|[Lists, Stacks + Queues](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_28.md)| | |3|Saturday|01/30|[Sets + Hashmaps](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_30.md)| | |3|Sunday|01/31|[Exercises + Assessment](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_31.md)| | + +### Homework + Due Date | Homework | Solution | +|---|---|---| +1/11/16 at 12:00 am | Submit links to updated GitHub, LinkedIn and Resume [SUBMIT HERE] | x From edea636440a5b2edbf08d6bdba1b1ac34d4b7ac7 Mon Sep 17 00:00:00 2001 From: benstone1 Date: Mon, 4 Jan 2016 17:12:08 -0500 Subject: [PATCH 036/126] Update README.md --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index f1c1d09..d6ca560 100644 --- a/README.md +++ b/README.md @@ -22,4 +22,4 @@ ### Homework Due Date | Homework | Solution | |---|---|---| -1/11/16 at 12:00 am | Submit links to updated GitHub, LinkedIn and Resume [SUBMIT HERE] | x +1/11/16 at 12:00 am | Submit links to updated GitHub, LinkedIn and Resume [SUBMIT HERE](http://goo.gl/forms/KUfBPRHQBr) | x From c17f3bf33edbe6616974a7bb2ce64633cfd6fbfc Mon Sep 17 00:00:00 2001 From: benstone1 Date: Mon, 4 Jan 2016 17:13:17 -0500 Subject: [PATCH 037/126] Update README.md --- README.md | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/README.md b/README.md index d6ca560..b68891b 100644 --- a/README.md +++ b/README.md @@ -20,6 +20,6 @@ |3|Sunday|01/31|[Exercises + Assessment](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_31.md)| | ### Homework - Due Date | Homework | Solution | -|---|---|---| -1/11/16 at 12:00 am | Submit links to updated GitHub, LinkedIn and Resume [SUBMIT HERE](http://goo.gl/forms/KUfBPRHQBr) | x + Due Date | Homework | Submission Format | Solution | +|---|---|---|---| +1/11/16 at 12:00 am | Submit links to updated GitHub, LinkedIn and Resume | [Link to Google Form](http://goo.gl/forms/KUfBPRHQBr) | x From 95d4ae712575652d92b5ad398631ffeb90375086 Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Tue, 5 Jan 2016 13:18:49 -0500 Subject: [PATCH 038/126] Update 2016_01_09.md --- lessons/week-0/2016_01_09.md | 5 ++++- 1 file changed, 4 insertions(+), 1 deletion(-) diff --git a/lessons/week-0/2016_01_09.md b/lessons/week-0/2016_01_09.md index 5ee8755..1921df5 100644 --- a/lessons/week-0/2016_01_09.md +++ b/lessons/week-0/2016_01_09.md @@ -1,4 +1,7 @@ -# Objective +## Instructor +Linus + +## Objective * What is a data structure? * What is an object? (pass by reference vs. pass by value) * How are data structure defined relative to oop (Is a data structure an object? Is an object a data structure?) From 4c901344cd56356abd089c59d7044c45dd5d455f Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Tue, 5 Jan 2016 13:19:04 -0500 Subject: [PATCH 039/126] Update 2016_01_16.md --- lessons/week-1/2016_01_16.md | 2 ++ 1 file changed, 2 insertions(+) diff --git a/lessons/week-1/2016_01_16.md b/lessons/week-1/2016_01_16.md index e69de29..5a4603a 100644 --- a/lessons/week-1/2016_01_16.md +++ b/lessons/week-1/2016_01_16.md @@ -0,0 +1,2 @@ +## Instructor +Linus From 30107d5ea618dfa732d42ce44114ae587bf11a32 Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Tue, 5 Jan 2016 13:19:15 -0500 Subject: [PATCH 040/126] Update 2016_01_23.md --- lessons/week-2/2016_01_23.md | 4 ++++ 1 file changed, 4 insertions(+) diff --git a/lessons/week-2/2016_01_23.md b/lessons/week-2/2016_01_23.md index e69de29..453f7a1 100644 --- a/lessons/week-2/2016_01_23.md +++ b/lessons/week-2/2016_01_23.md @@ -0,0 +1,4 @@ +## Instructor +Linus + +## Objectives From 5512644313b4721180004b27e41a3138d88b23a8 Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Tue, 5 Jan 2016 13:19:29 -0500 Subject: [PATCH 041/126] Update 2016_01_30.md --- lessons/week-3/2016_01_30.md | 4 ++++ 1 file changed, 4 insertions(+) diff --git a/lessons/week-3/2016_01_30.md b/lessons/week-3/2016_01_30.md index e69de29..4cd26f5 100644 --- a/lessons/week-3/2016_01_30.md +++ b/lessons/week-3/2016_01_30.md @@ -0,0 +1,4 @@ +## Instructor +Linus + +## Objectives From 677e6ed6cbcc4f866b6bd76c94ee988f8e63ef9e Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Tue, 5 Jan 2016 13:19:47 -0500 Subject: [PATCH 042/126] Update 2016_01_16.md --- lessons/week-1/2016_01_16.md | 2 ++ 1 file changed, 2 insertions(+) diff --git a/lessons/week-1/2016_01_16.md b/lessons/week-1/2016_01_16.md index 5a4603a..4cd26f5 100644 --- a/lessons/week-1/2016_01_16.md +++ b/lessons/week-1/2016_01_16.md @@ -1,2 +1,4 @@ ## Instructor Linus + +## Objectives From e246418e29d2bf33772b4126dcbfdf45b19016d4 Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Tue, 5 Jan 2016 13:20:58 -0500 Subject: [PATCH 043/126] Update 2016_01_10.md --- lessons/week-0/2016_01_10.md | 5 ++++- 1 file changed, 4 insertions(+), 1 deletion(-) diff --git a/lessons/week-0/2016_01_10.md b/lessons/week-0/2016_01_10.md index 6250616..c2c7c0b 100644 --- a/lessons/week-0/2016_01_10.md +++ b/lessons/week-0/2016_01_10.md @@ -1,2 +1,5 @@ -# Objectives +## Instructor +Caleb + +## Objectives Exercises From a565ed09fb0e6402c3c906f42d8ba226da0a729e Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Tue, 5 Jan 2016 13:21:41 -0500 Subject: [PATCH 044/126] Update 2016_01_17.md --- lessons/week-1/2016_01_17.md | 4 ++++ 1 file changed, 4 insertions(+) diff --git a/lessons/week-1/2016_01_17.md b/lessons/week-1/2016_01_17.md index e69de29..de07649 100644 --- a/lessons/week-1/2016_01_17.md +++ b/lessons/week-1/2016_01_17.md @@ -0,0 +1,4 @@ +## Instructor +Caleb + +## Objectives From fa098568a47fd1ceed388ec1fadd4d7da1afbb3b Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Tue, 5 Jan 2016 13:21:54 -0500 Subject: [PATCH 045/126] Update 2016_01_24.md --- lessons/week-2/2016_01_24.md | 4 ++++ 1 file changed, 4 insertions(+) diff --git a/lessons/week-2/2016_01_24.md b/lessons/week-2/2016_01_24.md index e69de29..de07649 100644 --- a/lessons/week-2/2016_01_24.md +++ b/lessons/week-2/2016_01_24.md @@ -0,0 +1,4 @@ +## Instructor +Caleb + +## Objectives From 3522b716a6dc4b8b5608bf3045b67b335fc63951 Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Tue, 5 Jan 2016 13:22:07 -0500 Subject: [PATCH 046/126] Update 2016_01_31.md --- lessons/week-3/2016_01_31.md | 4 ++++ 1 file changed, 4 insertions(+) diff --git a/lessons/week-3/2016_01_31.md b/lessons/week-3/2016_01_31.md index e69de29..de07649 100644 --- a/lessons/week-3/2016_01_31.md +++ b/lessons/week-3/2016_01_31.md @@ -0,0 +1,4 @@ +## Instructor +Caleb + +## Objectives From af452ac108c09972f1216e8c4febbb6d6cd11071 Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Tue, 5 Jan 2016 13:25:29 -0500 Subject: [PATCH 047/126] Update README.md --- README.md | 36 ++++++++++++++++++------------------ 1 file changed, 18 insertions(+), 18 deletions(-) diff --git a/README.md b/README.md index b68891b..3da9186 100644 --- a/README.md +++ b/README.md @@ -1,23 +1,23 @@ ###Unit 4 Schedule -|Week|Day|Date|Activity|Non-technical| -|---|---|---|---|---| -|0|Tuesday|01/05|[How to frame Access Code + Intro to Swift](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_05.md)|x| -|0|Thursday|01/07|[Intro to data structures / algorithms](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_07.md)| | -|0|Saturday|01/09|[Recap unit 0 in Swift + MVC](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_09.md)| | -|0|Sunday|01/10|[iOS Personal Project + Big O](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_10.md)| | -|1|Tuesday|01/12|[Technical Pathways with Dion and Job materials (workshop)](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_12.md)|x| -|1|Thursday|01/14|[Discrete Math and Logic](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_14.md)| | -|1|Saturday|01/16|[Lists + Sorts](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_16.md)| | -|1|Sunday|01/17|[Sorts + Assessment](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_17.md)| | -|2|Tuesday|01/19|[Behavioral interview questions (workshop)](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_19.md)|x| -|2|Thursday|01/21|[Intro to Stack + Heap (memory)](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_21.md)| | +|Week|Day|Date|Activity|Instructor|Non-technical| +|---|---|---|---|---|---| +|0|Tuesday|01/05|[How to frame Access Code + Intro to Swift](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_05.md)| |x| +|0|Thursday|01/07|[Intro to data structures / algorithms](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_07.md)|Cameron| | +|0|Saturday|01/09|[Recap unit 0 in Swift + MVC](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_09.md)|Linus| | +|0|Sunday|01/10|[iOS Personal Project + Big O](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_10.md)|Caleb| | +|1|Tuesday|01/12|[Technical Pathways with Dion and Job materials (workshop)](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_12.md)| | x| +|1|Thursday|01/14|[Discrete Math and Logic](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_14.md)|Cameron| | +|1|Saturday|01/16|[Lists + Sorts](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_16.md)|Linus| | +|1|Sunday|01/17|[Sorts + Assessment](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_17.md)|Caleb| | +|2|Tuesday|01/19|[Behavioral interview questions (workshop)](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_19.md)| |x| +|2|Thursday|01/21|[Intro to Stack + Heap (memory)](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_21.md)|Cameron| | |2|Friday|01/22|LinkedIn profile workshop @ LinkedIn|x| -|2|Saturday|01/23|[Quick Sort + Recursion](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_23.md)| | -|2|Sunday|01/24|[Merge Sort + Exercises](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_24.md)| | -|3|Tuesday|01/26|[Entrepreneurship Talk](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_26.md)|x| -|3|Thursday|01/28|[Lists, Stacks + Queues](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_28.md)| | -|3|Saturday|01/30|[Sets + Hashmaps](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_30.md)| | -|3|Sunday|01/31|[Exercises + Assessment](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_31.md)| | +|2|Saturday|01/23|[Quick Sort + Recursion](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_23.md)|Linus| | +|2|Sunday|01/24|[Merge Sort + Exercises](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_24.md)|Caleb| | +|3|Tuesday|01/26|[Entrepreneurship Talk](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_26.md)| |x| +|3|Thursday|01/28|[Lists, Stacks + Queues](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_28.md)|Cameron| | +|3|Saturday|01/30|[Sets + Hashmaps](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_30.md)|Linus| | +|3|Sunday|01/31|[Exercises + Assessment](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_31.md)|CCaleb| | ### Homework Due Date | Homework | Submission Format | Solution | From 022415c40955aeeacd7c36fe85c242a615399fd9 Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Tue, 5 Jan 2016 13:26:04 -0500 Subject: [PATCH 048/126] Update README.md --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 3da9186..2981697 100644 --- a/README.md +++ b/README.md @@ -17,7 +17,7 @@ |3|Tuesday|01/26|[Entrepreneurship Talk](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_26.md)| |x| |3|Thursday|01/28|[Lists, Stacks + Queues](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_28.md)|Cameron| | |3|Saturday|01/30|[Sets + Hashmaps](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_30.md)|Linus| | -|3|Sunday|01/31|[Exercises + Assessment](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_31.md)|CCaleb| | +|3|Sunday|01/31|[Exercises + Assessment](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_31.md)|Caleb| | ### Homework Due Date | Homework | Submission Format | Solution | From b482ccd49a8ae794d2f2585936afddd65655045e Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Tue, 5 Jan 2016 14:00:55 -0500 Subject: [PATCH 049/126] Update README.md --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 2981697..fc8be84 100644 --- a/README.md +++ b/README.md @@ -15,7 +15,7 @@ |2|Saturday|01/23|[Quick Sort + Recursion](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_23.md)|Linus| | |2|Sunday|01/24|[Merge Sort + Exercises](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_24.md)|Caleb| | |3|Tuesday|01/26|[Entrepreneurship Talk](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_26.md)| |x| -|3|Thursday|01/28|[Lists, Stacks + Queues](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_28.md)|Cameron| | +|3|Thursday|01/28|[Linked Lists, Stacks + Queues](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_28.md)|Cameron| | |3|Saturday|01/30|[Sets + Hashmaps](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_30.md)|Linus| | |3|Sunday|01/31|[Exercises + Assessment](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_31.md)|Caleb| | From 0c5870d77e22d4cab6d7c7da340b0c1490ad48e2 Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Tue, 5 Jan 2016 14:02:46 -0500 Subject: [PATCH 050/126] Update 2016_01_28.md --- lessons/week-3/2016_01_28.md | 2 ++ 1 file changed, 2 insertions(+) diff --git a/lessons/week-3/2016_01_28.md b/lessons/week-3/2016_01_28.md index 688b842..0a79568 100644 --- a/lessons/week-3/2016_01_28.md +++ b/lessons/week-3/2016_01_28.md @@ -2,3 +2,5 @@ Cameron ## Objectives + +## Exercises From 8cec2527652a56c105069bbfbf9dc0bd0bc4c03d Mon Sep 17 00:00:00 2001 From: mikekavouras Date: Tue, 5 Jan 2016 14:03:12 -0500 Subject: [PATCH 051/126] exercises --- exercises/linked-lists.md | 0 1 file changed, 0 insertions(+), 0 deletions(-) create mode 100644 exercises/linked-lists.md diff --git a/exercises/linked-lists.md b/exercises/linked-lists.md new file mode 100644 index 0000000..e69de29 From d197b44faf8183e8a5d6af7a292ba1d974ebf118 Mon Sep 17 00:00:00 2001 From: benstone1 Date: Tue, 5 Jan 2016 14:17:05 -0500 Subject: [PATCH 052/126] Update README.md --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index fc8be84..b547445 100644 --- a/README.md +++ b/README.md @@ -22,4 +22,4 @@ ### Homework Due Date | Homework | Submission Format | Solution | |---|---|---|---| -1/11/16 at 12:00 am | Submit links to updated GitHub, LinkedIn and Resume | [Link to Google Form](http://goo.gl/forms/KUfBPRHQBr) | x +1/11/16 at 12:00 am | [Submit links to updated GitHub, LinkedIn and Resume](https://docs.google.com/document/d/1Y6oAzxDa_K0_0_Mz_S-O5w0LJ5eJUuL4iODAH9Fj2FQ/edit?usp=sharing) | [Link to Google Form](http://goo.gl/forms/KUfBPRHQBr) | x From ae57ff83d38dbf20624fce7a8045abbe4a8a8e7e Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Tue, 5 Jan 2016 14:24:24 -0500 Subject: [PATCH 053/126] Update linked-lists.md --- exercises/linked-lists.md | 25 +++++++++++++++++++++++++ 1 file changed, 25 insertions(+) diff --git a/exercises/linked-lists.md b/exercises/linked-lists.md index e69de29..37e42eb 100644 --- a/exercises/linked-lists.md +++ b/exercises/linked-lists.md @@ -0,0 +1,25 @@ +# Linked Lists + + +*Taken from Cracking the Coding Interview, 6th edition* + +**Remove Dups:** Write code to remove duplicates from an unsorted linked list. + +**Return Kth to Last:** Implement an algorithm to find the kth to last element of a singly linked list + +**Delete Middle Node:** Implement an algorithm to delete a node in the middle of a singly linked list given only access to that node. +> *Example:* +Input: the node c from the linked list a -> b -> c -> d -> e +Result: nothing is returned, but the new linked list looks like a -> b -> d -> e + +**Partition:** Write code to partition a linked list around a value x, such that all nodes less than x come before all nodes greater than or equal to x. If x is contained within the list, the values of x only need to be after the elements less than x +> *Example:* +Input: 3 -> 5 -> 8 -> 5 -> 10 -> 2 -> 1 [partition = 5] +Output: 3 -> 1 -> 2 -> 10 -> 5 -> 5 -> 8 + +**Sum Lists:** You have two numbers represented by a linked list, where each node contains a single digit. The digits are stored in *reverse* order, such that the 1's digit is at the head of the list. Write a function that adds the two numbers and returns the sum as a linked list. +> *Example:* +Input: (7 -> 1 -> 6) + (5 -> 9 -> 2). That is, 617 + 296 +Output: 2 -> 1 -> 9 + +**Palindrome:** Implement a function to check if a linked list is a palindrome. From 74506b55b5a07637e9578c636da897984de79a6e Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Tue, 5 Jan 2016 14:27:43 -0500 Subject: [PATCH 054/126] Update 2016_01_28.md --- lessons/week-3/2016_01_28.md | 2 ++ 1 file changed, 2 insertions(+) diff --git a/lessons/week-3/2016_01_28.md b/lessons/week-3/2016_01_28.md index 0a79568..351ed1f 100644 --- a/lessons/week-3/2016_01_28.md +++ b/lessons/week-3/2016_01_28.md @@ -4,3 +4,5 @@ Cameron ## Objectives ## Exercises + +[**Linked Lists**](https://github.com/accesscode-2-2/unit-4/blob/master/exercises/linked-lists.md) From 5a5470eead0c45c50cae82b613b2d87eea1df4ff Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Tue, 5 Jan 2016 14:39:48 -0500 Subject: [PATCH 055/126] Update linked-lists.md --- exercises/linked-lists.md | 14 +++++++------- 1 file changed, 7 insertions(+), 7 deletions(-) diff --git a/exercises/linked-lists.md b/exercises/linked-lists.md index 37e42eb..370d021 100644 --- a/exercises/linked-lists.md +++ b/exercises/linked-lists.md @@ -8,18 +8,18 @@ **Return Kth to Last:** Implement an algorithm to find the kth to last element of a singly linked list **Delete Middle Node:** Implement an algorithm to delete a node in the middle of a singly linked list given only access to that node. -> *Example:* -Input: the node c from the linked list a -> b -> c -> d -> e -Result: nothing is returned, but the new linked list looks like a -> b -> d -> e +> *Example:* +**Input:** the node c from the linked list a -> b -> c -> d -> e +**Result:** nothing is returned, but the new linked list looks like a -> b -> d -> e **Partition:** Write code to partition a linked list around a value x, such that all nodes less than x come before all nodes greater than or equal to x. If x is contained within the list, the values of x only need to be after the elements less than x > *Example:* -Input: 3 -> 5 -> 8 -> 5 -> 10 -> 2 -> 1 [partition = 5] -Output: 3 -> 1 -> 2 -> 10 -> 5 -> 5 -> 8 +**Input:** 3 -> 5 -> 8 -> 5 -> 10 -> 2 -> 1 [partition = 5] +**Output:** 3 -> 1 -> 2 -> 10 -> 5 -> 5 -> 8 **Sum Lists:** You have two numbers represented by a linked list, where each node contains a single digit. The digits are stored in *reverse* order, such that the 1's digit is at the head of the list. Write a function that adds the two numbers and returns the sum as a linked list. > *Example:* -Input: (7 -> 1 -> 6) + (5 -> 9 -> 2). That is, 617 + 296 -Output: 2 -> 1 -> 9 +**Input:** (7 -> 1 -> 6) + (5 -> 9 -> 2). That is, 617 + 296 +**Output:** 2 -> 1 -> 9 **Palindrome:** Implement a function to check if a linked list is a palindrome. From e49ce3d969755423573cdbe891393f581ef9b4b3 Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Tue, 5 Jan 2016 14:40:03 -0500 Subject: [PATCH 056/126] Create recursion.md --- exercises/recursion.md | 12 ++++++++++++ 1 file changed, 12 insertions(+) create mode 100644 exercises/recursion.md diff --git a/exercises/recursion.md b/exercises/recursion.md new file mode 100644 index 0000000..7b08d38 --- /dev/null +++ b/exercises/recursion.md @@ -0,0 +1,12 @@ +Take from [CodingBat](http://codingbat.com/prob/p154669) + +**Factorial** [source](http://codingbat.com/prob/p154669) +Given `n` of 1 or more, return the factorial of `n`, which is `n * (n-1) * (n-2) ... 1`. Compute the result recursively (without loops). + +**Bunny Ears** [source](http://codingbat.com/prob/p183649) +We have a number of bunnies and each bunny has two big floppy ears. We want to compute the total number of ears across all the bunnies recursively (without loops or multiplication). + +*Example:* +bunnyEars(0) → 0 +bunnyEars(1) → 2 +bunnyEars(2) → 4 From 6d90034803a020646ee5ea5fe9eabbc96b602760 Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Tue, 5 Jan 2016 14:40:33 -0500 Subject: [PATCH 057/126] Update recursion.md --- exercises/recursion.md | 4 +++- 1 file changed, 3 insertions(+), 1 deletion(-) diff --git a/exercises/recursion.md b/exercises/recursion.md index 7b08d38..269118b 100644 --- a/exercises/recursion.md +++ b/exercises/recursion.md @@ -1,4 +1,6 @@ -Take from [CodingBat](http://codingbat.com/prob/p154669) +# Recursion + +*Taken from [CodingBat](http://codingbat.com/prob/p154669)* **Factorial** [source](http://codingbat.com/prob/p154669) Given `n` of 1 or more, return the factorial of `n`, which is `n * (n-1) * (n-2) ... 1`. Compute the result recursively (without loops). From f22061dff43344bab685863646436ac5bb33532f Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Tue, 5 Jan 2016 14:41:05 -0500 Subject: [PATCH 058/126] Update recursion.md --- exercises/recursion.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/exercises/recursion.md b/exercises/recursion.md index 269118b..4556aec 100644 --- a/exercises/recursion.md +++ b/exercises/recursion.md @@ -8,7 +8,7 @@ Given `n` of 1 or more, return the factorial of `n`, which is `n * (n-1) * (n-2) **Bunny Ears** [source](http://codingbat.com/prob/p183649) We have a number of bunnies and each bunny has two big floppy ears. We want to compute the total number of ears across all the bunnies recursively (without loops or multiplication). -*Example:* +> *Example:* bunnyEars(0) → 0 bunnyEars(1) → 2 bunnyEars(2) → 4 From 618860bcfe07b58c6aebb4177d2dbe6000a02bca Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Tue, 5 Jan 2016 14:42:49 -0500 Subject: [PATCH 059/126] Update recursion.md --- exercises/recursion.md | 19 ++++++++++++++++++- 1 file changed, 18 insertions(+), 1 deletion(-) diff --git a/exercises/recursion.md b/exercises/recursion.md index 4556aec..817b124 100644 --- a/exercises/recursion.md +++ b/exercises/recursion.md @@ -11,4 +11,21 @@ We have a number of bunnies and each bunny has two big floppy ears. We want to c > *Example:* bunnyEars(0) → 0 bunnyEars(1) → 2 -bunnyEars(2) → 4 +bunnyEars(2) → 4 + +**Bunny Ears 2** [source](http://codingbat.com/prob/p107330) +We have bunnies standing in a line, numbered 1, 2, ... The odd bunnies (1, 3, ..) have the normal 2 ears. The even bunnies (2, 4, ..) we'll say have 3 ears, because they each have a raised foot. Recursively return the number of "ears" in the bunny line 1, 2, ... n (without loops or multiplication). + +> *Example:* +bunnyEars2(0) → 0 +bunnyEars2(1) → 2 +bunnyEars2(2) → 5 + +**Triangle** [source](http://codingbat.com/prob/p194781) +We have triangle made of blocks. The topmost row has 1 block, the next row down has 2 blocks, the next row has 3 blocks, and so on. Compute recursively (no loops or multiplication) the total number of blocks in such a triangle with the given number of rows. + +> *Example:* +triangle(0) → 0 +triangle(1) → 1 +triangle(2) → 3 + From 0934d3a062663fff81a1ac5a36b6ddc4bb7f8488 Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Tue, 5 Jan 2016 14:43:06 -0500 Subject: [PATCH 060/126] Update recursion.md --- exercises/recursion.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/exercises/recursion.md b/exercises/recursion.md index 817b124..a89e91f 100644 --- a/exercises/recursion.md +++ b/exercises/recursion.md @@ -21,7 +21,7 @@ bunnyEars2(0) → 0 bunnyEars2(1) → 2 bunnyEars2(2) → 5 -**Triangle** [source](http://codingbat.com/prob/p194781) +**Triangle** [source](http://codingbat.com/prob/p194781) We have triangle made of blocks. The topmost row has 1 block, the next row down has 2 blocks, the next row has 3 blocks, and so on. Compute recursively (no loops or multiplication) the total number of blocks in such a triangle with the given number of rows. > *Example:* From cc140d3224acf780b275c12a0981f97b27ee660d Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Tue, 5 Jan 2016 14:44:48 -0500 Subject: [PATCH 061/126] Update recursion.md --- exercises/recursion.md | 16 ++++++++-------- 1 file changed, 8 insertions(+), 8 deletions(-) diff --git a/exercises/recursion.md b/exercises/recursion.md index a89e91f..6d1616e 100644 --- a/exercises/recursion.md +++ b/exercises/recursion.md @@ -11,21 +11,21 @@ We have a number of bunnies and each bunny has two big floppy ears. We want to c > *Example:* bunnyEars(0) → 0 bunnyEars(1) → 2 -bunnyEars(2) → 4 +bunnyEars(2) → 4 **Bunny Ears 2** [source](http://codingbat.com/prob/p107330) We have bunnies standing in a line, numbered 1, 2, ... The odd bunnies (1, 3, ..) have the normal 2 ears. The even bunnies (2, 4, ..) we'll say have 3 ears, because they each have a raised foot. Recursively return the number of "ears" in the bunny line 1, 2, ... n (without loops or multiplication). > *Example:* -bunnyEars2(0) → 0 -bunnyEars2(1) → 2 -bunnyEars2(2) → 5 +bunnyEars2(0) → 0 +bunnyEars2(1) → 2 +bunnyEars2(2) → 5 **Triangle** [source](http://codingbat.com/prob/p194781) We have triangle made of blocks. The topmost row has 1 block, the next row down has 2 blocks, the next row has 3 blocks, and so on. Compute recursively (no loops or multiplication) the total number of blocks in such a triangle with the given number of rows. -> *Example:* -triangle(0) → 0 -triangle(1) → 1 -triangle(2) → 3 +> *Example:* +triangle(0) → 0 +triangle(1) → 1 +triangle(2) → 3 From f0cbe8b118e464d001a7ba7487701fd358c8edfb Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Tue, 5 Jan 2016 14:45:47 -0500 Subject: [PATCH 062/126] Update recursion.md --- exercises/recursion.md | 8 ++++++++ 1 file changed, 8 insertions(+) diff --git a/exercises/recursion.md b/exercises/recursion.md index 6d1616e..5a7b1ca 100644 --- a/exercises/recursion.md +++ b/exercises/recursion.md @@ -29,3 +29,11 @@ triangle(0) → 0 triangle(1) → 1 triangle(2) → 3 +**Sum Digits** [source](http://codingbat.com/prob/p163932) +Given a non-negative int n, return the sum of its digits recursively (no loops). Note that mod (%) by 10 yields the rightmost digit (126 % 10 is 6), while divide (/) by 10 removes the rightmost digit (126 / 10 is 12). + +> *Example:* +sumDigits(126) → 9 +sumDigits(49) → 13 +sumDigits(12) → 3 + From 9f5222b24eb9962be81eff399af964c9aa36f618 Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Tue, 5 Jan 2016 14:46:07 -0500 Subject: [PATCH 063/126] Update recursion.md --- exercises/recursion.md | 1 + 1 file changed, 1 insertion(+) diff --git a/exercises/recursion.md b/exercises/recursion.md index 5a7b1ca..a35ccbe 100644 --- a/exercises/recursion.md +++ b/exercises/recursion.md @@ -37,3 +37,4 @@ sumDigits(126) → 9 sumDigits(49) → 13 sumDigits(12) → 3 +[Tons More!!!](http://codingbat.com/java/Recursion-1) From b64d8c7b3d8ad5df82383070493aa90558bda743 Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Tue, 5 Jan 2016 14:47:13 -0500 Subject: [PATCH 064/126] Update recursion.md --- exercises/recursion.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/exercises/recursion.md b/exercises/recursion.md index a35ccbe..379bde4 100644 --- a/exercises/recursion.md +++ b/exercises/recursion.md @@ -37,4 +37,4 @@ sumDigits(126) → 9 sumDigits(49) → 13 sumDigits(12) → 3 -[Tons More!!!](http://codingbat.com/java/Recursion-1) +You can click through to the [CodingBat website](http://codingbat.com/java/Recursion-1) for a whole bunch of exercises. The website is for Java, but you can obviously do these problems in any language you want. From 1f073af78af098545c2b436d10af29fcd7d43070 Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Tue, 5 Jan 2016 14:50:03 -0500 Subject: [PATCH 065/126] Update recursion.md --- exercises/recursion.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/exercises/recursion.md b/exercises/recursion.md index 379bde4..d34e5ef 100644 --- a/exercises/recursion.md +++ b/exercises/recursion.md @@ -1,6 +1,6 @@ # Recursion -*Taken from [CodingBat](http://codingbat.com/prob/p154669)* +*Taken from [CodingBat](http://codingbat.com)* **Factorial** [source](http://codingbat.com/prob/p154669) Given `n` of 1 or more, return the factorial of `n`, which is `n * (n-1) * (n-2) ... 1`. Compute the result recursively (without loops). From d7009a7c7962122f4c9cca04db31855c2275412c Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Tue, 5 Jan 2016 14:50:10 -0500 Subject: [PATCH 066/126] Create lists.md --- exercises/lists.md | 3 +++ 1 file changed, 3 insertions(+) create mode 100644 exercises/lists.md diff --git a/exercises/lists.md b/exercises/lists.md new file mode 100644 index 0000000..6e4042c --- /dev/null +++ b/exercises/lists.md @@ -0,0 +1,3 @@ +# Lists + +*Taken from [CodingBat](http://codingbat.com)* From f516bbef34dca797f02313df38c9ee66da448c04 Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Tue, 5 Jan 2016 14:52:15 -0500 Subject: [PATCH 067/126] Update lists.md --- exercises/lists.md | 15 +++++++++++++++ 1 file changed, 15 insertions(+) diff --git a/exercises/lists.md b/exercises/lists.md index 6e4042c..982b28c 100644 --- a/exercises/lists.md +++ b/exercises/lists.md @@ -1,3 +1,18 @@ # Lists *Taken from [CodingBat](http://codingbat.com)* + +**First-Last 6** [source](http://codingbat.com/prob/p181624) +Given an array of ints, return True if 6 appears as either the first or last element in the array. The array will be length 1 or more. + +> *Example:* +first_last6([1, 2, 6]) → True +first_last6([6, 1, 2, 3]) → True +first_last6([13, 6, 1, 2, 3]) → False + +**First-Last Same** [source](http://codingbat.com/prob/p179078) +Given an array of ints, return True if the array is length 1 or more, and the first element and the last element are equal. +> *Example:* +same_first_last([1, 2, 3]) → False +same_first_last([1, 2, 3, 1]) → True +same_first_last([1, 2, 1]) → True From 9b79a357f4bbc8cd8d124c288e45bd2d67147d05 Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Tue, 5 Jan 2016 14:52:26 -0500 Subject: [PATCH 068/126] Update lists.md --- exercises/lists.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/exercises/lists.md b/exercises/lists.md index 982b28c..1fa1026 100644 --- a/exercises/lists.md +++ b/exercises/lists.md @@ -10,7 +10,7 @@ first_last6([1, 2, 6]) → True first_last6([6, 1, 2, 3]) → True first_last6([13, 6, 1, 2, 3]) → False -**First-Last Same** [source](http://codingbat.com/prob/p179078) +**First-Last Same** [source](http://codingbat.com/prob/p179078) Given an array of ints, return True if the array is length 1 or more, and the first element and the last element are equal. > *Example:* same_first_last([1, 2, 3]) → False From c9053abc8fd7cb01130952ffddb5eb6568107501 Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Tue, 5 Jan 2016 14:53:49 -0500 Subject: [PATCH 069/126] Update lists.md --- exercises/lists.md | 8 ++++++++ 1 file changed, 8 insertions(+) diff --git a/exercises/lists.md b/exercises/lists.md index 1fa1026..1689f88 100644 --- a/exercises/lists.md +++ b/exercises/lists.md @@ -16,3 +16,11 @@ Given an array of ints, return True if the array is length 1 or more, and the fi same_first_last([1, 2, 3]) → False same_first_last([1, 2, 3, 1]) → True same_first_last([1, 2, 1]) → True + +**Rotate Left 3** [source](http://codingbat.com/prob/p148661) +Given an array of ints length 3, return an array with the elements "rotated left" so {1, 2, 3} yields {2, 3, 1}. + +> *Example:* +rotate_left3([1, 2, 3]) → [2, 3, 1] +rotate_left3([5, 11, 9]) → [11, 9, 5] +rotate_left3([7, 0, 0]) → [0, 0, 7] From 07afe50a7501ec7c0066b363f5c27dbc33cd4b07 Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Tue, 5 Jan 2016 14:55:33 -0500 Subject: [PATCH 070/126] Update lists.md --- exercises/lists.md | 9 +++++++++ 1 file changed, 9 insertions(+) diff --git a/exercises/lists.md b/exercises/lists.md index 1689f88..8ab3c25 100644 --- a/exercises/lists.md +++ b/exercises/lists.md @@ -24,3 +24,12 @@ Given an array of ints length 3, return an array with the elements "rotated left rotate_left3([1, 2, 3]) → [2, 3, 1] rotate_left3([5, 11, 9]) → [11, 9, 5] rotate_left3([7, 0, 0]) → [0, 0, 7] + +**Middle Way** [source](http://codingbat.com/prob/p171011) +Given 2 int arrays, a and b, each length 3, return a new array length 2 containing their middle elements. + +> *Example:* +middle_way([1, 2, 3], [4, 5, 6]) → [2, 5] +middle_way([7, 7, 7], [3, 8, 0]) → [7, 8] +middle_way([5, 2, 9], [1, 4, 5]) → [2, 4] + From 3d77ef4bfe781c3ee13cf2f6973ec98b80f2e0f9 Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Tue, 5 Jan 2016 14:56:10 -0500 Subject: [PATCH 071/126] Update lists.md --- exercises/lists.md | 2 ++ 1 file changed, 2 insertions(+) diff --git a/exercises/lists.md b/exercises/lists.md index 8ab3c25..11f5ec8 100644 --- a/exercises/lists.md +++ b/exercises/lists.md @@ -33,3 +33,5 @@ middle_way([1, 2, 3], [4, 5, 6]) → [2, 5] middle_way([7, 7, 7], [3, 8, 0]) → [7, 8] middle_way([5, 2, 9], [1, 4, 5]) → [2, 4] +You can click through to the [CodingBat website](http://codingbat.com/java/Recursion-1) for a whole bunch of exercises. These exercises are in Python, but you can do them in any language you want. + From e0f965efe43f29942edd6c875a0dd698ea4abda1 Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Tue, 5 Jan 2016 14:56:48 -0500 Subject: [PATCH 072/126] Update recursion.md --- exercises/recursion.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/exercises/recursion.md b/exercises/recursion.md index d34e5ef..5adcee8 100644 --- a/exercises/recursion.md +++ b/exercises/recursion.md @@ -37,4 +37,4 @@ sumDigits(126) → 9 sumDigits(49) → 13 sumDigits(12) → 3 -You can click through to the [CodingBat website](http://codingbat.com/java/Recursion-1) for a whole bunch of exercises. The website is for Java, but you can obviously do these problems in any language you want. +You can click through to the [CodingBat website](http://codingbat.com/java/Recursion-1) for a whole bunch of exercises. These exercises are in Java, but you can do them in any language you want. From e48a7961c43b5d8d31952851ba58ebb3df642197 Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Tue, 5 Jan 2016 14:56:58 -0500 Subject: [PATCH 073/126] Update lists.md --- exercises/lists.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/exercises/lists.md b/exercises/lists.md index 11f5ec8..4012c21 100644 --- a/exercises/lists.md +++ b/exercises/lists.md @@ -33,5 +33,5 @@ middle_way([1, 2, 3], [4, 5, 6]) → [2, 5] middle_way([7, 7, 7], [3, 8, 0]) → [7, 8] middle_way([5, 2, 9], [1, 4, 5]) → [2, 4] -You can click through to the [CodingBat website](http://codingbat.com/java/Recursion-1) for a whole bunch of exercises. These exercises are in Python, but you can do them in any language you want. +You can click through to the [CodingBat website](http://codingbat.com/python/List-1) for a whole bunch of exercises. These exercises are in Python, but you can do them in any language you want. From 821bdc49e976d52dc486603a736c42620db37ca8 Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Tue, 5 Jan 2016 14:57:55 -0500 Subject: [PATCH 074/126] Update 2016_01_16.md --- lessons/week-1/2016_01_16.md | 3 +++ 1 file changed, 3 insertions(+) diff --git a/lessons/week-1/2016_01_16.md b/lessons/week-1/2016_01_16.md index 4cd26f5..968e1ba 100644 --- a/lessons/week-1/2016_01_16.md +++ b/lessons/week-1/2016_01_16.md @@ -2,3 +2,6 @@ Linus ## Objectives + +## Exercises +[Lists](https://github.com/accesscode-2-2/unit-4/blob/master/exercises/lists.md) From bf3256d4b875dcb818e05817f4d169ce9502228a Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Tue, 5 Jan 2016 14:58:28 -0500 Subject: [PATCH 075/126] Update 2016_01_23.md --- lessons/week-2/2016_01_23.md | 3 +++ 1 file changed, 3 insertions(+) diff --git a/lessons/week-2/2016_01_23.md b/lessons/week-2/2016_01_23.md index 453f7a1..5cbc0f4 100644 --- a/lessons/week-2/2016_01_23.md +++ b/lessons/week-2/2016_01_23.md @@ -2,3 +2,6 @@ Linus ## Objectives + +## Exercises +[Recursion](https://github.com/accesscode-2-2/unit-4/blob/master/exercises/recursion.md) From f0671bff66317bde3c95d43b6a85a2524e858ba2 Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Tue, 5 Jan 2016 15:08:47 -0500 Subject: [PATCH 076/126] Create logic.md --- exercises/logic.md | 12 ++++++++++++ 1 file changed, 12 insertions(+) create mode 100644 exercises/logic.md diff --git a/exercises/logic.md b/exercises/logic.md new file mode 100644 index 0000000..31ae7d7 --- /dev/null +++ b/exercises/logic.md @@ -0,0 +1,12 @@ +# Logic + +*Taken from [CodingBat](http://codingbat.com/python/Logic-1)* + +**Cigar Party** [source](http://codingbat.com/prob/p195669) + +When squirrels get together for a party, they like to have cigars. A squirrel party is successful when the number of cigars is between 40 and 60, inclusive. Unless it is the weekend, in which case there is no upper bound on the number of cigars. Return True if the party with the given values is successful, or False otherwise. + +> *Example:* +cigar_party(30, False) → False +cigar_party(50, False) → True +cigar_party(70, True) → True From 4ac885db14c543d856473b414f41f62cde54884b Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Tue, 5 Jan 2016 15:09:56 -0500 Subject: [PATCH 077/126] Update logic.md --- exercises/logic.md | 15 ++++++++++++--- 1 file changed, 12 insertions(+), 3 deletions(-) diff --git a/exercises/logic.md b/exercises/logic.md index 31ae7d7..3c1f328 100644 --- a/exercises/logic.md +++ b/exercises/logic.md @@ -7,6 +7,15 @@ When squirrels get together for a party, they like to have cigars. A squirrel party is successful when the number of cigars is between 40 and 60, inclusive. Unless it is the weekend, in which case there is no upper bound on the number of cigars. Return True if the party with the given values is successful, or False otherwise. > *Example:* -cigar_party(30, False) → False -cigar_party(50, False) → True -cigar_party(70, True) → True +cigar_party(30, False) → False +cigar_party(50, False) → True +cigar_party(70, True) → True + +**Alarm Clock** [source](http://codingbat.com/prob/p119867) + +Given a day of the week encoded as 0=Sun, 1=Mon, 2=Tue, ...6=Sat, and a boolean indicating if we are on vacation, return a string of the form "7:00" indicating when the alarm clock should ring. Weekdays, the alarm should be "7:00" and on the weekend it should be "10:00". Unless we are on vacation -- then on weekdays it should be "10:00" and weekends it should be "off". + +> *Example:* +alarm_clock(1, False) → '7:00' +alarm_clock(5, False) → '7:00' +alarm_clock(0, False) → '10:00' From ca547da97bba0bf05ab1307ff3d1be698da420a0 Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Tue, 5 Jan 2016 15:10:07 -0500 Subject: [PATCH 078/126] Update logic.md --- exercises/logic.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/exercises/logic.md b/exercises/logic.md index 3c1f328..c5f83e7 100644 --- a/exercises/logic.md +++ b/exercises/logic.md @@ -16,6 +16,6 @@ cigar_party(70, True) → True Given a day of the week encoded as 0=Sun, 1=Mon, 2=Tue, ...6=Sat, and a boolean indicating if we are on vacation, return a string of the form "7:00" indicating when the alarm clock should ring. Weekdays, the alarm should be "7:00" and on the weekend it should be "10:00". Unless we are on vacation -- then on weekdays it should be "10:00" and weekends it should be "off". > *Example:* -alarm_clock(1, False) → '7:00' -alarm_clock(5, False) → '7:00' +alarm_clock(1, False) → '7:00' +alarm_clock(5, False) → '7:00' alarm_clock(0, False) → '10:00' From 911365360c8d94d012e513477bad652c4603c5be Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Tue, 5 Jan 2016 15:11:20 -0500 Subject: [PATCH 079/126] Update logic.md --- exercises/logic.md | 9 +++++++++ 1 file changed, 9 insertions(+) diff --git a/exercises/logic.md b/exercises/logic.md index c5f83e7..687e78f 100644 --- a/exercises/logic.md +++ b/exercises/logic.md @@ -19,3 +19,12 @@ Given a day of the week encoded as 0=Sun, 1=Mon, 2=Tue, ...6=Sat, and a boolean alarm_clock(1, False) → '7:00' alarm_clock(5, False) → '7:00' alarm_clock(0, False) → '10:00' + +**Alarm Clock** [source](http://codingbat.com/prob/p165321) + +Given a non-negative number "num", return True if num is within 2 of a multiple of 10. Note: (a % b) is the remainder of dividing a by b, so (7 % 5) is 2. See also: Introduction to Mod + +> *Example:* +near_ten(12) → True +near_ten(17) → False +near_ten(19) → True From 6c2afadfe00c071c330f4db047ad1028af4f1c7f Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Tue, 5 Jan 2016 15:12:13 -0500 Subject: [PATCH 080/126] Update logic.md --- exercises/logic.md | 12 +++++++----- 1 file changed, 7 insertions(+), 5 deletions(-) diff --git a/exercises/logic.md b/exercises/logic.md index 687e78f..1d571d2 100644 --- a/exercises/logic.md +++ b/exercises/logic.md @@ -20,11 +20,13 @@ alarm_clock(1, False) → '7:00' alarm_clock(5, False) → '7:00' alarm_clock(0, False) → '10:00' -**Alarm Clock** [source](http://codingbat.com/prob/p165321) +**Near Ten** [source](http://codingbat.com/prob/p165321) -Given a non-negative number "num", return True if num is within 2 of a multiple of 10. Note: (a % b) is the remainder of dividing a by b, so (7 % 5) is 2. See also: Introduction to Mod +Given a non-negative number "num", return True if num is within 2 of a multiple of 10. Note: (a % b) is the remainder of dividing a by b, so (7 % 5) is 2. See also: Introduction to Mod -> *Example:* -near_ten(12) → True -near_ten(17) → False +> *Example:* +near_ten(12) → True +near_ten(17) → False near_ten(19) → True + +You can click through to the [CodingBat website](http://codingbat.com/python/Logic-1) for a whole bunch of exercises. These exercises are in Python, but you can do them in any language you want. From 6b993e173eb007409a9b117059ad8b03aea1dbe6 Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Tue, 5 Jan 2016 15:12:52 -0500 Subject: [PATCH 081/126] Update 2016_01_14.md --- lessons/week-1/2016_01_14.md | 3 +++ 1 file changed, 3 insertions(+) diff --git a/lessons/week-1/2016_01_14.md b/lessons/week-1/2016_01_14.md index 5690b1d..c6a793f 100644 --- a/lessons/week-1/2016_01_14.md +++ b/lessons/week-1/2016_01_14.md @@ -2,3 +2,6 @@ Cameron ## Objectives + +## Exercises +[Logic](https://github.com/accesscode-2-2/unit-4/blob/master/exercises/logic.md) From d1e6dc485ab47bc0e1bb817dfbcf953790a585f3 Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Tue, 5 Jan 2016 15:41:32 -0500 Subject: [PATCH 082/126] Update 2016_01_05.md --- lessons/week-0/2016_01_05.md | 6 +++++- 1 file changed, 5 insertions(+), 1 deletion(-) diff --git a/lessons/week-0/2016_01_05.md b/lessons/week-0/2016_01_05.md index bec590a..e675425 100644 --- a/lessons/week-0/2016_01_05.md +++ b/lessons/week-0/2016_01_05.md @@ -1,4 +1,8 @@ -#Objectives +## Objectives * What is Swift? * Why Swift vs. Objective-C? * What are playgrounds and how to use them. + +## Resources +https://developer.apple.com/library/ios/documentation/Swift/Conceptual/Swift_Programming_Language/GuidedTour.html +https://itunes.apple.com/us/book/swift-programming-language/id881256329?mt=11 From 41319ce2736adaa935b44220805d8c293a2576a0 Mon Sep 17 00:00:00 2001 From: Mike Kavouras Date: Wed, 6 Jan 2016 12:03:15 -0500 Subject: [PATCH 083/126] Update README.md --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index b547445..50d62ec 100644 --- a/README.md +++ b/README.md @@ -11,7 +11,7 @@ |1|Sunday|01/17|[Sorts + Assessment](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_17.md)|Caleb| | |2|Tuesday|01/19|[Behavioral interview questions (workshop)](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_19.md)| |x| |2|Thursday|01/21|[Intro to Stack + Heap (memory)](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_21.md)|Cameron| | -|2|Friday|01/22|LinkedIn profile workshop @ LinkedIn|x| +|2|Friday|01/22|LinkedIn profile workshop @ LinkedIn| |x| |2|Saturday|01/23|[Quick Sort + Recursion](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_23.md)|Linus| | |2|Sunday|01/24|[Merge Sort + Exercises](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_24.md)|Caleb| | |3|Tuesday|01/26|[Entrepreneurship Talk](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_26.md)| |x| From 21d457a4f1bf2cc57d22e2bfb3ea39f055a818fb Mon Sep 17 00:00:00 2001 From: Cameron Spickert Date: Wed, 6 Jan 2016 23:03:22 -0500 Subject: [PATCH 084/126] Update 2016_01_07.md --- lessons/week-0/2016_01_07.md | 109 +++++++++++++++++++++++++++++++++-- 1 file changed, 105 insertions(+), 4 deletions(-) diff --git a/lessons/week-0/2016_01_07.md b/lessons/week-0/2016_01_07.md index 5690b1d..1aaa620 100644 --- a/lessons/week-0/2016_01_07.md +++ b/lessons/week-0/2016_01_07.md @@ -1,4 +1,105 @@ -## Instructor -Cameron - -## Objectives +## Instructor +Cameron + +## Objectives +* Learn about, compare, and evaluate different data structures +* Understand real-world applications of algorithms and data structures + +## Notes + +### Algorithms + +[Wikipedia](https://en.wikipedia.org/wiki/Algorithm) defines the word _algorithm_ as “a self-contained step-by-step set of operations to be performed”. + +And here's the definition from [_Introduction to Algorithms 3rd Edition_](http://www.amazon.com/dp/0262033844) (via [Medium](https://medium.com/@_marcos_otero/the-real-10-algorithms-that-dominate-our-world-e95fa9f16c04)): +> Informally, an algorithm is any well-defined computational procedure that takes some value, or set of values, as input and produces some value, or set of values, as output. An algorithm is thus a sequence of computational steps that transform the input into the output. + +In other words, an algorithm is a specification for a program. Algorithms operate on [data structures](#data-structures). + +#### Examples + +You've already seen and used some important types of algorithms in your iOS projects: + +* **Sorting** an array + + ```objc + [@[@"c", @"b", @"a"] sortedArrayUsingSelector:@selector(caseInsensitiveCompare:)] + // -> @[@"a", @"b", @"c"] + ``` +* **Searching** for the index of an object in an array + + ```objc + [@[@"a", @"b", @"c"] indexOfObject:@"b"] + // -> 1 + ``` +* **Inserting** and **accessing** objects in a dictionary (using **hashing**) + + ```objc + NSMutableDictionary *dict = [NSMutableDictionary dictionary]; + dict[@"key"] = @"value"; + dict[@"key"] + // -> @"value" + ``` + +Here's a sampling of some of the most important algorithms (or types of algorithms) in use today: + +* [Sorting](https://en.wikipedia.org/wiki/Sorting_algorithm) + * [Sorting Algorithm Visualizations](http://www.sorting-algorithms.com/) +* [Fourier Transform](https://en.wikipedia.org/wiki/Fourier_transform) + * [What is a Fourier transform? What is it used for?](http://www.askamathematician.com/2012/09/q-what-is-a-fourier-transform-what-is-it-used-for/) + * [An Interactive Guide To The Fourier Transform](http://betterexplained.com/articles/an-interactive-guide-to-the-fourier-transform/) +* [Dijkstra’s algorithm](https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm) + * [Example Networks1: Dijkstra's Algorithm for Shortest Route Problems](http://optlab-server.sce.carleton.ca/POAnimations2007/DijkstrasAlgo.html) +* [RSA](https://en.wikipedia.org/wiki/RSA_(cryptosystem)) + * [Public-Key Encryption by RSA Algorithm](http://logos.cs.uic.edu/340%20notes/rsa.html) +* [SHA](https://en.wikipedia.org/wiki/Secure_Hash_Algorithm) +* [PageRank](https://en.wikipedia.org/wiki/PageRank) + * [Exploration of the Google PageRank Algorithm](https://bebffd479efdabe8c274b02b19ae9140ad412589.googledrive.com/host/0B2GQktu-wcTiaWw5OFVqT1k3bDA/) +* [Proportional Integral Derivative Algorithm](https://en.wikipedia.org/wiki/PID_controller) + * [PID for Dummies](http://www.csimn.com/CSI_pages/PIDforDummies.html) +* [Data Compression](https://en.wikipedia.org/wiki/Data_compression) + * [Huffman coding](https://en.wikipedia.org/wiki/Huffman_coding) + * [Huffman Coding Tree Visualization](http://algoviz.org/OpenDSA/AV/Binary/huffmanBuildAV.html) +* [Random Number Generation](https://en.wikipedia.org/wiki/Pseudorandom_number_generator) + +#### Resources + +* [The real 10 algorithms that dominate our world](https://medium.com/@_marcos_otero/the-real-10-algorithms-that-dominate-our-world-e95fa9f16c04#.h329od9yw) +* [How Google Search Works](http://www.google.com/intl/en_us/insidesearch/howsearchworks/thestory/) + +### Data Structures + +According to [Wikipedia](https://en.wikipedia.org/wiki/Data_structure), “a data structure is a particular way of organizing data in a computer so that it can be used **efficiently**” (emphasis added). + +Here are some common operations that data structures typically support: + +|Operation|Description| +|---|---| +|Insert|add an element| +|Access|get an element| +|Delete|remove an element| +|Search|find a specific element| +|Sort|reorder elements| + +Depending on the particular structure in question, some of these operations may not apply. For example, it does not make sense to sort a hash table. + +#### Comparison Chart + +Here's a rough comparison of some of the most common data structures. Note the similarities and differences, and consider how a data structure's underlying implementation might affect its performance characteristics. + +|Data Structure|Fast|Slow|Other| +|---|---|---|---| +|Array|insert, access|search, delete|fixed size| +|Array (Sorted)|access, search|insert, delete|"| +|Linked List|insert, delete|search|discontiguous| +|Stack|[LIFO](https://en.wikipedia.org/wiki/LIFO) access|all other access|| +|Queue|[FIFO](https://en.wikipedia.org/wiki/FIFO) access|"|| +|Hash Table|insert, keyed access|search|| +|Binary Tree|insert, delete, search||needs balancing| +|Graph||complex algorithms|best models real-world problems| + +[Source](http://www.idevelopment.info/data/Programming/data_structures/overview/Data_Structures_Algorithms_Introduction.shtml) + +#### Resources + +* [Real-Life Examples of Data Structures (PDF)](http://www.cs.cornell.edu/courses/CS2110/2014sp/L09-Lists/data_structures.pdf) From 93cea183ad326f79bf9108264e46aff3c8ff44fe Mon Sep 17 00:00:00 2001 From: Cameron Spickert Date: Thu, 7 Jan 2016 12:12:42 -0500 Subject: [PATCH 085/126] Update 2016_01_07.md --- lessons/week-0/2016_01_07.md | 1 + 1 file changed, 1 insertion(+) diff --git a/lessons/week-0/2016_01_07.md b/lessons/week-0/2016_01_07.md index 1aaa620..2c40e57 100644 --- a/lessons/week-0/2016_01_07.md +++ b/lessons/week-0/2016_01_07.md @@ -66,6 +66,7 @@ Here's a sampling of some of the most important algorithms (or types of algorith * [The real 10 algorithms that dominate our world](https://medium.com/@_marcos_otero/the-real-10-algorithms-that-dominate-our-world-e95fa9f16c04#.h329od9yw) * [How Google Search Works](http://www.google.com/intl/en_us/insidesearch/howsearchworks/thestory/) +* [VisuAlgo](http://visualgo.net/) ### Data Structures From 0c83e1358291238d0f004f8b499336f8f0845eb0 Mon Sep 17 00:00:00 2001 From: benstone1 Date: Thu, 7 Jan 2016 19:20:44 -0500 Subject: [PATCH 086/126] Update README.md --- README.md | 1 + 1 file changed, 1 insertion(+) diff --git a/README.md b/README.md index 50d62ec..af20f28 100644 --- a/README.md +++ b/README.md @@ -23,3 +23,4 @@ Due Date | Homework | Submission Format | Solution | |---|---|---|---| 1/11/16 at 12:00 am | [Submit links to updated GitHub, LinkedIn and Resume](https://docs.google.com/document/d/1Y6oAzxDa_K0_0_Mz_S-O5w0LJ5eJUuL4iODAH9Fj2FQ/edit?usp=sharing) | [Link to Google Form](http://goo.gl/forms/KUfBPRHQBr) | x +1/09/16 at 12:00 am | [Data Structures Worksheet]() | [Link to Google Form]() | x From 169620bd7a96c14d22ebd146a9422899253d3080 Mon Sep 17 00:00:00 2001 From: benstone1 Date: Fri, 8 Jan 2016 10:11:25 -0500 Subject: [PATCH 087/126] Update README.md --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index af20f28..ed061a5 100644 --- a/README.md +++ b/README.md @@ -23,4 +23,4 @@ Due Date | Homework | Submission Format | Solution | |---|---|---|---| 1/11/16 at 12:00 am | [Submit links to updated GitHub, LinkedIn and Resume](https://docs.google.com/document/d/1Y6oAzxDa_K0_0_Mz_S-O5w0LJ5eJUuL4iODAH9Fj2FQ/edit?usp=sharing) | [Link to Google Form](http://goo.gl/forms/KUfBPRHQBr) | x -1/09/16 at 12:00 am | [Data Structures Worksheet]() | [Link to Google Form]() | x +1/09/16 at 12:00 am | [Data Structures Worksheet](http://www.cs.cornell.edu/courses/CS2110/2014sp/L09-Lists/data_structures.pdf) | [Link to Google Form](https://docs.google.com/a/c4q.nyc/forms/d/1qGLpV_eLZv6a-zrS6dHEQqwPv4QbpBSh646XNqa55Ps/viewform) | x From aa8798274a308398d137702f32df4bb2bc2c7866 Mon Sep 17 00:00:00 2001 From: benstone1 Date: Mon, 11 Jan 2016 11:33:21 -0500 Subject: [PATCH 088/126] Update README.md --- README.md | 2 ++ 1 file changed, 2 insertions(+) diff --git a/README.md b/README.md index ed061a5..9864251 100644 --- a/README.md +++ b/README.md @@ -24,3 +24,5 @@ |---|---|---|---| 1/11/16 at 12:00 am | [Submit links to updated GitHub, LinkedIn and Resume](https://docs.google.com/document/d/1Y6oAzxDa_K0_0_Mz_S-O5w0LJ5eJUuL4iODAH9Fj2FQ/edit?usp=sharing) | [Link to Google Form](http://goo.gl/forms/KUfBPRHQBr) | x 1/09/16 at 12:00 am | [Data Structures Worksheet](http://www.cs.cornell.edu/courses/CS2110/2014sp/L09-Lists/data_structures.pdf) | [Link to Google Form](https://docs.google.com/a/c4q.nyc/forms/d/1qGLpV_eLZv6a-zrS6dHEQqwPv4QbpBSh646XNqa55Ps/viewform) | x +1/14/16 at 12:00 am | [MVC and Unit 0 Swift](/404) | Submission Form | x | +1/14/16 at 12:00 am | [Big O notation](https://docs.google.com/document/d/1aF1imJUVahCSJAuN1OEm5lQXwpSFaAmVmAETKMM6PLQ/edit#heading=h.za36ai6n5fth) | [Link to Google Form](http://goo.gl/forms/OKnVou1iTm) | x From 8156b14070b7c61be74f5d6aa3710c51aa7924ee Mon Sep 17 00:00:00 2001 From: benstone1 Date: Mon, 11 Jan 2016 11:38:30 -0500 Subject: [PATCH 089/126] Update README.md --- README.md | 12 ++++++------ 1 file changed, 6 insertions(+), 6 deletions(-) diff --git a/README.md b/README.md index 9864251..fb11654 100644 --- a/README.md +++ b/README.md @@ -1,20 +1,20 @@ ###Unit 4 Schedule -|Week|Day|Date|Activity|Instructor|Non-technical| +|Week|Day|Date|Activity|Instructor|Exit Ticket| |---|---|---|---|---|---| -|0|Tuesday|01/05|[How to frame Access Code + Intro to Swift](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_05.md)| |x| +|0|Tuesday|01/05|[How to frame Access Code + Intro to Swift](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_05.md) (non-technical) | |x| |0|Thursday|01/07|[Intro to data structures / algorithms](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_07.md)|Cameron| | |0|Saturday|01/09|[Recap unit 0 in Swift + MVC](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_09.md)|Linus| | |0|Sunday|01/10|[iOS Personal Project + Big O](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_10.md)|Caleb| | -|1|Tuesday|01/12|[Technical Pathways with Dion and Job materials (workshop)](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_12.md)| | x| +|1|Tuesday|01/12|[Technical Pathways with Dion and Job materials (workshop)](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_12.md) (non-technical) | | x| |1|Thursday|01/14|[Discrete Math and Logic](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_14.md)|Cameron| | |1|Saturday|01/16|[Lists + Sorts](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_16.md)|Linus| | |1|Sunday|01/17|[Sorts + Assessment](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_17.md)|Caleb| | -|2|Tuesday|01/19|[Behavioral interview questions (workshop)](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_19.md)| |x| +|2|Tuesday|01/19|[Behavioral interview questions (workshop)](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_19.md) (non-technical) | |x| |2|Thursday|01/21|[Intro to Stack + Heap (memory)](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_21.md)|Cameron| | -|2|Friday|01/22|LinkedIn profile workshop @ LinkedIn| |x| +|2|Friday|01/22|LinkedIn profile workshop @ LinkedIn (non-technical) | |x| |2|Saturday|01/23|[Quick Sort + Recursion](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_23.md)|Linus| | |2|Sunday|01/24|[Merge Sort + Exercises](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-2/2016_01_24.md)|Caleb| | -|3|Tuesday|01/26|[Entrepreneurship Talk](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_26.md)| |x| +|3|Tuesday|01/26|[Entrepreneurship Talk](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_26.md) (non-technical) | |x| |3|Thursday|01/28|[Linked Lists, Stacks + Queues](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_28.md)|Cameron| | |3|Saturday|01/30|[Sets + Hashmaps](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_30.md)|Linus| | |3|Sunday|01/31|[Exercises + Assessment](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-3/2016_01_31.md)|Caleb| | From 12bd4e232da3c0bc7a1f36a519ebb7e1feaf9c4b Mon Sep 17 00:00:00 2001 From: benstone1 Date: Mon, 11 Jan 2016 11:41:43 -0500 Subject: [PATCH 090/126] Update README.md --- README.md | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/README.md b/README.md index fb11654..ac37fb0 100644 --- a/README.md +++ b/README.md @@ -1,10 +1,10 @@ ###Unit 4 Schedule |Week|Day|Date|Activity|Instructor|Exit Ticket| |---|---|---|---|---|---| -|0|Tuesday|01/05|[How to frame Access Code + Intro to Swift](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_05.md) (non-technical) | |x| -|0|Thursday|01/07|[Intro to data structures / algorithms](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_07.md)|Cameron| | -|0|Saturday|01/09|[Recap unit 0 in Swift + MVC](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_09.md)|Linus| | -|0|Sunday|01/10|[iOS Personal Project + Big O](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_10.md)|Caleb| | +|0|Tuesday|01/05|[How to frame Access Code + Intro to Swift](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_05.md) (non-technical) |[Exit Ticket](https://docs.google.com/forms/d/1CuY-UFTL3CULwPOWfqFoG4LuEHPAi2iB3ZoJsGTat44/viewform)| +|0|Thursday|01/07|[Intro to data structures / algorithms](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_07.md)|Cameron| [Exit Ticket](https://docs.google.com/a/c4q.nyc/forms/d/1FfZbLI9WP5ohJssEeZQk7aQSc5suKmMe6K21xpEENWg/viewform) +|0|Saturday|01/09|[Recap unit 0 in Swift + MVC](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_09.md)|Linus| [Exit Ticket](https://docs.google.com/forms/d/1ZtOgbNZqI-0KXzmuvebMudQS5EvoOQJ8EZu3J6J8Fuk/viewform) | +|0|Sunday|01/10|[iOS Personal Project + Big O](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_10.md)|Caleb| [Exit Ticket](https://docs.google.com/forms/d/1RbMowGnkMUOXTfbt5CElW4cfwkTlyVKX9K2tT1xm8ZY/viewform) | |1|Tuesday|01/12|[Technical Pathways with Dion and Job materials (workshop)](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_12.md) (non-technical) | | x| |1|Thursday|01/14|[Discrete Math and Logic](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_14.md)|Cameron| | |1|Saturday|01/16|[Lists + Sorts](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_16.md)|Linus| | From c9a6444c0341cdb886ea455247a6e3e4e4c816cb Mon Sep 17 00:00:00 2001 From: benstone1 Date: Mon, 11 Jan 2016 11:43:14 -0500 Subject: [PATCH 091/126] Update README.md --- README.md | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) diff --git a/README.md b/README.md index ac37fb0..1bcfcf5 100644 --- a/README.md +++ b/README.md @@ -1,10 +1,10 @@ ###Unit 4 Schedule -|Week|Day|Date|Activity|Instructor|Exit Ticket| +|Week|Day|Date|Activity|Instructor|Exit Ticket Link| |---|---|---|---|---|---| -|0|Tuesday|01/05|[How to frame Access Code + Intro to Swift](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_05.md) (non-technical) |[Exit Ticket](https://docs.google.com/forms/d/1CuY-UFTL3CULwPOWfqFoG4LuEHPAi2iB3ZoJsGTat44/viewform)| -|0|Thursday|01/07|[Intro to data structures / algorithms](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_07.md)|Cameron| [Exit Ticket](https://docs.google.com/a/c4q.nyc/forms/d/1FfZbLI9WP5ohJssEeZQk7aQSc5suKmMe6K21xpEENWg/viewform) -|0|Saturday|01/09|[Recap unit 0 in Swift + MVC](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_09.md)|Linus| [Exit Ticket](https://docs.google.com/forms/d/1ZtOgbNZqI-0KXzmuvebMudQS5EvoOQJ8EZu3J6J8Fuk/viewform) | -|0|Sunday|01/10|[iOS Personal Project + Big O](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_10.md)|Caleb| [Exit Ticket](https://docs.google.com/forms/d/1RbMowGnkMUOXTfbt5CElW4cfwkTlyVKX9K2tT1xm8ZY/viewform) | +|0|Tuesday|01/05|[How to frame Access Code + Intro to Swift](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_05.md) (non-technical) |[Intro to Swift](https://docs.google.com/forms/d/1CuY-UFTL3CULwPOWfqFoG4LuEHPAi2iB3ZoJsGTat44/viewform)| +|0|Thursday|01/07|[Intro to data structures / algorithms](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_07.md)|Cameron| [Data Structures/Algorithms](https://docs.google.com/a/c4q.nyc/forms/d/1FfZbLI9WP5ohJssEeZQk7aQSc5suKmMe6K21xpEENWg/viewform) +|0|Saturday|01/09|[Recap unit 0 in Swift + MVC](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_09.md)|Linus| [MVC + Swift](https://docs.google.com/forms/d/1ZtOgbNZqI-0KXzmuvebMudQS5EvoOQJ8EZu3J6J8Fuk/viewform) | +|0|Sunday|01/10|[iOS Personal Project + Big O](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-0/2016_01_10.md)|Caleb| [Big O](https://docs.google.com/forms/d/1RbMowGnkMUOXTfbt5CElW4cfwkTlyVKX9K2tT1xm8ZY/viewform) | |1|Tuesday|01/12|[Technical Pathways with Dion and Job materials (workshop)](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_12.md) (non-technical) | | x| |1|Thursday|01/14|[Discrete Math and Logic](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_14.md)|Cameron| | |1|Saturday|01/16|[Lists + Sorts](https://github.com/accesscode-2-2/unit-4/blob/master/lessons/week-1/2016_01_16.md)|Linus| | From 4a8d2572b5fd3273af5317f9b38f4943677769a9 Mon Sep 17 00:00:00 2001 From: benstone1 Date: Mon, 11 Jan 2016 12:18:45 -0500 Subject: [PATCH 092/126] Update README.md --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 1bcfcf5..1741c1a 100644 --- a/README.md +++ b/README.md @@ -24,5 +24,5 @@ |---|---|---|---| 1/11/16 at 12:00 am | [Submit links to updated GitHub, LinkedIn and Resume](https://docs.google.com/document/d/1Y6oAzxDa_K0_0_Mz_S-O5w0LJ5eJUuL4iODAH9Fj2FQ/edit?usp=sharing) | [Link to Google Form](http://goo.gl/forms/KUfBPRHQBr) | x 1/09/16 at 12:00 am | [Data Structures Worksheet](http://www.cs.cornell.edu/courses/CS2110/2014sp/L09-Lists/data_structures.pdf) | [Link to Google Form](https://docs.google.com/a/c4q.nyc/forms/d/1qGLpV_eLZv6a-zrS6dHEQqwPv4QbpBSh646XNqa55Ps/viewform) | x -1/14/16 at 12:00 am | [MVC and Unit 0 Swift](/404) | Submission Form | x | +1/14/16 at 12:00 am | [MVC and Unit 0 Swift](https://docs.google.com/document/d/1DQ2aCJ_yUZtazzCfb0PaS81bg61V2ZOSxpABh981xSo/edit) | [Link to Google Form](http://goo.gl/forms/pRH1QGa2Wm) | x | 1/14/16 at 12:00 am | [Big O notation](https://docs.google.com/document/d/1aF1imJUVahCSJAuN1OEm5lQXwpSFaAmVmAETKMM6PLQ/edit#heading=h.za36ai6n5fth) | [Link to Google Form](http://goo.gl/forms/OKnVou1iTm) | x From 3e2913fe85248ab60b4d57592b61812aa631cd10 Mon Sep 17 00:00:00 2001 From: benstone1 Date: Mon, 11 Jan 2016 12:35:11 -0500 Subject: [PATCH 093/126] Update 2016_01_10.md --- lessons/week-0/2016_01_10.md | 19 ++++++++++++++++++- 1 file changed, 18 insertions(+), 1 deletion(-) diff --git a/lessons/week-0/2016_01_10.md b/lessons/week-0/2016_01_10.md index c2c7c0b..6c5ccb4 100644 --- a/lessons/week-0/2016_01_10.md +++ b/lessons/week-0/2016_01_10.md @@ -1,5 +1,22 @@ ## Instructor Caleb +##Standards +Relate fundamental computer science principles + ## Objectives -Exercises +Developers will be able to: +-Understand the parameters of their independent project (Mike leads this section) +-Understand the derivation of runtime complexity from a given code segment +-Explain a scenario that would run in a given runtime +-O(1), O(log n), O(n log n), O(n^2), O(n!) +-Given a piece of code, identify its runtime +-Code a solution to a problem and identify the runtime of the solution + +##Exercizes +[Link to Big O exercizes](https://docs.google.com/document/d/1YQWun-aqNaKftjKBAXyG8F5xeU74FEvUYzmhNBuD3u8/edit?usp=sharing) + +##Class Notes +[Lecture Slides](https://docs.google.com/presentation/d/1iMOysVQEV12g8SD3m1YQ4IZWQpSxoeKbQEUJ_Hz27YU/edit?usp=sharing) + +[Passion Project Details](https://docs.google.com/presentation/d/1Sb6IoD3f842WGugSJZ1s7-4EHgPEdH5RHiT3-H0TI2A/edit?usp=sharing) From 2e9ff804d9fb44fdf99b7e8eafda74fb006f4078 Mon Sep 17 00:00:00 2001 From: benstone1 Date: Mon, 11 Jan 2016 12:35:56 -0500 Subject: [PATCH 094/126] Update 2016_01_10.md --- lessons/week-0/2016_01_10.md | 12 ++++++------ 1 file changed, 6 insertions(+), 6 deletions(-) diff --git a/lessons/week-0/2016_01_10.md b/lessons/week-0/2016_01_10.md index 6c5ccb4..d227144 100644 --- a/lessons/week-0/2016_01_10.md +++ b/lessons/week-0/2016_01_10.md @@ -6,12 +6,12 @@ Relate fundamental computer science principles ## Objectives Developers will be able to: --Understand the parameters of their independent project (Mike leads this section) --Understand the derivation of runtime complexity from a given code segment --Explain a scenario that would run in a given runtime --O(1), O(log n), O(n log n), O(n^2), O(n!) --Given a piece of code, identify its runtime --Code a solution to a problem and identify the runtime of the solution +* Understand the parameters of their independent project (Mike leads this section) +* Understand the derivation of runtime complexity from a given code segment +* Explain a scenario that would run in a given runtime +* O(1), O(log n), O(n log n), O(n^2), O(n!) +* Given a piece of code, identify its runtime +* Code a solution to a problem and identify the runtime of the solution ##Exercizes [Link to Big O exercizes](https://docs.google.com/document/d/1YQWun-aqNaKftjKBAXyG8F5xeU74FEvUYzmhNBuD3u8/edit?usp=sharing) From c495398d1746985dbe885241536808368748dcd8 Mon Sep 17 00:00:00 2001 From: benstone1 Date: Mon, 11 Jan 2016 12:36:39 -0500 Subject: [PATCH 095/126] Update 2016_01_10.md --- lessons/week-0/2016_01_10.md | 3 +-- 1 file changed, 1 insertion(+), 2 deletions(-) diff --git a/lessons/week-0/2016_01_10.md b/lessons/week-0/2016_01_10.md index d227144..0113017 100644 --- a/lessons/week-0/2016_01_10.md +++ b/lessons/week-0/2016_01_10.md @@ -8,8 +8,7 @@ Relate fundamental computer science principles Developers will be able to: * Understand the parameters of their independent project (Mike leads this section) * Understand the derivation of runtime complexity from a given code segment -* Explain a scenario that would run in a given runtime -* O(1), O(log n), O(n log n), O(n^2), O(n!) +* Explain a scenario that would run in a given runtime (e.g O(1), O(log n), O(n log n), O(n^2), O(n!) ) * Given a piece of code, identify its runtime * Code a solution to a problem and identify the runtime of the solution From c55bdd5f3025e652d3c64d9557b7cdcdaf0ef8dd Mon Sep 17 00:00:00 2001 From: benstone1 Date: Mon, 11 Jan 2016 12:41:50 -0500 Subject: [PATCH 096/126] Update 2016_01_09.md --- lessons/week-0/2016_01_09.md | 36 +++++++++++++++++++++++++++++++----- 1 file changed, 31 insertions(+), 5 deletions(-) diff --git a/lessons/week-0/2016_01_09.md b/lessons/week-0/2016_01_09.md index 1921df5..f6d841f 100644 --- a/lessons/week-0/2016_01_09.md +++ b/lessons/week-0/2016_01_09.md @@ -1,8 +1,34 @@ ## Instructor Linus -## Objective -* What is a data structure? -* What is an object? (pass by reference vs. pass by value) -* How are data structure defined relative to oop (Is a data structure an object? Is an object a data structure?) -difference between class and object? +##Standards +* Program in Java, Obj-C, and/or Swift code +* Deliver well-written, robust source code +* Understand application architecture + + + +## Objectives +#Identify and describe language semantics/syntax (keywords, operators, etc.) +* Optionals + +#Cite common language conventions (naming, formatting, etc.) +* Local vs. external parameter value name +* Don’t use NS objects + +#Create algorithms in Swift to solve interview questions +* Understand the basics of object-oriented programing in Swift + +#MVC +* Explain MVC design: +* Explain what MVC is +* Explain why using MVC is beneficial +* Explain where different logic should be placed in code +* Create/Refactor code in MVC style +* Identify core modules/sections of an app and describe their relationships + +##Exercizes (also homework for this class) +[Algorithm practice](https://docs.google.com/document/d/1DQ2aCJ_yUZtazzCfb0PaS81bg61V2ZOSxpABh981xSo/edit) + +##Class notes +[Lecture slides](https://docs.google.com/presentation/d/1YdD4ZomPFJkzrjGpaGq4CaU7dykHG_WwDEKmNLkuXZk/edit?usp=sharing) From 143c62c9f0065efbbb9fd92d93d14da86f64e7bf Mon Sep 17 00:00:00 2001 From: benstone1 Date: Mon, 11 Jan 2016 12:42:10 -0500 Subject: [PATCH 097/126] Update 2016_01_09.md --- lessons/week-0/2016_01_09.md | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/lessons/week-0/2016_01_09.md b/lessons/week-0/2016_01_09.md index f6d841f..372792d 100644 --- a/lessons/week-0/2016_01_09.md +++ b/lessons/week-0/2016_01_09.md @@ -12,14 +12,14 @@ Linus #Identify and describe language semantics/syntax (keywords, operators, etc.) * Optionals -#Cite common language conventions (naming, formatting, etc.) +####Cite common language conventions (naming, formatting, etc.) * Local vs. external parameter value name * Don’t use NS objects -#Create algorithms in Swift to solve interview questions +####Create algorithms in Swift to solve interview questions * Understand the basics of object-oriented programing in Swift -#MVC +####MVC * Explain MVC design: * Explain what MVC is * Explain why using MVC is beneficial From 73b8cef280966f5cb50df37edb8dbe703c7fe9bf Mon Sep 17 00:00:00 2001 From: benstone1 Date: Mon, 11 Jan 2016 12:42:34 -0500 Subject: [PATCH 098/126] Update 2016_01_09.md --- lessons/week-0/2016_01_09.md | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/lessons/week-0/2016_01_09.md b/lessons/week-0/2016_01_09.md index 372792d..8637862 100644 --- a/lessons/week-0/2016_01_09.md +++ b/lessons/week-0/2016_01_09.md @@ -9,7 +9,8 @@ Linus ## Objectives -#Identify and describe language semantics/syntax (keywords, operators, etc.) + +####Identify and describe language semantics/syntax (keywords, operators, etc.) * Optionals ####Cite common language conventions (naming, formatting, etc.) From cceee0fb8c9c9b418d565b75ffe017f57d165510 Mon Sep 17 00:00:00 2001 From: benstone1 Date: Mon, 11 Jan 2016 13:06:26 -0500 Subject: [PATCH 099/126] Update README.md --- README.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/README.md b/README.md index 1741c1a..fb900a1 100644 --- a/README.md +++ b/README.md @@ -24,5 +24,5 @@ |---|---|---|---| 1/11/16 at 12:00 am | [Submit links to updated GitHub, LinkedIn and Resume](https://docs.google.com/document/d/1Y6oAzxDa_K0_0_Mz_S-O5w0LJ5eJUuL4iODAH9Fj2FQ/edit?usp=sharing) | [Link to Google Form](http://goo.gl/forms/KUfBPRHQBr) | x 1/09/16 at 12:00 am | [Data Structures Worksheet](http://www.cs.cornell.edu/courses/CS2110/2014sp/L09-Lists/data_structures.pdf) | [Link to Google Form](https://docs.google.com/a/c4q.nyc/forms/d/1qGLpV_eLZv6a-zrS6dHEQqwPv4QbpBSh646XNqa55Ps/viewform) | x -1/14/16 at 12:00 am | [MVC and Unit 0 Swift](https://docs.google.com/document/d/1DQ2aCJ_yUZtazzCfb0PaS81bg61V2ZOSxpABh981xSo/edit) | [Link to Google Form](http://goo.gl/forms/pRH1QGa2Wm) | x | -1/14/16 at 12:00 am | [Big O notation](https://docs.google.com/document/d/1aF1imJUVahCSJAuN1OEm5lQXwpSFaAmVmAETKMM6PLQ/edit#heading=h.za36ai6n5fth) | [Link to Google Form](http://goo.gl/forms/OKnVou1iTm) | x +1/14/16 at 12:00 am | [MVC and Unit 0 Swift](https://docs.google.com/document/d/1DQ2aCJ_yUZtazzCfb0PaS81bg61V2ZOSxpABh981xSo/edit) | [Fork this repo. Submit pull request when you have completed the assignments](https://github.com/accesscode-2-2/unit-4-assignments) | x | +1/14/16 at 12:00 am | [Big O notation](https://docs.google.com/document/d/1aF1imJUVahCSJAuN1OEm5lQXwpSFaAmVmAETKMM6PLQ/edit#heading=h.za36ai6n5fth) | [Fork this repo. Submit pull request when you have completed the assignments](https://github.com/accesscode-2-2/unit-4-assignments) | x From 632606d2b2aa22b380f2984049a77bf4d8f100ef Mon Sep 17 00:00:00 2001 From: benstone1 Date: Mon, 11 Jan 2016 13:13:02 -0500 Subject: [PATCH 100/126] Update README.md --- README.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/README.md b/README.md index fb900a1..ee4ca3a 100644 --- a/README.md +++ b/README.md @@ -24,5 +24,5 @@ |---|---|---|---| 1/11/16 at 12:00 am | [Submit links to updated GitHub, LinkedIn and Resume](https://docs.google.com/document/d/1Y6oAzxDa_K0_0_Mz_S-O5w0LJ5eJUuL4iODAH9Fj2FQ/edit?usp=sharing) | [Link to Google Form](http://goo.gl/forms/KUfBPRHQBr) | x 1/09/16 at 12:00 am | [Data Structures Worksheet](http://www.cs.cornell.edu/courses/CS2110/2014sp/L09-Lists/data_structures.pdf) | [Link to Google Form](https://docs.google.com/a/c4q.nyc/forms/d/1qGLpV_eLZv6a-zrS6dHEQqwPv4QbpBSh646XNqa55Ps/viewform) | x -1/14/16 at 12:00 am | [MVC and Unit 0 Swift](https://docs.google.com/document/d/1DQ2aCJ_yUZtazzCfb0PaS81bg61V2ZOSxpABh981xSo/edit) | [Fork this repo. Submit pull request when you have completed the assignments](https://github.com/accesscode-2-2/unit-4-assignments) | x | -1/14/16 at 12:00 am | [Big O notation](https://docs.google.com/document/d/1aF1imJUVahCSJAuN1OEm5lQXwpSFaAmVmAETKMM6PLQ/edit#heading=h.za36ai6n5fth) | [Fork this repo. Submit pull request when you have completed the assignments](https://github.com/accesscode-2-2/unit-4-assignments) | x +1/14/16 at 12:00 am | [MVC and Unit 0 Swift](https://docs.google.com/document/d/1DQ2aCJ_yUZtazzCfb0PaS81bg61V2ZOSxpABh981xSo/edit) | [Fork this repo. Push by the deadline](https://github.com/accesscode-2-2/unit-4-assignments) | x | +1/14/16 at 12:00 am | [Big O notation](https://docs.google.com/document/d/1aF1imJUVahCSJAuN1OEm5lQXwpSFaAmVmAETKMM6PLQ/edit#heading=h.za36ai6n5fth) | [Fork this repo. Push by the deadline](https://github.com/accesscode-2-2/unit-4-assignments) | x From 6ecbc1fb0c7125fe1894c2fc2e4a6ddb89c8d3a2 Mon Sep 17 00:00:00 2001 From: Fatima Date: Mon, 11 Jan 2016 16:10:37 -0500 Subject: [PATCH 101/126] 01-09 Homework from Saturday (Linus) --- .../Contents.swift | 77 +++++++++++++++++-- .../contents.xcplayground | 2 +- 2 files changed, 72 insertions(+), 7 deletions(-) diff --git a/HWfrom1-09-16(SwiftIntro).playground/Contents.swift b/HWfrom1-09-16(SwiftIntro).playground/Contents.swift index 488e9ed..70fbf8a 100644 --- a/HWfrom1-09-16(SwiftIntro).playground/Contents.swift +++ b/HWfrom1-09-16(SwiftIntro).playground/Contents.swift @@ -4,20 +4,85 @@ import UIKit var str = "Hello, playground" -/* +/*: Use the link here to get the questions. Then code your solutions below. If it does not require code, just write your answer in comments. https://docs.google.com/document/d/1DQ2aCJ_yUZtazzCfb0PaS81bg61V2ZOSxpABh981xSo/edit -1) +*/ -2) +//: ### 1 -3) +func findMissingNumber(N: Int, list: [Int]) -> Int { + list.sort({$0 < $1}) + var j = 0 + var missingNum = 0 -4) + for i in (0.. Int? { + let setOne = Set(listOne) + let setTwo = Set(listTwo) + let num = setOne.intersect(setTwo).minElement() + return num +} + +//: ### 4 + +struct Stack { + private var items:[T] + var count: Int { + get { + return items.count + } + } + + mutating func push(element: T) { + items.append(element) + } + + mutating func pop() -> T { + return items.removeLast() + } +} + +func isPalindrome(word: String) -> Bool { + var stack = Stack(items: Array(word.characters)) + var reverseStack = Stack(items: Array(word.characters).reverse()) + + for _ in 0.. - + \ No newline at end of file From fdef4249ed972cb25f388e58dcdf9b711453a077 Mon Sep 17 00:00:00 2001 From: Fatima Date: Mon, 11 Jan 2016 16:15:59 -0500 Subject: [PATCH 102/126] 01-10 Homework from Sunday (Caleb) --- .../Contents.swift | 6 +-- .../Contents.swift | 52 ++++++++++++++----- .../contents.xcplayground | 2 +- 3 files changed, 41 insertions(+), 19 deletions(-) diff --git a/HWfrom1-09-16(SwiftIntro).playground/Contents.swift b/HWfrom1-09-16(SwiftIntro).playground/Contents.swift index 70fbf8a..96fb921 100644 --- a/HWfrom1-09-16(SwiftIntro).playground/Contents.swift +++ b/HWfrom1-09-16(SwiftIntro).playground/Contents.swift @@ -1,8 +1,4 @@ -//: Playground - noun: a place where people can play - -import UIKit - -var str = "Hello, playground" +//: 01-09 Saturday Homework - Instructor: Linus /*: diff --git a/HWfrom1-10-016(BigO).playground/Contents.swift b/HWfrom1-10-016(BigO).playground/Contents.swift index 2040d38..938d133 100644 --- a/HWfrom1-10-016(BigO).playground/Contents.swift +++ b/HWfrom1-10-016(BigO).playground/Contents.swift @@ -1,30 +1,56 @@ -//: Playground - noun: a place where people can play +//: 01/10 Homework Sunday - Instructor: Caleb -import UIKit - -var str = "Hello, playground" - -/* +/*: Use the link here to get the questions. Then code your solutions below. If it does not require code, just write your answer in comments. https://docs.google.com/document/d/1aF1imJUVahCSJAuN1OEm5lQXwpSFaAmVmAETKMM6PLQ/edit#heading=h.za36ai6n5fth +*/ + +/*: + +### 1. +With my new top of the line XJ452 supercomputer, memory access takes 1 picosecond, math operations take 3 picoseconds, and storing data in memory takes 10 picoseconds. My friend wrote a filter that makes a pixel more awesome, and takes 200 picoseconds to run. +How long would my computer take to execute the following code if the input image is 1000px wide by 2000px tall? What if it’s n by m? -1) + `Pixel **awesomeFilter(Pixel image[][], int width, int height) { + for (int i = 0; i < width; i++) { + for (int j = 0; j < height; j++) { + [image[i][j] makeMoreAwesome]; + } + } + return image; + }` -2) +What is the time complexity of this method, expressed in big O notation? Assume the image is square, and both dimensions are ‘n’. -3) +My friend sends me an improved version of his algorithm, makeEvenMoreAwesome, that takes into account the pixels around the image. He says it’s O(n^2) in the amount of pixels in the image. What is the new time complexity of the method? -4) -5) -6) +#### 1a) +* 1000 * 2000 = 2,000,000 (image pixels) +* 3 + 10 + 1 = 14 picoseconds per pixel +* 200 picosends per pixel - awesome filter -7) +1. 200 + 14 = 214 picoseconds to run filter per pixel on my pc +2. 214 * 2,000,000 = 428,000,000 picoseconds to run an image of 1000 x 2000 +#### 1b) +* n * m = nm (image pixels) +* 3 + 10 + 1 = 14 picoseconds per pixel +* 200 picosends per pixel - awesome filter + +1. 200 + 14 = 214 picoseconds to run filter per pixel on my pc +2. 214 * nm = 214(nm) picoseconds to run an image of n x m + +#### 1c) +* O(n^2) + +#### 1d) +* O(n^4) */ + diff --git a/HWfrom1-10-016(BigO).playground/contents.xcplayground b/HWfrom1-10-016(BigO).playground/contents.xcplayground index 5da2641..89da2d4 100644 --- a/HWfrom1-10-016(BigO).playground/contents.xcplayground +++ b/HWfrom1-10-016(BigO).playground/contents.xcplayground @@ -1,4 +1,4 @@ - + \ No newline at end of file From 895d032d5c3644eb2a08a37e52f56f5ad404ef15 Mon Sep 17 00:00:00 2001 From: Fatima Date: Mon, 11 Jan 2016 16:16:44 -0500 Subject: [PATCH 103/126] 01-09 Homework from Saturday (Linus) --- HWfrom1-09-16(SwiftIntro).playground/Contents.swift | 1 - HWfrom1-09-16(SwiftIntro).playground/contents.xcplayground | 2 +- 2 files changed, 1 insertion(+), 2 deletions(-) diff --git a/HWfrom1-09-16(SwiftIntro).playground/Contents.swift b/HWfrom1-09-16(SwiftIntro).playground/Contents.swift index 96fb921..08b0d38 100644 --- a/HWfrom1-09-16(SwiftIntro).playground/Contents.swift +++ b/HWfrom1-09-16(SwiftIntro).playground/Contents.swift @@ -1,5 +1,4 @@ //: 01-09 Saturday Homework - Instructor: Linus - /*: Use the link here to get the questions. Then code your solutions below. If it does not require code, just write your answer in comments. diff --git a/HWfrom1-09-16(SwiftIntro).playground/contents.xcplayground b/HWfrom1-09-16(SwiftIntro).playground/contents.xcplayground index 89da2d4..3596865 100644 --- a/HWfrom1-09-16(SwiftIntro).playground/contents.xcplayground +++ b/HWfrom1-09-16(SwiftIntro).playground/contents.xcplayground @@ -1,4 +1,4 @@ - + \ No newline at end of file From 38a94b44e4b664a833cc1f2c58eec977168ddde5 Mon Sep 17 00:00:00 2001 From: benstone1 Date: Tue, 12 Jan 2016 10:15:09 -0500 Subject: [PATCH 104/126] Update README.md --- README.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/README.md b/README.md index ee4ca3a..7b32e13 100644 --- a/README.md +++ b/README.md @@ -24,5 +24,5 @@ |---|---|---|---| 1/11/16 at 12:00 am | [Submit links to updated GitHub, LinkedIn and Resume](https://docs.google.com/document/d/1Y6oAzxDa_K0_0_Mz_S-O5w0LJ5eJUuL4iODAH9Fj2FQ/edit?usp=sharing) | [Link to Google Form](http://goo.gl/forms/KUfBPRHQBr) | x 1/09/16 at 12:00 am | [Data Structures Worksheet](http://www.cs.cornell.edu/courses/CS2110/2014sp/L09-Lists/data_structures.pdf) | [Link to Google Form](https://docs.google.com/a/c4q.nyc/forms/d/1qGLpV_eLZv6a-zrS6dHEQqwPv4QbpBSh646XNqa55Ps/viewform) | x -1/14/16 at 12:00 am | [MVC and Unit 0 Swift](https://docs.google.com/document/d/1DQ2aCJ_yUZtazzCfb0PaS81bg61V2ZOSxpABh981xSo/edit) | [Fork this repo. Push by the deadline](https://github.com/accesscode-2-2/unit-4-assignments) | x | -1/14/16 at 12:00 am | [Big O notation](https://docs.google.com/document/d/1aF1imJUVahCSJAuN1OEm5lQXwpSFaAmVmAETKMM6PLQ/edit#heading=h.za36ai6n5fth) | [Fork this repo. Push by the deadline](https://github.com/accesscode-2-2/unit-4-assignments) | x +1/14/16 at 12:00 am | [MVC and Unit 0 Swift](https://docs.google.com/document/d/1DQ2aCJ_yUZtazzCfb0PaS81bg61V2ZOSxpABh981xSo/edit) | [Fork this repo. Push to your repo by the deadline](https://github.com/accesscode-2-2/unit-4-assignments) | x | +1/14/16 at 12:00 am | [Big O notation](https://docs.google.com/document/d/1aF1imJUVahCSJAuN1OEm5lQXwpSFaAmVmAETKMM6PLQ/edit#heading=h.za36ai6n5fth) | [Fork this repo. Push to your repo by the deadline](https://github.com/accesscode-2-2/unit-4-assignments) | x From b9124a8084111fe24c112e9dfa8736fdfd72f161 Mon Sep 17 00:00:00 2001 From: benstone1 Date: Tue, 12 Jan 2016 15:08:30 -0500 Subject: [PATCH 105/126] Update README.md --- README.md | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/README.md b/README.md index 7b32e13..533e4b6 100644 --- a/README.md +++ b/README.md @@ -22,7 +22,7 @@ ### Homework Due Date | Homework | Submission Format | Solution | |---|---|---|---| -1/11/16 at 12:00 am | [Submit links to updated GitHub, LinkedIn and Resume](https://docs.google.com/document/d/1Y6oAzxDa_K0_0_Mz_S-O5w0LJ5eJUuL4iODAH9Fj2FQ/edit?usp=sharing) | [Link to Google Form](http://goo.gl/forms/KUfBPRHQBr) | x -1/09/16 at 12:00 am | [Data Structures Worksheet](http://www.cs.cornell.edu/courses/CS2110/2014sp/L09-Lists/data_structures.pdf) | [Link to Google Form](https://docs.google.com/a/c4q.nyc/forms/d/1qGLpV_eLZv6a-zrS6dHEQqwPv4QbpBSh646XNqa55Ps/viewform) | x -1/14/16 at 12:00 am | [MVC and Unit 0 Swift](https://docs.google.com/document/d/1DQ2aCJ_yUZtazzCfb0PaS81bg61V2ZOSxpABh981xSo/edit) | [Fork this repo. Push to your repo by the deadline](https://github.com/accesscode-2-2/unit-4-assignments) | x | -1/14/16 at 12:00 am | [Big O notation](https://docs.google.com/document/d/1aF1imJUVahCSJAuN1OEm5lQXwpSFaAmVmAETKMM6PLQ/edit#heading=h.za36ai6n5fth) | [Fork this repo. Push to your repo by the deadline](https://github.com/accesscode-2-2/unit-4-assignments) | x +1/11/16 at 12:01 am | [Submit links to updated GitHub, LinkedIn and Resume](https://docs.google.com/document/d/1Y6oAzxDa_K0_0_Mz_S-O5w0LJ5eJUuL4iODAH9Fj2FQ/edit?usp=sharing) | [Link to Google Form](http://goo.gl/forms/KUfBPRHQBr) | x +1/09/16 at 12:01 am | [Data Structures Worksheet](http://www.cs.cornell.edu/courses/CS2110/2014sp/L09-Lists/data_structures.pdf) | [Link to Google Form](https://docs.google.com/a/c4q.nyc/forms/d/1qGLpV_eLZv6a-zrS6dHEQqwPv4QbpBSh646XNqa55Ps/viewform) | x +1/14/16 at 12:01 am | [MVC and Unit 0 Swift](https://docs.google.com/document/d/1DQ2aCJ_yUZtazzCfb0PaS81bg61V2ZOSxpABh981xSo/edit) | [Fork this repo. Push to your repo by the deadline](https://github.com/accesscode-2-2/unit-4-assignments) | x | +1/14/16 at 12:01 am | [Big O notation](https://docs.google.com/document/d/1aF1imJUVahCSJAuN1OEm5lQXwpSFaAmVmAETKMM6PLQ/edit#heading=h.za36ai6n5fth) | [Fork this repo. Push to your repo by the deadline](https://github.com/accesscode-2-2/unit-4-assignments) | x From 1440b3db3a8d2612478d442718779d6b5f84dacd Mon Sep 17 00:00:00 2001 From: benstone1 Date: Tue, 12 Jan 2016 17:19:23 -0500 Subject: [PATCH 106/126] Update README.md --- README.md | 1 + 1 file changed, 1 insertion(+) diff --git a/README.md b/README.md index 533e4b6..3a5a5b1 100644 --- a/README.md +++ b/README.md @@ -24,5 +24,6 @@ |---|---|---|---| 1/11/16 at 12:01 am | [Submit links to updated GitHub, LinkedIn and Resume](https://docs.google.com/document/d/1Y6oAzxDa_K0_0_Mz_S-O5w0LJ5eJUuL4iODAH9Fj2FQ/edit?usp=sharing) | [Link to Google Form](http://goo.gl/forms/KUfBPRHQBr) | x 1/09/16 at 12:01 am | [Data Structures Worksheet](http://www.cs.cornell.edu/courses/CS2110/2014sp/L09-Lists/data_structures.pdf) | [Link to Google Form](https://docs.google.com/a/c4q.nyc/forms/d/1qGLpV_eLZv6a-zrS6dHEQqwPv4QbpBSh646XNqa55Ps/viewform) | x +1/12/16 at 10:00 pm | [Passion Project Setup](https://docs.google.com/presentation/d/1Sb6IoD3f842WGugSJZ1s7-4EHgPEdH5RHiT3-H0TI2A/edit#slide=id.gecfcc994a_0_10) | [Link to Google Form](http://goo.gl/forms/qU6GQ8b3pZ) | x 1/14/16 at 12:01 am | [MVC and Unit 0 Swift](https://docs.google.com/document/d/1DQ2aCJ_yUZtazzCfb0PaS81bg61V2ZOSxpABh981xSo/edit) | [Fork this repo. Push to your repo by the deadline](https://github.com/accesscode-2-2/unit-4-assignments) | x | 1/14/16 at 12:01 am | [Big O notation](https://docs.google.com/document/d/1aF1imJUVahCSJAuN1OEm5lQXwpSFaAmVmAETKMM6PLQ/edit#heading=h.za36ai6n5fth) | [Fork this repo. Push to your repo by the deadline](https://github.com/accesscode-2-2/unit-4-assignments) | x From abac3683035bb2ee936c1d698e26afbef346354e Mon Sep 17 00:00:00 2001 From: benstone1 Date: Tue, 12 Jan 2016 17:20:03 -0500 Subject: [PATCH 107/126] Update README.md --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 3a5a5b1..247b607 100644 --- a/README.md +++ b/README.md @@ -22,8 +22,8 @@ ### Homework Due Date | Homework | Submission Format | Solution | |---|---|---|---| -1/11/16 at 12:01 am | [Submit links to updated GitHub, LinkedIn and Resume](https://docs.google.com/document/d/1Y6oAzxDa_K0_0_Mz_S-O5w0LJ5eJUuL4iODAH9Fj2FQ/edit?usp=sharing) | [Link to Google Form](http://goo.gl/forms/KUfBPRHQBr) | x 1/09/16 at 12:01 am | [Data Structures Worksheet](http://www.cs.cornell.edu/courses/CS2110/2014sp/L09-Lists/data_structures.pdf) | [Link to Google Form](https://docs.google.com/a/c4q.nyc/forms/d/1qGLpV_eLZv6a-zrS6dHEQqwPv4QbpBSh646XNqa55Ps/viewform) | x +1/11/16 at 12:01 am | [Submit links to updated GitHub, LinkedIn and Resume](https://docs.google.com/document/d/1Y6oAzxDa_K0_0_Mz_S-O5w0LJ5eJUuL4iODAH9Fj2FQ/edit?usp=sharing) | [Link to Google Form](http://goo.gl/forms/KUfBPRHQBr) | x 1/12/16 at 10:00 pm | [Passion Project Setup](https://docs.google.com/presentation/d/1Sb6IoD3f842WGugSJZ1s7-4EHgPEdH5RHiT3-H0TI2A/edit#slide=id.gecfcc994a_0_10) | [Link to Google Form](http://goo.gl/forms/qU6GQ8b3pZ) | x 1/14/16 at 12:01 am | [MVC and Unit 0 Swift](https://docs.google.com/document/d/1DQ2aCJ_yUZtazzCfb0PaS81bg61V2ZOSxpABh981xSo/edit) | [Fork this repo. Push to your repo by the deadline](https://github.com/accesscode-2-2/unit-4-assignments) | x | 1/14/16 at 12:01 am | [Big O notation](https://docs.google.com/document/d/1aF1imJUVahCSJAuN1OEm5lQXwpSFaAmVmAETKMM6PLQ/edit#heading=h.za36ai6n5fth) | [Fork this repo. Push to your repo by the deadline](https://github.com/accesscode-2-2/unit-4-assignments) | x From 4c2bac5b42736515db3ff83b11d5183e5c7e9245 Mon Sep 17 00:00:00 2001 From: benstone1 Date: Wed, 13 Jan 2016 10:39:26 -0500 Subject: [PATCH 108/126] Update README.md --- README.md | 1 + 1 file changed, 1 insertion(+) diff --git a/README.md b/README.md index 247b607..87d29b4 100644 --- a/README.md +++ b/README.md @@ -27,3 +27,4 @@ 1/12/16 at 10:00 pm | [Passion Project Setup](https://docs.google.com/presentation/d/1Sb6IoD3f842WGugSJZ1s7-4EHgPEdH5RHiT3-H0TI2A/edit#slide=id.gecfcc994a_0_10) | [Link to Google Form](http://goo.gl/forms/qU6GQ8b3pZ) | x 1/14/16 at 12:01 am | [MVC and Unit 0 Swift](https://docs.google.com/document/d/1DQ2aCJ_yUZtazzCfb0PaS81bg61V2ZOSxpABh981xSo/edit) | [Fork this repo. Push to your repo by the deadline](https://github.com/accesscode-2-2/unit-4-assignments) | x | 1/14/16 at 12:01 am | [Big O notation](https://docs.google.com/document/d/1aF1imJUVahCSJAuN1OEm5lQXwpSFaAmVmAETKMM6PLQ/edit#heading=h.za36ai6n5fth) | [Fork this repo. Push to your repo by the deadline](https://github.com/accesscode-2-2/unit-4-assignments) | x +1/19/16 at 12:01 am | Have a least 2 submission on your blog. Have a detailed README in your passion project repo that outlines the work you will be doing. | Complete this on the blog and repo you linked to on the Google Form | x From 4732607f3b164583c612cc51e2f55a8cd24faf89 Mon Sep 17 00:00:00 2001 From: benstone1 Date: Wed, 13 Jan 2016 12:15:26 -0500 Subject: [PATCH 109/126] Update README.md --- README.md | 1 + 1 file changed, 1 insertion(+) diff --git a/README.md b/README.md index 87d29b4..8572518 100644 --- a/README.md +++ b/README.md @@ -28,3 +28,4 @@ 1/14/16 at 12:01 am | [MVC and Unit 0 Swift](https://docs.google.com/document/d/1DQ2aCJ_yUZtazzCfb0PaS81bg61V2ZOSxpABh981xSo/edit) | [Fork this repo. Push to your repo by the deadline](https://github.com/accesscode-2-2/unit-4-assignments) | x | 1/14/16 at 12:01 am | [Big O notation](https://docs.google.com/document/d/1aF1imJUVahCSJAuN1OEm5lQXwpSFaAmVmAETKMM6PLQ/edit#heading=h.za36ai6n5fth) | [Fork this repo. Push to your repo by the deadline](https://github.com/accesscode-2-2/unit-4-assignments) | x 1/19/16 at 12:01 am | Have a least 2 submission on your blog. Have a detailed README in your passion project repo that outlines the work you will be doing. | Complete this on the blog and repo you linked to on the Google Form | x +1/19/16 at 12:01 am | Revise and resubmit your resume | Upload to the shared [Drive Folder](https://drive.google.com/drive/u/0/folders/0B61otWQVg7ApUFFjWkx6ZE9VOUU) | x From 8a142bcc31ccd9864b8fff3e1e9bff7f0a77398d Mon Sep 17 00:00:00 2001 From: benstone1 Date: Wed, 13 Jan 2016 12:15:58 -0500 Subject: [PATCH 110/126] Update README.md --- README.md | 14 +++++++------- 1 file changed, 7 insertions(+), 7 deletions(-) diff --git a/README.md b/README.md index 8572518..285af99 100644 --- a/README.md +++ b/README.md @@ -22,10 +22,10 @@ ### Homework Due Date | Homework | Submission Format | Solution | |---|---|---|---| -1/09/16 at 12:01 am | [Data Structures Worksheet](http://www.cs.cornell.edu/courses/CS2110/2014sp/L09-Lists/data_structures.pdf) | [Link to Google Form](https://docs.google.com/a/c4q.nyc/forms/d/1qGLpV_eLZv6a-zrS6dHEQqwPv4QbpBSh646XNqa55Ps/viewform) | x -1/11/16 at 12:01 am | [Submit links to updated GitHub, LinkedIn and Resume](https://docs.google.com/document/d/1Y6oAzxDa_K0_0_Mz_S-O5w0LJ5eJUuL4iODAH9Fj2FQ/edit?usp=sharing) | [Link to Google Form](http://goo.gl/forms/KUfBPRHQBr) | x -1/12/16 at 10:00 pm | [Passion Project Setup](https://docs.google.com/presentation/d/1Sb6IoD3f842WGugSJZ1s7-4EHgPEdH5RHiT3-H0TI2A/edit#slide=id.gecfcc994a_0_10) | [Link to Google Form](http://goo.gl/forms/qU6GQ8b3pZ) | x -1/14/16 at 12:01 am | [MVC and Unit 0 Swift](https://docs.google.com/document/d/1DQ2aCJ_yUZtazzCfb0PaS81bg61V2ZOSxpABh981xSo/edit) | [Fork this repo. Push to your repo by the deadline](https://github.com/accesscode-2-2/unit-4-assignments) | x | -1/14/16 at 12:01 am | [Big O notation](https://docs.google.com/document/d/1aF1imJUVahCSJAuN1OEm5lQXwpSFaAmVmAETKMM6PLQ/edit#heading=h.za36ai6n5fth) | [Fork this repo. Push to your repo by the deadline](https://github.com/accesscode-2-2/unit-4-assignments) | x -1/19/16 at 12:01 am | Have a least 2 submission on your blog. Have a detailed README in your passion project repo that outlines the work you will be doing. | Complete this on the blog and repo you linked to on the Google Form | x -1/19/16 at 12:01 am | Revise and resubmit your resume | Upload to the shared [Drive Folder](https://drive.google.com/drive/u/0/folders/0B61otWQVg7ApUFFjWkx6ZE9VOUU) | x +1/09/16, 12:01 am | [Data Structures Worksheet](http://www.cs.cornell.edu/courses/CS2110/2014sp/L09-Lists/data_structures.pdf) | [Link to Google Form](https://docs.google.com/a/c4q.nyc/forms/d/1qGLpV_eLZv6a-zrS6dHEQqwPv4QbpBSh646XNqa55Ps/viewform) | x +1/11/16, 12:01 am | [Submit links to updated GitHub, LinkedIn and Resume](https://docs.google.com/document/d/1Y6oAzxDa_K0_0_Mz_S-O5w0LJ5eJUuL4iODAH9Fj2FQ/edit?usp=sharing) | [Link to Google Form](http://goo.gl/forms/KUfBPRHQBr) | x +1/12/16, 10:00 pm | [Passion Project Setup](https://docs.google.com/presentation/d/1Sb6IoD3f842WGugSJZ1s7-4EHgPEdH5RHiT3-H0TI2A/edit#slide=id.gecfcc994a_0_10) | [Link to Google Form](http://goo.gl/forms/qU6GQ8b3pZ) | x +1/14/16, 12:01 am | [MVC and Unit 0 Swift](https://docs.google.com/document/d/1DQ2aCJ_yUZtazzCfb0PaS81bg61V2ZOSxpABh981xSo/edit) | [Fork this repo. Push to your repo by the deadline](https://github.com/accesscode-2-2/unit-4-assignments) | x | +1/14/16, 12:01 am | [Big O notation](https://docs.google.com/document/d/1aF1imJUVahCSJAuN1OEm5lQXwpSFaAmVmAETKMM6PLQ/edit#heading=h.za36ai6n5fth) | [Fork this repo. Push to your repo by the deadline](https://github.com/accesscode-2-2/unit-4-assignments) | x +1/19/16, 12:01 am | Have a least 2 submission on your blog. Have a detailed README in your passion project repo that outlines the work you will be doing. | Complete this on the blog and repo you linked to on the Google Form | x +1/19/16, 12:01 am | Revise and resubmit your resume | Upload to the shared [Drive Folder](https://drive.google.com/drive/u/0/folders/0B61otWQVg7ApUFFjWkx6ZE9VOUU) | x From cc047bf0b525c5d50f4627f62b31854e8fc26947 Mon Sep 17 00:00:00 2001 From: Fatima Date: Wed, 13 Jan 2016 21:45:15 -0500 Subject: [PATCH 111/126] Added homework -- not done yet --- .../Contents.swift | 134 ++++++++++++++---- .../contents.xcplayground | 2 +- 2 files changed, 107 insertions(+), 29 deletions(-) diff --git a/HWfrom1-10-016(BigO).playground/Contents.swift b/HWfrom1-10-016(BigO).playground/Contents.swift index 938d133..117f886 100644 --- a/HWfrom1-10-016(BigO).playground/Contents.swift +++ b/HWfrom1-10-016(BigO).playground/Contents.swift @@ -1,55 +1,133 @@ -//: 01/10 Homework Sunday - Instructor: Caleb -/*: - -Use the link here to get the questions. Then code your solutions below. If it does not require code, just write your answer in comments. +import UIKit +import Foundation -https://docs.google.com/document/d/1aF1imJUVahCSJAuN1OEm5lQXwpSFaAmVmAETKMM6PLQ/edit#heading=h.za36ai6n5fth -*/ +//: Homework - 01/10 (Sunday) Big-O /*: - ### 1. With my new top of the line XJ452 supercomputer, memory access takes 1 picosecond, math operations take 3 picoseconds, and storing data in memory takes 10 picoseconds. My friend wrote a filter that makes a pixel more awesome, and takes 200 picoseconds to run. How long would my computer take to execute the following code if the input image is 1000px wide by 2000px tall? What if it’s n by m? - `Pixel **awesomeFilter(Pixel image[][], int width, int height) { - for (int i = 0; i < width; i++) { - for (int j = 0; j < height; j++) { - [image[i][j] makeMoreAwesome]; - } - } - return image; - }` +`Pixel **awesomeFilter(Pixel image[][], int width, int height) { +for (int i = 0; i < width; i++) { +for (int j = 0; j < height; j++) { +[image[i][j] makeMoreAwesome]; +} +} +return image; +}` What is the time complexity of this method, expressed in big O notation? Assume the image is square, and both dimensions are ‘n’. My friend sends me an improved version of his algorithm, makeEvenMoreAwesome, that takes into account the pixels around the image. He says it’s O(n^2) in the amount of pixels in the image. What is the new time complexity of the method? +*/ - +/*: #### 1a) -* 1000 * 2000 = 2,000,000 (image pixels) -* 3 + 10 + 1 = 14 picoseconds per pixel -* 200 picosends per pixel - awesome filter - -1. 200 + 14 = 214 picoseconds to run filter per pixel on my pc -2. 214 * 2,000,000 = 428,000,000 picoseconds to run an image of 1000 x 2000 +* [math] 1000 * 3 +* [math] 1000 * 2000 * 3 +* [memory] 1000 * 2000 * 2 +* [storage] 1000 * 2000 * 10 +* [filter] 1000 * 2000 * 200 +* 430,003,000 picoseconds or 4.3 * 10^7 #### 1b) -* n * m = nm (image pixels) -* 3 + 10 + 1 = 14 picoseconds per pixel -* 200 picosends per pixel - awesome filter - -1. 200 + 14 = 214 picoseconds to run filter per pixel on my pc -2. 214 * nm = 214(nm) picoseconds to run an image of n x m +* [math] n * 3 +* [math] n * m * 3 +* [memory] n * m * 2 +* [storage] n * m * 10 +* [filter] n * m * 200 +* (3n)+(3nm)+(2nm)+(10nm)+(200nm) +* (3n)+(215nm) #### 1c) * O(n^2) #### 1d) * O(n^4) +*/ + + +/*: + +### 2. + +If foo(xs) is a function with time complexity n (where n is the size of the input array), and bar(xs) is a function with time complexity n2, what is the time complexity of each of the following snippets of code or algorithms? + +#### 2a) + +for (int i = 0; i < n; i++) { -- n +for (int j = 0; j < n; j++) { --- n +foo(xs); --- n +} +} + +n * n * n = n^3 + +for (int i = 0; i < n; i++) { --n +for (int j = 0; j < n; j++) { --n +bar(xs); n^2 +} +} + +n * n * n^2 = n^4 + +for (int i = 0; i < n; i++) { --n +for (int j = 0; j < n; j++) { --n +// do cool stuff +} +} + +n * n = n^2 + +The answer is O(n^4) + +#### 2b) + +int frobnicate(ys, m) { +if (m == 0) { +return 0; +} +return ys[m] + frobnicate(ys, m - 1); +} +frobnicate(xs, n); + +The answer is 0(n); + +Tip: Write down a table with n from 0 to 5 and trace through to find out how many times frobnicate is called with each value of n. + + +An algorithm that takes as its input a list of friends of length n, filters out duplicates using a method similar to our hasDuplicates method, sorts the list using merge sort (see bigocheatsheet.com), then prints each item to the screen. + +*/ + +func mergeSortFwends(inout array: [T]){ + if (array.count <= 1){ + return + } + + // split array in half + var middle = array.count + middle = middle / 2 + var right = [T](); + var left = [T](); + + for x in 0.. - + \ No newline at end of file From c1c1c828ce86af04446d061411fd7e4b72498bc5 Mon Sep 17 00:00:00 2001 From: Fatima Date: Thu, 14 Jan 2016 09:01:44 -0500 Subject: [PATCH 112/126] Add --- .../Contents.swift | 140 ++++++++++++++---- 1 file changed, 115 insertions(+), 25 deletions(-) diff --git a/HWfrom1-10-016(BigO).playground/Contents.swift b/HWfrom1-10-016(BigO).playground/Contents.swift index 117f886..2b454e6 100644 --- a/HWfrom1-10-016(BigO).playground/Contents.swift +++ b/HWfrom1-10-016(BigO).playground/Contents.swift @@ -6,9 +6,12 @@ import Foundation /*: ### 1. -With my new top of the line XJ452 supercomputer, memory access takes 1 picosecond, math operations take 3 picoseconds, and storing data in memory takes 10 picoseconds. My friend wrote a filter that makes a pixel more awesome, and takes 200 picoseconds to run. +With my new top of the line XJ452 supercomputer, memory access takes 1 picosecond, +math operations take 3 picoseconds, and storing data in memory takes 10 picoseconds. +My friend wrote a filter that makes a pixel more awesome, and takes 200 picoseconds to run. -How long would my computer take to execute the following code if the input image is 1000px wide by 2000px tall? What if it’s n by m? +How long would my computer take to execute the following code if the input image is +1000px wide by 2000px tall? What if it’s n by m? `Pixel **awesomeFilter(Pixel image[][], int width, int height) { for (int i = 0; i < width; i++) { @@ -21,7 +24,9 @@ return image; What is the time complexity of this method, expressed in big O notation? Assume the image is square, and both dimensions are ‘n’. -My friend sends me an improved version of his algorithm, makeEvenMoreAwesome, that takes into account the pixels around the image. He says it’s O(n^2) in the amount of pixels in the image. What is the new time complexity of the method? +My friend sends me an improved version of his algorithm, makeEvenMoreAwesome, that takes +into account the pixels around the image. He says it’s O(n^2) in the amount of pixels +in the image. What is the new time complexity of the method? */ /*: @@ -34,6 +39,8 @@ My friend sends me an improved version of his algorithm, makeEvenMoreAwesome, th * [filter] 1000 * 2000 * 200 * 430,003,000 picoseconds or 4.3 * 10^7 +The answer is: 4.3 x 10^7 + #### 1b) * [math] n * 3 * [math] n * m * 3 @@ -43,11 +50,17 @@ My friend sends me an improved version of his algorithm, makeEvenMoreAwesome, th * (3n)+(3nm)+(2nm)+(10nm)+(200nm) * (3n)+(215nm) +The answer is: 3n + 215nm + #### 1c) -* O(n^2) + +The answer is: O(n^2) + #### 1d) -* O(n^4) + +The answer is: O(n^4) + */ @@ -55,7 +68,9 @@ My friend sends me an improved version of his algorithm, makeEvenMoreAwesome, th ### 2. -If foo(xs) is a function with time complexity n (where n is the size of the input array), and bar(xs) is a function with time complexity n2, what is the time complexity of each of the following snippets of code or algorithms? +If foo(xs) is a function with time complexity n (where n is the size of the input array), +and bar(xs) is a function with time complexity n2, what is the time complexity of +each of the following snippets of code or algorithms? #### 2a) @@ -83,7 +98,7 @@ for (int j = 0; j < n; j++) { --n n * n = n^2 -The answer is O(n^4) +The answer is: O(n^4) #### 2b) @@ -97,38 +112,113 @@ frobnicate(xs, n); The answer is 0(n); -Tip: Write down a table with n from 0 to 5 and trace through to find out how many times frobnicate is called with each value of n. +Tip: Write down a table with n from 0 to 5 and trace through to find out how many times +frobnicate is called with each value of n. + +#### 2c) +An algorithm that takes as its input a list of friends of length n, filters out duplicates +using a method similar to our hasDuplicates method, sorts the list using merge sort +(see bigocheatsheet.com), then prints each item to the screen. + +binary sort (hasDuplicates) + merge sort + +O(logn) + O(nlogn) = O(nlogn) + +The answer is: O(nlogn) + + +#### 2d) + +An algorithm that searches the now-sorted list of friends for a specific friend (not including the time it takes to sort). -An algorithm that takes as its input a list of friends of length n, filters out duplicates using a method similar to our hasDuplicates method, sorts the list using merge sort (see bigocheatsheet.com), then prints each item to the screen. +O(1) */ -func mergeSortFwends(inout array: [T]){ - if (array.count <= 1){ - return - } - - // split array in half - var middle = array.count - middle = middle / 2 - var right = [T](); - var left = [T](); +/*: + +### 3. + +Look at the complexities for some common data structures at bigocheatsheet.com. +Pick a good data structure for each of the following scenarios (there are sometimes +multiple answers): + +#### 3a) + +You get a large dataset of points of interest from an API when your app first runs. +You build it once at the beginning, and then have to search it many times while +the user pans around a map. + + +The answer is: graph or trees + + +#### 3b) + +You get a small dataset of points of interest from an API every time the user +pans the map. You construct the data set many times and only render it once, +then you discard it and do another API search. + +The answer is: stack or hash + +Tip: Constructing a dataset of size n means you have to call the data structure’s +insert method n times. So if the data structure has an insert method that takes +O(n2), the time to build it all from scratch is O(n3). + +The answer is: stack or hash table + + +#### 3c) + +You used a linked list for your music app’s playlist feature, but now when people +search their playlist, there’s a noticeable lag before loading results. Your +competitor’s app is buttery smooth when searching, even showing results as you type. +What data structure would allow you to more quickly search without compromising too +much on the speed of inserting and deleting tracks, even in the worst case? + +The answer is: tree + +*/ + +/*: + +### 4. + +#### 4a) + +Write an algorithm using one of the methods from exercise 1 (your choice) to +calculate the factorial of a number n. What is the time complexity of your +method in terms of the input value? + +*/ + + +func factorial(num: Int) -> Int{ - for x in 0.. Date: Thu, 14 Jan 2016 09:09:38 -0500 Subject: [PATCH 113/126] Will work on it more-- almost done, gotta go to work --- .../Contents.swift | 47 ++++++++++++++++++- 1 file changed, 45 insertions(+), 2 deletions(-) diff --git a/HWfrom1-10-016(BigO).playground/Contents.swift b/HWfrom1-10-016(BigO).playground/Contents.swift index 2b454e6..1c582af 100644 --- a/HWfrom1-10-016(BigO).playground/Contents.swift +++ b/HWfrom1-10-016(BigO).playground/Contents.swift @@ -185,7 +185,7 @@ The answer is: tree ### 4. -#### 4a) +#### 4) Write an algorithm using one of the methods from exercise 1 (your choice) to calculate the factorial of a number n. What is the time complexity of your @@ -206,12 +206,55 @@ func factorial(num: Int) -> Int{ } -/* +/*: + +#### 5) +Write an Objective C or Swift function to multiply two numbers without using the * operator. +Use the grade school method of multiplying by doing repeated addition. +For instance, 5 * 8 = 5 + 5 + 5 + 5 + 5 + 5 + 5 + 5 = 40. +Find the big O of your function in terms of n and m (the two operands). */ +// I didn't account for negative numbers, decimals, or large numbers + +func multiplyTheseTwo(num1: Int, num2: Int) -> Int { + + let baseNum = num1 + let multiplierNum = num2 + var product = 0 + + for (var i = 0; i < multiplierNum; i++){ + product += baseNum + print(product) + } + + return product +} + + +/*: + +#### 6) + +Look up Russian Peasant Multiplication. It’s a faster way to multiply numbers, +especially on a binary computer (like yours!). Implement a new multiplication +function using this technique and find the big O of your method. If you have +trouble with implementing this, write a flow chart and find the big O based on that. +(But it’s more satisfying to implement it and run it) + +Tip: Run through the method by hand a few times to see how it works and verify to +yourself that it does. It’s a non-intuitive algorithm. This will hopefully also +make the time complexity more clear. + + +*/ + + + + From da74586f2a652328189250c1e0b808b4ab8de9fd Mon Sep 17 00:00:00 2001 From: benstone1 Date: Thu, 14 Jan 2016 11:11:40 -0500 Subject: [PATCH 114/126] Update README.md --- README.md | 12 ++++++------ 1 file changed, 6 insertions(+), 6 deletions(-) diff --git a/README.md b/README.md index 285af99..2247140 100644 --- a/README.md +++ b/README.md @@ -22,10 +22,10 @@ ### Homework Due Date | Homework | Submission Format | Solution | |---|---|---|---| -1/09/16, 12:01 am | [Data Structures Worksheet](http://www.cs.cornell.edu/courses/CS2110/2014sp/L09-Lists/data_structures.pdf) | [Link to Google Form](https://docs.google.com/a/c4q.nyc/forms/d/1qGLpV_eLZv6a-zrS6dHEQqwPv4QbpBSh646XNqa55Ps/viewform) | x -1/11/16, 12:01 am | [Submit links to updated GitHub, LinkedIn and Resume](https://docs.google.com/document/d/1Y6oAzxDa_K0_0_Mz_S-O5w0LJ5eJUuL4iODAH9Fj2FQ/edit?usp=sharing) | [Link to Google Form](http://goo.gl/forms/KUfBPRHQBr) | x +1/09/16, 7:00 pm | [Data Structures Worksheet](http://www.cs.cornell.edu/courses/CS2110/2014sp/L09-Lists/data_structures.pdf) | [Link to Google Form](https://docs.google.com/a/c4q.nyc/forms/d/1qGLpV_eLZv6a-zrS6dHEQqwPv4QbpBSh646XNqa55Ps/viewform) | x +1/11/16, 7:00 pm | [Submit links to updated GitHub, LinkedIn and Resume](https://docs.google.com/document/d/1Y6oAzxDa_K0_0_Mz_S-O5w0LJ5eJUuL4iODAH9Fj2FQ/edit?usp=sharing) | [Link to Google Form](http://goo.gl/forms/KUfBPRHQBr) | x 1/12/16, 10:00 pm | [Passion Project Setup](https://docs.google.com/presentation/d/1Sb6IoD3f842WGugSJZ1s7-4EHgPEdH5RHiT3-H0TI2A/edit#slide=id.gecfcc994a_0_10) | [Link to Google Form](http://goo.gl/forms/qU6GQ8b3pZ) | x -1/14/16, 12:01 am | [MVC and Unit 0 Swift](https://docs.google.com/document/d/1DQ2aCJ_yUZtazzCfb0PaS81bg61V2ZOSxpABh981xSo/edit) | [Fork this repo. Push to your repo by the deadline](https://github.com/accesscode-2-2/unit-4-assignments) | x | -1/14/16, 12:01 am | [Big O notation](https://docs.google.com/document/d/1aF1imJUVahCSJAuN1OEm5lQXwpSFaAmVmAETKMM6PLQ/edit#heading=h.za36ai6n5fth) | [Fork this repo. Push to your repo by the deadline](https://github.com/accesscode-2-2/unit-4-assignments) | x -1/19/16, 12:01 am | Have a least 2 submission on your blog. Have a detailed README in your passion project repo that outlines the work you will be doing. | Complete this on the blog and repo you linked to on the Google Form | x -1/19/16, 12:01 am | Revise and resubmit your resume | Upload to the shared [Drive Folder](https://drive.google.com/drive/u/0/folders/0B61otWQVg7ApUFFjWkx6ZE9VOUU) | x +1/14/16, 7:00 pm | [MVC and Unit 0 Swift](https://docs.google.com/document/d/1DQ2aCJ_yUZtazzCfb0PaS81bg61V2ZOSxpABh981xSo/edit) | [Fork this repo. Push to your repo by the deadline](https://github.com/accesscode-2-2/unit-4-assignments) | x | +1/14/16, 7:00 pm | [Big O notation](https://docs.google.com/document/d/1aF1imJUVahCSJAuN1OEm5lQXwpSFaAmVmAETKMM6PLQ/edit#heading=h.za36ai6n5fth) | [Fork this repo. Push to your repo by the deadline](https://github.com/accesscode-2-2/unit-4-assignments) | x +1/19/16, 7:00 pm | Have a least 2 submission on your blog. Have a detailed README in your passion project repo that outlines the work you will be doing. | Complete this on the blog and repo you linked to on the Google Form | x +1/19/16, 7:00 pm | Revise and resubmit your resume | Upload to the shared [Drive Folder](https://drive.google.com/drive/u/0/folders/0B61otWQVg7ApUFFjWkx6ZE9VOUU) | x From c62cac2e57c2f8e753167ec96dfbfb7e07e7a9fa Mon Sep 17 00:00:00 2001 From: Fatima Date: Thu, 14 Jan 2016 17:44:30 -0500 Subject: [PATCH 115/126] Done --- .../Contents.swift | 42 +++++++++++++++++- .../Resources/n.png | Bin 0 -> 21658 bytes .../Resources/nsarray.png | Bin 0 -> 20273 bytes .../contents.xcplayground | 2 +- 4 files changed, 41 insertions(+), 3 deletions(-) create mode 100644 HWfrom1-10-016(BigO).playground/Resources/n.png create mode 100644 HWfrom1-10-016(BigO).playground/Resources/nsarray.png diff --git a/HWfrom1-10-016(BigO).playground/Contents.swift b/HWfrom1-10-016(BigO).playground/Contents.swift index 1c582af..e1876a6 100644 --- a/HWfrom1-10-016(BigO).playground/Contents.swift +++ b/HWfrom1-10-016(BigO).playground/Contents.swift @@ -249,18 +249,56 @@ Tip: Run through the method by hand a few times to see how it works and verify t yourself that it does. It’s a non-intuitive algorithm. This will hopefully also make the time complexity more clear. - +Write each number at the head of a column. +Double the number in the first column, and halve the number in the second column. +If the number in the second column is odd, divide it by two and drop the remainder. +If the number in the second column is even, cross out that entire row. +Keep doubling, halving, and crossing out until the number in the second column is 1. +Add up the remaining numbers in the first column. The total is the product of your original numbers. */ +func russianPeasantMultiplication(var num1: Int, var num2: Int) -> Int { + + var product = 0 + + if (num1 % 2 != 0){ + product = product + num2 + } + + while (num1 != 1){ + num1 = num1 / 2 + num2 = num2 * 2 + + if (num1 % 2 != 0){ + product = product + num2 + } + } + + return product +} +/*: +### 7. +Using the technique from exercise 4, profile the built in sorting method in objective C +(use an NSMutableArray and google how to sort an array of numbers in objective C). +Graph the result. Use spreadsheet formulas to add graph lines for n, n2, and n*log(n). +(You’ll have to modify the factors to make them fit in the graph window and to be close +to the graph of method execution time). Show that the sort method best fits n * log(n). +*/ +let arr = Array((0..<10)) +arr.sort() +let time = CFAbsoluteTimeGetCurrent() +//: ### Various run times +/*: ![Runtimes](n.png "runtimes") */ - +//: ### NSArray Sorting Algorithms +/*: ![Array](nsarray.png "arrays") */ diff --git a/HWfrom1-10-016(BigO).playground/Resources/n.png b/HWfrom1-10-016(BigO).playground/Resources/n.png new file mode 100644 index 0000000000000000000000000000000000000000..9f457655ce68b5fee96ae0bbb4233c947218a813 GIT binary patch literal 21658 zcmeFYWmjFz)-8&=ySr;}cMDD+xP{=sVd3rs2pS-`LkJK&xCgfd1b26Lzmq(BzkA&cMaQ z#lWFuX80%xLoI;`BaQJ66ZV}nV%|q-aU7aO%H4;jlc$r$ooj)m2U}Oot4YHp5shXD zM;A3JD#;JB5R%<_C2n;0P;5W#p>FvgpghE(xC7GHNpW*6ZEO&q`#8lSKILzf{7I{L z(LH(5|K{V9-vSw6`|fZHdy6!3{Q%-aLksoyaflBOYK>|Jpx;DUQXI&*v`C{C{k#Z&Z1|>QYA(!TnJY~b5J(rThzjroB zYaZf9$c_BWm zN^#VRb2KHt(O0U>U#3egR-3VV=Q}I-W`5WN+xuPj5${uXRogq+Yk$Xpiqx&5F=!LY zX@AE?15__`VjzASNmV3oAKVeO#ldyY^3hcE=s(UDwTgzHL9 zz5JisgB^m}#~3yFpMY zevWE{sD#S@o_V%?*rIk&A|^=i?rR;EEO~zDxm=^^>>C4dr2L3cY4rTyQDwxWXZr4M z?JUo_L;kV#y(eNj4UEMp1={mwYgZ}loyO(<-W<2FJm(T(tk312NyL9r8oniVCbyO) z3V@i1xeE4;rjssCEwc= z%Li)m1KDF31p@lG#4rZ^Z}iXN`jnn;aVNr}DHQwBoI`~v{TWaq0~2yv)p)<6CrK9P zAcJwgBYp}#mQu~Z2NQ6^j)+ISftu`MdBe_vG}Q50UQ)o=C8L*-Gc1#cNn zwNq|`>x}l6$cMR&TRDGvPq?hM>UM)=vCiz6c1_Is74ds7O>LrOt`62So4*91Eu~^ zCZc8qCs@;3qgpLln_9V8kBu+q`br2X%E{3y6f5q?;wz^px(EIYKIU0s_pd8LpV8ak&#Ce; z17VC`8N*A`_CzP)IkQ+4c&Q%ZxcZ9+NH-BJLUbeM0_M^^*mOsFSU=I7_KYv2BEH2oLP0-|>bhe;tWt4PlKvVp^bBpb}zlCTnJYkhs>n_Pfp| zStMy9X(Q1kaV3E!iOPV=kj?1KkmD!jmuq-qkYKRTxZW_>DA*|KQsZdj=#lRC&!&sGQ@?AW^C30%i)spc#0h~h@(PX^S39pi#S6!?)^jXW z8I%_kB~%ZTJ8TiGCyX+zDU2$jDAr@EjBV6L@+GUQzHCT@J(4x@0(DIPP zP5|_aQ;onkq@@8eKwAVrFg6r|?N$X=Yj#xji zI zPkCfp@Z4P76Ua4-OKyIB(RGzDX&3k?E1&xP->+dl+Xfnm>mIm5y zXXI|mj=ehs9KaEOFtu>`WAR&Sn0MlO+HKKo;mCYpWo}@OcENRyYr%U~dtppyS7=iJMJQ6J zm;aX#2Y;iGq2v9Y?QX`2@IKW>!uokf(hv{0ZXESwd(&Wou`wFC4C)rqQTlW3n$kx!k^ zh40FP_1)Hk@9E6B*uEHU4z?P>sQ{RwlKa#<&RR_dJoX`d)upqPa+K0FH$-g=T=d3S z$8mPavF-Hslpa%`nv+_VdWssEs<;I2Pt7~EKcnA!t?({2i}_@QEsTeC%G_*q4=ebK z8*I*$&P>i)5fc#Mv6tzI=(FUzXgulb=#lA84r_m0d;HfJ@HgO-6f~24fxm>;Wd}Mc7ytsUqSU$ z%^%OqRtIu5=!*B5WtfpwH&ptv{Is{;Pr1ro4TshkSk{cOWg`pmc`YA5E+I4Fv%SA~ zzhfA}-fNKY!>MAg+03J)O6$k%9wAkXLct71}(Yal{P*#7T7r{!%T3Y_OT6;Cb-9QQVtUeUU?bXD%`+RKB>dJ!HUuanfd8hGewXjM2;`0%V|F>=y#!uwOI&7PZ- zDt3SL6TeX3B%UsQ_1m-^*Dd1De6IO}`SpD$eO`S>ec|*i^rEd_yqdXF&ti@Z*Sw!^ z@J0Lmt+F_?_8%HHHa3eRRNKWY{Y>tiA4_j%4puo?hwjI_?Z}?N(kbxN6arFG^)pjI4({~@ z^oMN{2+&W6H~F3<@qW}V^DGFp$!-vWnAFjbT5$BymK2VYj##j7=WEeGRhP6V z8%mLz@3$qi1b!)9-((~k@OdrSa!W&uIx;IrV_N-QkHbSPw*4gXe!`mU0d%K3#0WZ?l_Age;Oai3KeV8^Sz&+YqE&ZBfS#IyhJ&DS!Vj4 zU~bHQy^KswTjD|w1dooHhsEVSP$NMgYGr6N2f2x-Oa_;kEyAvTjEY<1h~|$S`%c)aSzoX?4Up=_F>uWM|+sbk((0KHREKaAn8^Z0d}8q)TANIpEVTfQwsz5-AL6AwiO_7CtFRDb-&LF*o8|FIOMG{^9Mi=ODXQqU-Uq$!?`d?DSh5%i zne5m~`Lq1GN*8k^Z)vVK|CDqN9#8U>?vK9DWEFAWe0)ZhpIXBgv9V>ho>KS|e~`@9 z-h96K3E9gyv+12q_DtN;whzo9h7)%%dGYg%=brUZGPr$5qcA@E3ebBQnAm&n^DE%e1SjSiUhJ z0&m62sm!(|rJ8+vygxpBXhLt)$R!^U`|PK8_jsu|rM=HrZaoaTxe4Yfs%e;;Zp?I< z6#M93HcbA&_~NpueFx<_epP>=-r+o|aA5Hmnln_%+!bQbbJ&4ZrOeM{^f`bMG)Y2t z9~W)CwHvbQNzfmCsYGJtX90`Hti_}+;4Mb~yRhe|FL7+4_eLf_QO#emQmxG~zn_?c zf{h`Uy3v%`b-}0vYVU$mxmv`z``j2OIqB`-BGdX0rcbi_yhIB;c6DX7%B~>L))mZ^ z_0e zXquZE7!Pw6&X%7>N7oJ4$a=GcvnIc)RA8Nmlj9m^oCFvr`GW!^C|p*h!B?xp7%6I> z!G)E_r-ulWZ@VJ6kWL!Rq4nQV0zRFN3CHmN|Mo5Z|9F`sZsi``B@1#~QnweV%v! zHo-&H3~Vv-Qxr|4D4uo-OmbvO8+)^(@Po8RqhaW}{B&YX@jX+i>Pd++Ked;|^Wl<9 z_}GJ?>_36%a3X_v5P>jTfflz#9O3#5 zF*^adngh4Wfek^f2m@wJY#&2MuyeAS9zd8Kx7C4S$ZIU3b(G>7_Hcy233SOpybQp6 zgK9D!{SIyfdnuQJ0scpjUJj)dUQsx$3HB`fGPHI_{hIbER#%i2bymO8CdoNOYH#I7 z?(s!dVi(j4q^Rye6Zenk9}lV$`L!}I+0eAV5O*e?(cQlH5qTz-NLW?;P7^(GI_WX- zenJV0Hp1k$ELPyA?2kejD|fI_v1tx+uD5vm7tvV17!&wzLs`OJPCB9@>7tWO@pF9( z_H9Hw|77+uC#&9sF}B}EVU?D7LnC7#MKWcJgysjs~%jC{*Zw5729U(Zk*DFrs z$4Q>gpFrOg-Lk^`h8u;G3-dulM#+vYP?O7B`k2*sM{`PpMzd3xb|QPdxJ=xvDtNIJ zh^?z4fD-O?u0kd+s=zpFWTvsMo9yy&wLr^!EOqumY3ei2$v(-?#pa*7D}M?+OG|r> zMq^`o*yhNpmiPL09-!fd!xD@dqn(uLRO);LE;5B5Y(&?!d-DcP=!cY;)k|#;Zs0@O z>{cOJKfno#~&xYy{^djuoG1h4zBl9XQ?>@-dPl^BZ9q#57!bSZg$?oQo6kBAEfSJrR50 zO|SN3N5eec>OF@u&5DU9$QA%YJ{Oq^X{>#_Si$R@k~BO!&qfS z$mQPPIW8+JK=weh zpzwN&#TojT+-*`i8fNAW_g+&ik%30z1qSuv!sV+vnYiIfG>Eb78Jo-}*whJ&EJtJj@Bx`?2e#{MC3Wu(Aa zW>aC95>yf9&>HvKpV*tUWEwkar+D|2Lsyn;Fym;x!!vx9=G7+)2Aw4z*rg@wyLT{<+rHn5V3yZDCwBQo6Uwkm1&zG2Q;^`ftWo>%b5HIRI6MawQ z$x({)M6(|MT;E-#oEU2tcU}(Ouya*dI*i~xA*7{b8$WtJrMy7RNG{~{t)HJ%)8-bY znHO#?FrPD9Y6)n$Os|t~6;rf7-v(G+L3Xqm8D`?bLS&k}&)KEWId_Hiq3b1cYFe zytKr756Gh>WRT`m=Ixm=*12CC20|pVOSta03~RL9=f?I)F76>Ajl7dn2eo@wXJ4Popo7ydv@eG>eMI zBOYXA-2YKJ zoO#)r#H>AdeY8N!#H6r2l1`6Jr}QS9RMbbu$mdL^q@p6_@zEz$%)gC>mNs?lm+c%? zsdfc#MX_qO{X}$3O!ChOW_I?Jt)Y~mD$_n14vu$Zo|~8hBO^zgA{UhY|Cs427i3?p z_@C+NL3Y10!zXr!DHa&mjhnSz?Nn!(WjjHDfre|+WW>8y`DrL2r)GBO7@H&DjJBsZFns~5z0d9Om*5=PW;u{>2pk=0Ve!d= zDchm9>y>`9RBck|-^u1!!Y;oQ$l4QRQk+%2qil4_7WMU6fjWwSkZfS;tDFRAI{a3Lx#KY?6#k7tgkDTip$H(+f>g-<`^#$ zfk4SwaQH+SRuH-2aOgxKyASh&;CEhbs}o-NLoHzMo8zSiPRlcn*Yj8WJIwQqs-^kT zFQgJXtM~;v^vY-Q47`MbyS|)mXoRC=Fk^Z}%Xwrpx!7{F?`*4gJ&Qqu8Ynu*jna0h zNs~@B%hp0~_rqXqEjQPyx~18!EsCARgf4+s%r6#T7%_!lo0*@6Hbueq^R)vY?@e7( zMi7Lh+#W2k_^gD|+bkn2iPw0stNvjoP(k;8n^8c2j>g~RK|Ga1bm>04fI95iHPxZs zhrs-)w5@!MqN{Pb%x6bvB|e`h)#1v!cwC-s4r!auXD! z94toK3wzsbmrtOLO#s<^x#Q`o#6{@OCG2_i9OF|jtNKutnm_jNqznR|{xD32=4S7e zA)_)~g0&Dx9ZOgt3=4}P2LqwuhXrxw^>Q_2j@W>aaq+F9|Bb7C2=8Zjhs2)xDDO6k zx1688y}v7VK#LDdb;2B3IUtTKJiWYQJ9jkOB<89%bJX(TPdMgQ?t{h1+G|&AETp3OhMz8InHU^V3P#ka5ggME!eGTA#godpS#i)z%m& zm=P`Q4J1J%lEXY;>;0DJEDZ}Si-#OurxDnX*m5~4KUZ0*q>kl15ZjhSPwj$Dos#P2 zp2by{z38ZU3pZ|gb2K*%&zfcf72$T(q4*E1V8a9x;#cSz!g@VEi3m84oSJ?9j5gAQ zp0dc&&sP+!oY=d4iYlNKd2-j83xgpc3X>7@8dO(>1IxV!xA1LZhf>esbUoaEEt-uq zI4Ydx=zYe#4MKNkz4GbDI>w3@eRYF?3K&pt5Bm%$UoejAo3%`h2d{JF1?waQh_zZG zO0mCg3W>ZM9hLofuQ+F{Lp`s2I#Z7pcZowZ0}XfB`xypfsbfR^Uo*8jJw3FM+cdRt z3s#wY4EJ^^PsK000&DO{LX2xnEW*E<6-5D5MVtHJaKo-$9Y4@8<U^%$O8CZe;mY@$6K3upRX_xWaQ$DThM?c(tt!j)5gMJ(KwE_`--&M>K#w$`Lmq4MbmcT4Z20I49r1S8xLd%Yv*4ZfRsbph0{H; z6*E1*Zm65?p1K=|87^Molz~{QCn|1v-G(S&8$#{lG<7FwRF}o1>AtAA{2{|<%R}+h zLZpyXQ3(3G6S)|(t~nFK4Pex2(C7Uin@L)>X~Jfkusk1o)nJIOBc8X9x#&*zlS9N72NiUA{~Z7(W+h+${F$fc0i15ryX1w~eKGsEc~wya zeGYYtWqAlpUPCO|*K^IWC7@M8OChhGw_hRsNm;(hPj>dv8DeENA+Ljlfx-pvr7=%ua}%3A<=3hG zQQnvo;W6YIybrpWf5fyffw>2{kiA-sxDJeHJ)Gh`oNn>ZsOpSaa9QP>aN&1Q5pjtL z6n|gHff6*ln45`7+e?F;vG}%^W*dk5-NdfN9*4udMA%FFmjRdXoCX)$Jnqya zJ0gX!VJi;W>k1|Zv^H-y4$9UvZ-3eF!WQN)jf5ISg_Q1ipAqru=wMPvR5DPL#lsTM z97U;6UVLjZ1XcC(A}LV$G&DeE=Fh5x`^;l+G>hBJrFc2ExJM2a<0~y$H3KU8ogc6( zpT04-O?$j5hyM0+Zxadm4PdR1l1@Z_SLzh%S`VF^ye#3YTVs>_c%;t4=r>$8hBm)S z07RFQrexSF_i;clXqoQ5IT?tje8O&d$FD#MgCPv_caA2Q9)8Meur?ymgb6sw4{=sz zKsnXMsNw6Dsv_^|p}#uBV80&va@nU}7uOc8>P)Z4!$+tJ2ZrRCvh1R5ylJmWo3&jb zDxTuQ_Rwed<8mr_Xvu7Qd`2vBP++&*-+np~fu>%K!$xFxTL*Tg2-!wNC(O8oMg392 z@mps`rf3=j6#@I`U#EAB320UOvsVqrrFk)0;)_UjxWDIJ{??YDFW`6ag8P2e$~)HS zaZ~pV*}rXP;Zz308!{-&cs8_CMAeba&(yjZb5H&9r?0KReu(;gd5D7F^hQ!Yv>*)F zkz19VC#FPqr2!g`-Caa5yGJbPaM!6$s5%KSuN-<x{+f5M!NT>*kN`Bl|FIjC7m-h^wTagS7Kj8@+!V}*Prr5#1L<&80~)rJQy61-u_WH zVoY3}-Tw|k$>jDV0+4cJUEfPf6L+$_RnpSa0ah{i_`9!9(ZZrg_!2Bt?RjDGilukG zudc2pDvZT+8ys_`<>ZEvS@q4X_NQds?l1RV*~vv)QJwRa!d#ngv%JG{izlZ^7mSOM zr)MLJahpL5sSw@g&!5lxsbk;T+yA^PtGT4oc3mU{Cbz2#DdaI*SvrjJ_0Q^B+S&jX zHtAFi;hKF6h9d|$1PIgV*MwIE+$QCK3Qk80z zC!}&&4g%bv;KvUIx5HTzJx(Mfq~R0#EDuRK)8fu@e+y6R?#F~CjAMy+?yLs-pCf8Dc(XkHmJ_tAwzp7U@ii&QH7)C*G#l$R$fn?fS0(uRew5g7rkn0Pt>9&mIwi09@qm=I3>Pr*BL{4YT4+x`V~KYJb*8XJ(_;d;TIzAzR zYHDgqT|>k4=QtbYLw|pNT&9qF8h2gKU+Qw4xVdS@MJ5Ry8#6I^Q>RZ0mTH#bKK-k} zEK*gj2cF5{~Z09cwRlJew+*y!k8_%tMQ(@7z{qGV zqHU=O@RqI|L(-(Aq;0Mz&Xsomb}QsiI7A|){}7wZLVVlHlAD=;kXQER*wm3Mva>1X zr_EM8#*;o$)#jv8WLEH-Ut~cfSqusRa|Q-u#=u3{<|as#5*HWu{QjU~s6U=s8NXNG zq18O^W9FA!Xd3M@9TN-HT>_-cP!7*?v&rfl4PMv95IAbVYZHJvS?m|bl)hC|Osun+ z8GO9EFrO?^E?S@-BT^jK_3DJfxbK)Nrx3aR>O%c`jK76k(!IE=D=w(qeEhX|SVl;b zqpITW1Cd(}BltxfI`|rMMN`|5R@>OOZm$=N7qY(o5g-Uln1Zes-RNRpEwg>6eN1d@ zg3vPlOou!8KP;SIPO1)xyGk!RI1TeuV9xZGGV;d^+;y`rg8)? zw(na9y9Us63x#4hOhNEFORe49lY?kvky_l3vy~=v5aafd!SLv55R`0eqr9Q)UQ3T23~h|H$0l%%{ZV^dYo$Eh8J=_XZMZ`){SCPcsQyUdQj5CU>JRu83c+D3}gdV*Eq#} zNNRzL`(QJJ*Rlr1fYnaJtF7ckEb)fIqJDZ{){d}HFzDI=y|j=(V1xPnTOJ6~0S_<; zWQ*FC_JbUdA?cr@T3$gKB+@Gi>9N*k5r=T<0U5mFC4LQ{!PKkuIs;5`k8)W?bRb~s z0Yx)YEBT@H0lV+)?O%g zg0Yun>UZRRP4ueY{sEK$#lY}|H8X!QqdlE6sgQt_D4{axeUeBi|5=@iin zfC$>$)?=f+g-zXTgXMh2SBZlfN1$lP9dv`jZs_GQ_4d zCYm}RfE-3)ka+WMDzw@}I~5@Gzl1S_Z*#XZjb)(_c4jaIq#+=)kw{p7CT2hHV9q_5 z<8}tCW<%2Br|S}^{3JaGmb48Qyt+o;{;ckHR6*l$dZe*>7=$g(-|W{<3T%N|2O62E zs17YO*T(Lz(>1QuFsjMWwJ<%ZSis7OU#+}S0`dH|HJI>XHGSS)TLO_{QPX%658!|- zr+4F@bX(59Sq*hxnW~$wEeRwzz+xW$*jrO@cN#~aFfi~m1JG~_b)~Cnqj38#HMGp{ zJe}QQi|Nc#_w*jc0bhT+01KK`s*V%_pfGG;oGWF?;nc;S%m-(=DLowZQSZ6hVKAP{ z+!emOLVqiA;YAKwjpzGm$Xa3k0{ed18KA!5!zm+Rofy1srhs9)756V4s2MufKzE6bp&89gT-ZB6A4-Frhlo+%SXo-#(w#FAY0f( zd9aBYs0bi!Hp(^BS1Y-MYRcbU=ZhKqrOG^vx7Z~9=XLtiEVIdxPSY#!22Wxl`=b_s@BdKjy~fA{$#fKB=7uvBhqLu!Yw=Y9=ZYI8q# z00v#9{LMLTC1CLXq9!o(U_WDI-X5gUn3_y>afr1?L8@?IJ0$}R;hDBl+6C;d>j+Y^ zSz?z{M~ZaV%H*mS8-dz8ygosIw;99-{A6p~YzJBI3)WQh+?-SaZ)1!V>1Y=W$f)2_ z1UP;giDL(rpiumwuw-tgD@pTh5i}0K*)bv~UsretaTn@cQ*W?+WFfNj-ZI|dcTWKx zQTNh-4d{sZc|F}~v(JBKW{5W;Ba!Zo-P@U8K}mNw`cM>mo0aI$*jUQl#g3x-#GU7q z{x943sZ#B9nr2By^PdQ1U>7(}r{~JSqV<1lV+=_e-_?l3*&2O)?6(sDY8k8mxfdV?*Qr zTVv1iJ{I_^vWpZy#EZdTAXEgj_6EbD^SCOXSF8-0TJN7GBsNLGkgPzR%~@v4dwDet zX9~^K5?BSq0Z5kI|FMchz*#!W=UjeorM>;GYi2qEkonc7D~ugR$8ET0!57nIy3`s) zO7WVdS_8wWT;{#egzB1_v_fu&aU-%B@4z>w`<1{75(Zh9)g|n zE1G+}EEY?$%<}AofhWS*eKD81XN$LQd2$WE{6voA9HUeD8gRHz*GLaX;p zq~CzeOxQ2M-CRS|c_vJJd`mr81qB7Y11)__?g%g*oL$xTvNG=My*fbc$G6J`uS&MB z))7kqX$NkE@teA&-2BVKjvfOHAdQgh7Uc*WT0*d(qMrSgl%cZ;SuUB2&i28C!{Lka zoMRTu#y0i94=*qNg*Q&;t}$p7mqX93H_Kc#G9^w=JV}7jYrzSij-z&|zN|RtjERf@-X{?Av5aLlDxQ-gMTJT(I z+>Dy#wa-{n6by%}D)v;1$PGdXMoa#)D%~u~Z3RvxfrdkQ!-`hF=p41^zT!(42PE3s zMftxHL$)K#PIA}#>X{T-?`PrhsSdw^rhob zq;^5FSoc$Xu$xpg5zipVWY>~N*h(!o{FmfzfTA5F*d9q)wV9^2S!yO393X+-Is@qU z()gtl(@2IHKip52w`%|ipZpwv!5-?X>*WpP&-)a2gSX2GX>aR8>6tSmVQE)yA-dSU zpgI46=*V(4X|LEI0JQ|gH~^6N=BnYA$X9i8k}V>piSm-GRrX}&d6%j6dgqJ?us?RN zAD^-}^D&21LfIABqsaO46OSUIB<(7o@VtkmBL(8!sxuV+NzvV|;T$Iwef$zPJAB_x z8&<<*_E8&?Xy_|6X2Y>+r%bjFD@^}bML8WR`-ln&#FSNmSD}#wl9c5RU<+GInU-5h zp3q#Z9!wYw(GZ3NDUj=?0G((HXf5t}AkRz$#3|3mS1-lZ6jH zLwk8P4z0c!VzP;rie_mNlB0`NHm@w$vB`o8lL}yqcKn_|2S8>Oar|&EKf7GQlQ*_% zL61)}E?YprM@a@5D92OQBLM2sKgismO8lWG7wP9nTzI>n+Icwz72SQ;)_%n;oIykY zI_z%OsY#)R8O$S9PB1NgyVHAK{qon?lea;7oHjj!l6)Bjxg||u0AQ)L1X@Gj*!?d4 zkjYJWf-(MMb(;(~2e~^RSFsA?v?d_N9c*55gFlV1LHhVeqjv51imWtJYB9xg`d|r8 zz#E&3;9@9{$!+aABQKN@Hu#Fvuko6HgS17f>T6#W&_hf)5hs931Cc7*q;k|V!o_!C zcDoQVX&EU4#9?5T7xkEc^hD$pDbHRPcE?kWFIegGMt>=TRhY;%nyilIpF}5 z+NHFz2Pj1@rd2y^JsgVIH$I(SJw^3my55j&xB>wF{D<0LSVJCFd)&FpoF9+YSRmUQ zCfw&P!1YIDNGBJ>fVLd{jgi2iYeS!k!2nqj*G}^BQ_l5iXjk7SPAl&)$yxL+>6ZXE-Il5s9*! zd^syK*&Yi?>)rsc$!_L|L&{Y?$mXH-{t~?brKlvpG~NPc##8ZRA>oPXSPgj9UxpA6 z3j<=0N?8$LOcxWFnKySjiDn_>qLIhi$oHj@c!%j24#A3X{GHzUb3iey8|nA2`2OCK zqBVFC)%ameXY5|-p}8OP2v1h`28$hk;^x41)oIH0Vmh`5h^U=sqAP6mmk1K3WZSyx zqL`U5+-S4Xo(2L9ihehXj0nJnJ**=Y71S|@Q&{FGtXSk~%|;=_80%6~DSLAs(jf!b z3x43KHh`Gg1CDb_G`NrINI^N91so;Qg6LIi?E>xq-i$*4hhk#M0twwfaTwq!`wUqM zX|{GPPyw1Y{8IHpju}NjMsPqdu>X!~=5e?%EiA8$ao6)V)-|sT@uSX!6VVQV(+o=bF}z5kPVQcoE0DPJsRk zVmxi+VZG3PG5phnnCzy#=;uoZP22o_Lkeb*QXDx%X#cYT)v6#QDa~E_2<`Ocu--sT zFTb#`cbowiODZm{p?0DfL0}9l0)?R48sL5nl8~8McjrPf=Y6U}g$-pAuW6(Ur2F*1 z1lu6j(C-Fe0nmU`JANpPqlH;y%6ZUfv9A-}jZ6TBd2&3MET6A25}9DnihU;w0W=F( z{cNZ^rZ@!xWb@Qo_fwLE*Y?$P8XEetu=r21wBgHP3K9WaNIpa`)LPLzRRsdST89yi zLZ6^jX}2#|O~L9sXkf1|G6AiOtvW=!A6Uh|*|}AA$V`)5Xxby0zbB7(+k~p@CXIp@ z(u>X6%%r&W69X`Ha+^#}YA`CK;mq2I9j!%}%-WvdBW(ycUj~SAyttM1=Seay-MF+lUKxZOz`qjOVUd!uw!b``m_OZLVUd%w|Ci)`XA3Cq z)m~ShTtps~KbViq`A2 z-IPYZqE0CQECSbOW*<=q-gKCq{I3GMQGVb5;kr=b@%Qy($@f-pd5(3@BKWFyUfJuyF?cY2?je?um}rC;(OVpPO*8)Ban`Sfh8do zzuccveBLsC?x|&?p`rQ47M@72ItYlbGR?fTLu*OeM)3s&G(h5}nZ)bnnAQ9GFutWl zSYB0?uNDwk6U+7M73}QFaq#d4q0xmuG%?hse_a3lS^fQcn!>_Db!~0>e7RU&Ln^6o zw4^rQ2L)YS-Qqo&%H;+gC`x>=R=DO#Ht&!cA5VS%$|xZXU(CS>86IT{odiq^y)N!Q&rWwSI%iUmc_G#zB8K1wS+Qb=$;u(z#+Np_h5H%H|BTEh0S1f6XIJ? zQ1I5(weHWKKi_QNP>Ia^X$T1ki!`PBq^vsfSW&%pTN4u#M?4Tvg#{H3KV*D7fH3*w!oIsbf_m{7A8sZi->^c3&#gt|x9cxdkNY&=LM5fBXkLtWg;X7N{2+SM5g&m(L`kQxrQt^oIWo zFVJ1Z=R$v^Z z$;gDZJl`K!2#2_tv|LT=(@}ssV+F;Xdm?cyuB8ETI?NJ1kVv1N44YY9vO(7yOYYDs zdbr%Wp!766I+_ezY|?FZD<94lGv>9MH)|3(FRQ`<(hi5v1v?An#6~{f7!ogFL9_!Y ze(n>|E(}a|Z#204Pe(2^xO6cF@2=#~FdY*D@@E3US|Q)>|FypSTl`n4 z-Rd+FlY~YhmC7wA1}-{DM2+r)^J^~uo~=@_Adc@hqQcBC<|98DSV|J_!z@yHD5ctX zUy()J2Ul$!Xmb8nm5LciZ$e0Ma}S1|3(BAwy3C zqJZ!7>lx59^WhEgG6ygSYFM&D;96e){O0VM#?wrd^`%0RO(h87Rs+c8XJ4t5h%f*) z>|oFQ|Fm=F|4^@O9B0DObZ9JtP|2PNk&q>0OH;Oz!7v(3C38d~TGWgY9g!uBQpX?) zW64@7jFLSgTajZ(J(ftaozqFr^>sS0^A9{fKEKTCHS_x3`}e-?>$={bdyPYPPfD+6h@!m)XSZ@Yf@$C(=nIlvB z8whEi6(xbMNP<{rfVg?nas~eD$(w`ZWXMG>cXs%GLR(l!r*39!kzsGhjpaVtj2f2U zHH>y@=aruff1}o;A4aFbp-%{JX3@aO2o_uol6r_ep^VXEEHSLRZ=T=dCoE~-9`7C& z3?W<@c>8=kd;=G?WaS+6{lO7&Y+tpAc)0xxPNi5d#lAf>_E2e~r1>cp}Da9VhRehiIE= zm;(Vbhp-sgfMorLqy}-tCE0$jvIPSMv#2PoLxq118tQV>6Apz`ENb!9C&xG_FEex| zpIW|9>4J;DxQ*TbkOU(eJSQvEsLN(N%N#oJ-s$L(mSmSI-=D;d5}b^R?8+BHSElKv za6m0XuWEz#qeX>O*<`He^6gy==Bd)+O!6eZWvKL%H6N3tq_K@ozaiwlzl~63>20>1 zcPZYwph_TBM7-AegSOPy{i|#n+T%dO$Me)C7fod1Hbgh$GRAE8HF!6VUgnVX6Fo1u zO5Z7<%@p#u$&h&8Pu#~Td*e!-iUlD0Zx<@j6Dd8lRZE{NOa^KNdhs-LezoyyKgG~` zG%A*;?+rPXgUBS3PE&_GP&3Pg#$=*y-undK(sy$#mBV+l`W(3Y{U`c1JpxC376?&j zS7K454yEh<%D8h{pF?+bt1CBpZ%AK~stkSpk1v*=CFaUuu30oz`4tC5hS}qq?V>lc z343{uSzcIa9B09p5T7VM^o<~gP@GDEik-^jb#F&pQA_c0)*1nKAAW4ygf;1BJk|1Y zy+Z{gQ48L-jnUl0-mNH;I-jB6Lf-fmj|P7(OzyZp*SrhAT>{TP46=@c4iP^Is<4Np zhdAs}W+XNwKZh$X_l8pZrXe1^Wh109@G#H_ag4tPudd4S@%95a`S)JOa_u)|s^4f{ zk~w~)^4XZ$8ov@~9O!cz4P;y=DTF4X$@M;kShI0z)4{At_v+qiE)wt8!QF$oZz}ww z^!6&l_;#mi;GK zH6R7+f-FHqzScK#5{OC513&GdJ-8PlWsvH+`{pF;Y4IK1d){}{T}o!PRnAD>B#eG) zj((*=$BPQPx0ys|sPGZH@k$!AF^`9Hjk$wDYxGNgqNQP}qid{|(`MQ?ZQql!i8OMdc|7nIda z+CrVA?I-+R81T%weh4JA@dh2(d>DU7(I5Bhl9(K4GCgZcL3-QNz5>q4lqJh&D-s3z zKGZmW9^2GMKc8EZxIq|bZ0!1-2|Yg8vG*UL*eo+`{*Uf2mduy8b_z19hVoWlPRa(I zeXM9<<~lF(Jd>Rr9-{kYs9h%&8E;AJyS#*+XXrb zGI2!SptpB-dju^qCixK|KM#zZF~K2D&yu;?|3F+3)?ENKi_D^(`5r^olCj9QVoU2o z1=yW%v_X=#yp|wx{6(uKj>2p3S>UTm?YQgCwW{sg&24nNUQ9%iFQQ&Vx@9U$ZA{1$ z-@H??f_Sm_rlkCiiNtEHiIpn>Umgd(h_2R;FGt0A(Y&k=v5dY#Xa8@CxDsrjkERZ-3?))@jEk1j;`9rD8*V1e9BS4Zr>bS7i(Ht? z6%i}wpGvCKkA4!cAA?L_G~^(z-;ZfIZpB%$xKvG~F{^j@Cs9apaw`+@acZ*2b`nBT zQJBboBE6*_k)Gt{nU2eWv<*=rf+j>uX7piPFz+*ZFp6y%Wqv%nZuBCbJ&a)%3s^FR z0?E7)kI4rq)GDplg3P*nQ{{%(D+m=6+zJ~}$hkFkP|i#FWlC8{It55eB~9(drpJJ=)qeUS%uDys{&J5E^EuJ1N-n{?|4)=iA17y z{bruRVrfiHPJXC3*^}Q2`Yv7L(tF<}6{G@5*c6To^Eyd-teB7Ylrq?FJW`11v~n;f z6W;1lQHx(K)_agt$GsRYUiqFZztk9}I=s`xSO04)?%W8X=f$TDz>OD(V?Dd<354XS zseta~8!0KIk@~kAo_+vT7Rywd-4z@8Icxr1>P8M5ubP*`dOkqXMxWqt6Ph-cR`Do# zg%%~ox8zj|AGBgU)NYJouXg=nU^L-+PUne{a+say^WFi%wMD6t+~9UpK}-D})z-u< z=A`qB^UH4c>kn?_``sOufw->tgq`i3qahw68$TeZ>&e&I$6T*hlaG4Z4cl9uC)zAr zsLq+G{Ii-h8+oki&#SA!E8gtSpF~okn32SMyrs*}p4iA051O;q#U~XO#^6 zL8T&u$5Qfse zEdD#0by{CB75{MRj~5Ujr$w{pU%hDs+;%5&Jac*de{@~?-_iZK$xlUPo zkITFmZ@s}3SCW*JR0V;M#4VL0lhNu%NP<(;m`tJf?3yV5>p{{H0W8tmTL&&EBm<4h z@Q?#SHs9;wL^yTolz`hAG*ET0HNPWz>@vsQ5t=)87@VNto&#jFH`+&Momo?=LPi_( zXrehLnYUhc{e1P;$%uSw4B@oa--Syc?;RYrn0yY*JlGCp6@EvjqOu=%O@@k?emoq= z0@=ohK}8-Igx7cw{wM`HinI+%5rGuV8*rlU0!gwhN{ zsLODJ_nImkwlf{T^KHah zA{_~Yx&mdMAmVqVB>`{{P|;%sKRV(MQ{-R42bUXpR#Zq6E*&aK-}|Q{nNU}zaOv6r g|3Bpa`6_?kdPlCkQ-`5pf!q=%*gD#jSW%+>3nF~hk^lez literal 0 HcmV?d00001 diff --git a/HWfrom1-10-016(BigO).playground/Resources/nsarray.png b/HWfrom1-10-016(BigO).playground/Resources/nsarray.png new file mode 100644 index 0000000000000000000000000000000000000000..9080c73f5b6b184cb3b1857fcc705fb8ca259f7f GIT binary patch literal 20273 zcmeFYWmMJCw>C;QQXQ}KC}=$-1mHKF=r0MN zpk9+(OG>K9N=lNcIN4iR+n7T^z5kr(f%xvFVy)}QAdPF7{4g0l^-hL!0$Og>CQ(ub zE*384OKL_s6A3sFdO}UoAg=M1Jhy5Dop1w^clu zR{5lT{G^-W?Va}n+TTX?U<+r9IDCB{%Bb-N<+m{?qdS!*6+O^zf-FgPR9tE#sHm#o z2VS-jg3I}intg#6t_XBIaQt&fDm5a3QH#f z<*@X|<@@L0;L0`Yml0kMA*4@FJw-Ey*)PMN41cgEUr4Z_MTR4NrMf3g-tc4nO3v=r zJsYSw4^>jUG@mi%B1lSPR~>Avx=6HbZu`lEBfJIHXZm91WWfKmdXM76$g(N|I1QQy z%4k)Ry-tk1If+eIp(<~gCaFke##Ys5R)B4O&=|){_17WK!>{T#Rq0DV2mi{{t-=vl zWAbS~hbF_EYW(oAOawz^GzW*}RpgZ~=%5;DcH!{5+`vO-o(n@-gxBw%#=dsXmOH+Z z{*ysEHESn{xQ6uQmXlR#KD}l*0Jf`n4EjYO;rGx8`-F%sQah2hU}-`kOwtv$9>rm# z=9cqA9$QXI2^-#vSf>?CoR%*x(kwDv^H0@>(bBxL-2!AA;xC;S&>wrfrRvImA@HIh zyoZ4`LV^=R(`gmsLxKs27UA`lZnr&u4U3Wk{8%1FBvwJL|CZ2+ z)LNRrA8I_Di=wsnko(?^_J{rovY&LV?#`>oTjcvZN-tGcIoI9xFG_P}V*1g%p_gBx z4FoX}*07K##h(1FpoPz+FLBvW&ytpD$XFSR;5z0X+8lib=gU_XFc&ub%wB>FOKV`n z^zLO|8K8?TQFyiJF&2`J5h=K93rfFT6sV+4hk z=VglR4Kraxavw~FgfS*Qh)Me!BTP(}+~Y0ocyJ_{eD4dV&qCyWbZFrLabH_icoHxY zC5m!TM{&O)fB1AHshop1`kD)VNGyU4X5uFk8!HpaKu1Xxi4C-1hoG?^AGT5u=c-=g z>x!U{tDcSMzEBt)c_*~jh%lJgKZB7d)Iu3d{AbDRLP;gwsKqknV-`z&h)uUD%cjWd zwKRkN^oz|Dj!g~x$koMX@`F7#<(d{RR9^v@E6ihX%K<`NoG|L30(e?u` zdb*7{t3S`y&JxZlol7a2>^Slf5h|e-1!gH~>0z=UCw~$QDE+n6Dcq^J>bv^KUFlx) z$E#%ojpclT0X#-_vklb%p9kA(~)1VpONRmp`CtqZp2Ro6k(eJ?^STX3bli z0!p1!B%ov-jkBhnBHnnoL9vNHy>LV^FFC#-MS0uk9ji;C_?-o$;>4N_2AoIbp2KxZ;chqnM`d=yoawp zg{8_y^##)>(1#SK?TSnwa%3^d@lf2waP}7U5pN<}1ZjuP`Ol?$usY*9)1FbGM!kvb zilh#uPT#^FpiHvXkYRyrfkKeAg`|b`PW)2m z()Ti(XpyLysEtUQ$b|@&C?W$ULpq}~Lxzu#Po|MgFHUcvX}z((NuWu@xz^#MgO{_V zqv4isAMDxN)7d{%e=@drw{AKIdOrRn?9~0a(0P{{{Y5#MHT3wkA?nIYQO&5cvCoKWD)H9);Bg08%gKPF1pe|p%Nt$z7jn_^PdYp z-+V3)ivP@t(*E)*mMShXCO!5p_6}E$ z#9PFFPf$v>i+Nv{`!7(hMx>s3_TiIr8VE?OSZqcmKsl; zPmNEeO}&~-oXVT3Eb*I&8AqD_HhrB#U$|SUUBLgf{!K)#i`>U|x?&6Jclnp!qHw~LW8g9`_Nb9GJO9^p6os5+=#5o!^R^0M+JTZ)Xc z{fm3wrWikB?X&G85E_|UI8R#q)*R#+znpembX_y;lBsq1)vC`Te_L$;WS)^H{ z$GgzG-uujF<<9zM>(1w7=2Ub~6gLM)<@E{wC|MQPiC2uZ%A3&(2HyjmVy9h%K#uO2a5=~B2=_^^HUKyb(S!srDYi91MT z&8V+4ktw?@%VzH2=RpC{aYmM;Q%E>Q`S$IWNWc0pqiCcck*oVj=y2@WjlxaX4USBC z)HEp$Uy_SWMMvJM?^hG!H(1qlg;sU5HI3C$jhhaAYSv=AVyV8`OO9C^h|y0%YtFgt zdJR9m2R2Z&nEWwY?fa@uQ?$qUh7nbHL#ZdrS8MCtl#BGm;OAOB%i0l^Y*ayB&*h{0 zB~%7HmUn0GcJzZ-yY(_k94mKQ%-oBsHA^nv5$oz-nmh1spY||jX(3eV=-IXxdX`@{ z_g-x9rr4WJNnRjdOrS%f=Y6U8qMSCEK5zeF@rR@Q?R1kx=XT9PS;Lu5C^J5DX?a+= z=#kXo&Eob7&)CtJ$l}`gpM#^zmS_QHftF+Zm3{E|{)fZqJ-fC_-}Yje`l7Xf(@(bs z1#Nr_MK zZ%-&TyRMR}S^Y4MeLwpoa{uI0yH4A2*&+<%b;;|`Yv@7i@$5P538DQ#E7JPKvxO`5 zPt=kAn%CnMo=C5sRTf9q-d*Fy#%58da=WOduko$Zed+bg{tBr5La9YT*|*5oFtaap zD?^yKh;Qcc*JaQC&FIaFXsxf~qdD1`d6cS2e z%_D<<4({a{tkE_R6sQ7 z4^F&sOQIKkk@&Kb>X{;3&sP1zj@c^yqo8S#b@uw` z!S#T4C-v|8aof?%Ds`9SY?-zl+x`UJIho;^Zq`{pdojn=uAJ@FteCH(4aO_Kk}3YY z+osF1I(nV--sC`SvFF+n`AZnJY;_+GeJ*{wI%$!{Vbn@3rM}m35}J4SjL)Z3x62tK zI^mSW#5BbrWP#1Z{fr{tl(Uncv1|7WGK^7&%t%ai^lJ34=*W`>6Wi$bg_j-IEp7_J z!{hmjOc=G+&aCmgONd$0roaYj<%y;7jZE&JHy94552ab^Wd1Tk9b|I`XSmOq(8z*u?TiOh|i?&hZe@- zO$B?JdO~PWR_2vCltjGUPFmOQrZ5!M6QWOgYLp4GX+-dRt8c@f=5Lul=omF0wj5q{ z;-95<&)L>m?!fIZ_#!=iOPxt4z0|C>qmNk71Kp2ro_{b}mxYz?Y zh6!lPw{rbz&9a(u74HHJ*cGjHx+Lr6^`-NqoZl?S6saq}6`eBbecR19Vb-fKF0`CG z?esg%Ebqg9{X>p^`GaYQy%K0xS3go;cnRB;$hC4_yL~^a$A1TID}5#q5u=N2>lo>L zdq?$Nfhmg~pTU-;lrPKoXX#>L9B=45ea|Iq|*>E7_WOlD!X&HG1G*{L-=;g2?~ z)>CqmvHM9Z?JcL9A5c9FGn-Z4XV1her7VHK7LVm|+x-hu%x}uQj)NKwZ5sAQn@T6? zU6ga>b9MLHOrkGg&kXKDc%maoKVJ3;V;%1J$~~cZ@(7-|I;?u^jDEqhG$6r`^4Q|b zJx{y1h~^yuGVoTkjM8jdVyaon{q518yJn0g^{=EuqG7%|H}~iAQ(Akx<<^6stE*3( zg|&@y(@mMq6QU-5WrL)5^iR&4S~oB*V;2o)Y8_6)a{CtdpK}JP7=H%obscnIS1a-{ z7=-zggC>Y*Zet>?x4=PQkJr7C=L$q-z83JW7&RGm`MpGGe;0He_Qa1YbYH#kmsjzV zuTp7q$m=C!Cu5=eO4($}=(1o?46}R2p;#mA^y}2{Wm4kX{zZoM5{3`bdpraS+_v>) zb&4(^(AEXqh4sY_n!)R3E(Z1}UPrD(ZpySTDKpynx&qp=+8bp(wmP;04Mp=F^ZSBG z{3b*z0xo=7jZ`hojr0dO3xAd$hKJYn*GRgvgt8_Qlq#{0#Yk}tGmiZY6a7H`;$+UN zQll5EgP6%GVWS0AM<)kJ6K@qZi9a|cI89!G_g){rKbn1PEOTGFz6nZ`lEd~I-`Iqu zzoj22ZWzaQEj=_?oXE&()?$V21J5=Hsxv#gJ{7=1Bffc|WR^L6*%#ZJDl(bS!a8zP z)v?AZW0&jIyZ!pEdIr7-^&x^PT;!EjGF(!4avN)lgV3Fndz1d>b=m3o+M-*AQsv`f zCq7C~i^qc{=a7**eTR}|-?5tR>o}!yr_4?BEXLoAXIh4a`;ETa-EFrg!Pni3g(c}j z4O!fNw&ZmvOJjD&REHx8)SWPt z*$S+f4e}6Y7}V@I^lA>mDmxAosXW{$eSG@}29m9#)pQ@y?3m4a7`oi1LTU#|&Ovtv zsFwlGImqY!SZwIVW09%|LpV!c>F5wk0(El8tzH#|P#fdSA}+&fbu_GLonZfru%gWB zHP|FNg-Y$NGT|CqWF~Y*KSPQ5)o<)(f?={>9nYtkfyMGd>kDCL{2!X@cizH}gyM0l z^53W;$4@5Q$KQ=BU{i-0|CYuM*px0Qcw^-@YEWdFgZkA=to@5fv~QF#;xBz^{B8~! zfjc|6PkL>(r?G@;l2BKG)Tp4aH zpqA=GB&YTU`SH9MiPQOG*qg#@X1L!7!w53L-pHtE*^&7wGPz48Sv@yYCsZ$}b_&vt zr7stk30sr}&Xxjjw3YbLLOf5ENMuFi=w}Vg)Yr9>oK05qHO)s-XU`O-!nlw3h$ zC@`v(+U#E;2DRC)LNgm72#LMy1^y3^7Db{8Aaa123~*&b5)sGz9nifDcN&EK6$Z>P ziK^J?{vM7;f-)OAJK(sJbac=F!BGr5Hs0#R6Z)@!v7R84aQ4g;{4%I%g!JInNMadh zN7O|UJy<&e)_|*StyM#;Mr1)GS|od`AZr+FmI)?I^w6f?s&O3j$>-2R(aK}upk>g~ zImdYy+UwxA!R*pr-7GZBg$Ok;Hw?8f&ae@$~B8i2BVU5Q6yM}Fg{>yAG?O-xgv*ayV z6ru2OIfQ;YhOrWl58QhgTp}OYKQQh$?sxAef*W2d;5!m5q?n~&rg3UF>Kat(R8`jr zH~VyC{W1>OkS%g!8LtSl6F#~Z#BpmqpUj)|M7<_D%lo5@eoeB8yGUAsqe(0trI6DW z#uHu~Wg1l}%cVr1EGxS)>%+g~empAjG?)r2tL^JQ=OV z>KWdsX9c8@FBrS$o7SC|&m(pzW3;pQ*k@0qDL-gbrPRJ`&aKDyV0hR{e=aY=UZ%!&-Xb#V2^gx*3Z>dd^Rs+I^H-i5;$5&AtJwtqQr>Rh=iem za>hP`83y`DE8MyKOVnD8^AZq-$85?lu=*Vo^J9Q6$oH z!(PZK{?JUg3_5zzYKbr%eDwugL1$=kh>%&MJk1u()^MRf@GYN+i;^R*i`S;oQrEg; zrpfWeucE~f1}L0atPGrHPCf28PL!yuDB|c5xddebMgBC4`VjU9jqduvKv=Jubte;N z;TNXSlSD4`WG|Oll<1}el!Vwd$9(t3cPA_vMh@G_R3CC^%98YE9L#sP2QSh*d!$D} zf0FiX(~@-EelENb5D;uVDhJ_R^$LSM!M9*Z!}IupBI^-Ng!t?yZ>-1DCB~~*TKh=p zkKJp?XAK_lKF6}8XhpdqS@)BdHy6prhFV3P=lxf#oRyaLL%0t}Y024!_Z|<)PcSnQ z3%Nb(r^hwaUklRA3$_**PZ=#W`8A!V*GadE$l4#T{jDybJK7BNGjZXevN1YNW2dH8 z5=%=5ipI<~aG~5JcpewD{ifMq9K0>iFW$a5c)apsdVUeJa9jmC2btFI-h*bYA$I}bTU&FGF`2uqjh(ZAyD-JGgaGh82w|Z0N7Go_`CNO9VxT^}kFn zg2K*B&jAI+O(82K{>~lxa0%Igc&c^hPrIxBVY-_v&vG?7dv}UEw24A19E{RI&#IUM z(xyhRnaRw696Gm$`paTjg}HY$K`uY3l&a^uF8wjFU2QmxfMl|+*qvlES7Y|E_R{>; zFaK3sl^L^7jpzyckpga_aLSHfRx6b?y1d|!3`6J!7|N*@L;lLf_B{GW6VGA1Z+ImNv^WkK7_MB#8sp!RAV9pC?i&7|bRZQbDJd)aA{*OVeL3BKDs8vHUeEQ}oN!1EtH9pGP&A=|BtbNm%3 z!y^N~_d|jDH-iH_l0fI7u1@f?Uj7#_aK!t{&`^KpLaKlgr)~6+ANc!Ym4Sbb=>t8~ zzb$m)0$XUXx5odwg=thwP?;z^)L(OvH3H^Xy<}#Ve6~l2Cv;%cMG+L#UjxHw`RCv) zwiTHF{qa4k*l6|ROW>+L8+sK5Fx^5!9ok=G>;o!JXTw1K-4Lc8a10K2NlE0-J1}a6 z67RWHhl2XMyFf;<(f{2nFTC0I`$BcFD@?T;oUA&R#&U~-Yu-i+1i%txlC!~9`oAFk})$g3-_<0|GR@y z(*9VPN;~1 zNOp5`v%T{f&md-cS~DyfeFrUOec0;3!LKs+IcF6=VgDzFqbZYhYqKng{GbRtvqk5>_vJHu zx}Dh)T)ByABD%;UedsOwDRBJbOu?Uj$yb1)&U%98rbqPAn8m{ypHZtKVQU~6wUe4} z2buXfvWJoY;isYPgOyc`&)sDh3(ky(Ks>E-(%_(iv+RDnvIx8UunSjFL7s8_#oOKgWjI=q&>5sOu>gxs z=W|#DU0m6ox$WQ`^f#VkrHE4M$KfFO3dVKT45elW%vMT0JVt`0eDKDfLuNn@5*K%a zys5nIY+C$FQpPZ3S7r}daL^$r*XW=7y|xZG`4asFG{7hF@1p!~y#C+h1QbdCKV@RQ zfUB!1Iep3WyQCQ?Buo&@Xc!kXq!ci^h9PkBy&DzRz5>T(3vOB_vQODk^e(n55ILwNQ*c&b&184uxDMHWQeTeuAy5 zbou;mb>iD2ZAoNp zxi7dS;d2lpabJbz2OcF!Nk#=zqKh0&14)aJ*Dm2|*-M#$k#VT!HZ?c{NF(%2OkAQs z0qWBJ^EqDlW5A!QO$GNvY}HD-)L6L&mpvv|W8=w>{xQ}}7poVU-CZ8mm=C*`tbeDnfZL3^(o*l z1Gg9Z=1a{kaj~&$uUxvd%1yPk=kTvg5uZcvS5%?)Rs)_^Rmwx#!x~TPx83>Ey<>Ux zlB_3OD}zHr+*WG5#9jGO$5*0(2tE~ zXtm!a;uDXnQe=+geYIL_bj&5E6BS*Fgt5*UA9xR(UA)KHcIq+4rr-Jdqdy2WqIb{b zFPf53PZom5{e>LA>I98w8-oms2rt#2Kg%Nnjzv6Z6|M(|1(4-`MMkxOscDwZ;TBum zD#2EY$IR5!Z~6xYT0~e_Sa{YXMJJm0Foe%zZrTtEin4v@69i4W(dZc%IL@5U-xIh8 zW9ys?0-#mDXB+Q14IIOTXX0u;?Hu$A#LwCEG+CfacgU9Y3y2k34WpPQtz-P(X<&S-<%Y; zZ#7)$_wcdyK<}v#C+R{hiG_PcUTZ}7Dg#-v8RlbEdK6vtbGh%%m^0ApcLz46r?*cs zKdafAH_xMH%zX0OFRy8rt7QO#=?2hw7mbd5ocGHc!j};(I|Jb@Bx<6Lz~N;;-I$h> zC*SX~+c;b~Hu_b*yR!Y!lQTe@mVIB-(C`?|rF($Na=gai`?&0Y^Y$QnawRC??amyy zfH8A)@EIVn)xb3W+*>Zf7znvj?prLjuCdsH>l-55jI^l?dIGZ#i=GgF%=_iXWJn~= z%6+)fzM_{jK9-J*Llf#%NvKaykz95j7jM_xFQ;X_TbL)HUZ}9k?j}8Odp@B&^xy=d zZ?)G-u9bLZH}F?$=GsCndne|7x5kqTWf1} zoER@<3D>8iw!ODec1QgTS7(m~+)%q1GZuI1>-G>lunG5g|5Np*ofWhwx9Rs}mga5# zfq@r3lISUvq_0F?YpDQ{Kmq~BVeyn(D3e~S>FzWf6810+0-hE%S)$v<9S5RxD>C2q zBC|Fe%VCUgIj?ZXqdXtWEM1kYR=v=PO>xFIyClE6Z9YpFr&pBxNtsA+!~+5u+Yr3^ z9SMw5ik=?61rDPbGv8d%$)Np8^*C2s@U-MQzEJ^J`HTevutsB??+itgKlKm{ei9hs zIOY0i`4O(rFk~Dva9CyX`URv0@wbQfWTl)zbg7A4Y*@m*495cfR2qbSuDdDdbCfAp zYD)WsKHslY4)2I(#{Rxqt40zKIe1y}To$o$LF-FbC{xZTW=s2C{!aLc`?~>#5&(`0 zTH~02w|Ce;lie@xD}PT$mW2AOYC&JjKe z^N9Df`$!Hw>wSwk8k0BB+i+aL1NiuPIWiOF@vr{NXk>x!+0b>Qz$Bp(0Wt<67D=&1 zpVtAy?81Mgvw_!$3Iaenc0Um;AR*Sl3EiqSTsRYze(JlohrE}@eq0{{54teFpMgvJ%XLw; zzX@gJo=aw=c(EqVz~@69c`+5nLix0oxZy$Iky7^QJ(D%@ z6MZU&$lM~MrJkLMn2ro51-aO0SP)0gGgf$A=kHaSF(dko>#DzLYhL0gk<;o;o7m_Y z(euYA1;EEd<%@pa_Hl!$8G8esYV>{pF>${nI{55qQRV<0@*n^8eKi_WYph<~M80~}&aTPQ&K6?6 z>3dW~_l;1T7DXV80pjF5NZ?i{u1zALX|fq6V%wv{c#`niue){ZkpLaSwywqn@tTef zNH&GY0bf8|w7itYMurxwaJN`w;PX$vvY*}ICo2%@xc`bl@@?cW#b%J-`Cx3_RL5g8e-!GXQ`2 zW`~n_l?^Z^em)XkAj>eqd9Gl_cx}BOJH)c55~p3?B*KIk!=Dhw>4lUWz|zoLM?EuK zMsNn6SNTG>a;cNN-@}(LQUD2)Aay`ONxxqj;^ScQ9A3El4fT*Abm&T5p6;Lw73`;% z7h>yQieNJIvz*jkLpCpF2m|QimBr6Q-9reG)D{SDA-Ve8wUY%Ck^|W`_j+c|w2%ATy~Hek4G^ zsIudeA7kQ-D7aB;n0e-vlcboJ@@Fh-esN2wS$@bAMj;)h!+Rw~4N2+Uk3T)?er5C( zyK-e{-b(xDY@}D@P(W0zf&+b?>c)$f)3A-umToh$2>#vG4Obdl*L?*z#)=yjF646O zDvN2ox1D{*)WeuQ6yJMcz#oPjlmXuF16Q(()85|2yn>|eHf#s2_ryZetBbU>x)u67 zY37@4d*m$)lB3n7?bghIN|>4fM~r2KJ0WI6{m60Yv6$1QYJ4ycfK_fM)*vAq3g#0w zxb-K4-@Eagwvk~ZcV@BCKROAgkb{(mZ?3Gm{nJ2O^|OEctiyhY27FyE^9@2TVt$5M z(t2O6oyv-r8Q+IeN_WshrpYf7`i0;_dP!;NRwp89!uq-i@@EOBvmsu2aq-UN@O}IC zOhLDPNep2sTU%QW=WPY;R?m9+efiHP(2yxH1C|-fAXlKT2YPpbjO!Ct=CFZ{y?yfC zQH!$3!?}9XX+NW)O4CM^V183mlZ@!qGpVpy(Q*_A@CbcC8dLPRJ8alu^}C4xyUjw5 zoD3zy?z4s`9ZRTUfubsd*y!#-<3BD2KS2A3d-eS)qG-&+-Ictms%mt_p?y10@5$TQ zRp>bnaYO3Ln?0>|1|X+5BP$A{tU*{EOely+x0Mu4KWjkUa)m0AfkBrg2r1p&(#}ov z^z^dB0{cvT0|W8>{rw~l%PYPDacA+__fh~mv6&Yw66dz;(G!$8`#!~s>=X!#Fysz1 z@znYwRkv5AXP%XC{EO;T|_7o<)VX`0f_??`WZp-~kh8fD>&1PGG^uq4fR6UWB@X=9j1IC+eBO$o7!cmOl$%m9x4J6U=8mPK## zq(P>)3E!tJc4z|=L*pdbWt=w!!*eF)5CzimDCs?KyHa;OK>4gCJ{KfmssZ9ur{aO{eHuAoJqgZH)MzqnSjL9&Lwl7TR zS4pMP?t}eX!@EBo*8nA+`5lKwfzA0N2yVMD-7ap%z)Nv&Z_jM~cNooo(LKBN?UXW6 zy#T-&@|`GD3H$f=qMSah)+u+7<(p&UZJykKJ!DdKYvPa?oG`2>O>k8j>l#e7SeF0 zYVYh@g_=O9@>~ru$>Br42R)HRKRFg5LH$Pv(g8C`JLT4k+LrQ)?{EoM;6!b#uS?Ow zUo~9RXCqKPjNJ&?K;jh_Di|I5=??adKKag0DT>*8N)$Zd*doiGT{P4ac6MPUB7w^7 zyzsimJ5paEVmVHL8i)v;dUuMHRL@=5~jZ3U>2pi zdh!m=FFLUb5$U}CWDoz^^~82Yg&lBRBQrPw7F|CyLD>V+vZJFv#GRkpS%GO~1NK zy92;uy^2$F4AtT_fH(-w>v6*Z0t+49>|s#)MSA#{{+v2G-2@Wh zC#Sn_v(_TQsL}!I|5VEB2khMe)MPJr<{J99=4^4dkvG5Q^J(wvmFPGr1)CMHH;TSj zzKkY;9zFu^GJXKca#e;La>-+k13PMSbhVjTi)AI&w~nGoDr#jfqm=eMkGog}0`r_5 zT@NZ^VGAzQH0NwsG#>W5^33|LWB3d4dcLB;-7|EAMj3hqdy@N$O`=#;&FQPrdWG*x zX>t4bmW}DrI1#=(4$7GR?s~?xf^!H((RccH+bttT|pBbnhE@ z>kz?zSV~yJkWm!XUbhkCp_v$*UNZlRc9v?OM82mtFm+e2M4+666hRdz7k(QQC<1H> z1q=a)f$wqt{X-^>(~lb25Bs_W-8W-KoJ$^Tg)P?ZW0o?hD(jI)jk+E#5g86J;e_r$ zl2VwJjf_tG9rW7KaEWZwSJ`l%KxgQiYAL5mzO#K=+Ct`7I!)~WK&Lv*-P@#c(aZ_8 z$o+ar2!Ibvkj<|3JWw_nbLu7hw0Q_RB5NJu0BJw4n&Nl;ar9H=hI{9q^UDLc-AEbYV#xuOe)lo=?aC!X=vQsWk?Y{I zucw()ijnIX(9xolY(HW2nhDlktezl|t=dCpM%Nz2N}d|4mN&h-SZNdP6yhPjLgPI; zb1VHu40DOZmTRhPIH3mQoqT^m(w$!qMT0eevLBOSQk^wRaNHZ$mdWVnhy$>Iwrk{T zVML%{6-5OWJo4CnJL8?fJq*i6D|pqrrk0rP^`)8o#2h+sI9c%;00vBW*Jr3QTdCz+ zG@E+0pt>?00XZ6hXk{Zwr~ojIQIyj81wOYlQ~(AWn!D6*UhWn)e$@{#?tE0vhZK5Q74u7c^KZ4H7Q#z^yfV zc%>*q{UyKQj+}%*8f{?!YlkH8xQqG$XgXv4MKA1(r4$FlYnY+=z{$qV6QKf;lQM^~ zG|Q{>r;tZRqDI^9D~3S-9hkD_(~JZdEU}Ien6k1{=VKLKxF2{%QaxVka)8rhqX3(2 z$zqB<%$};M=`Zq;s>eLh0V?Nux-D{le^z*qNYpZA(YLzgCRU|fKq7fbssQsu50K!e zhX-tt4F?dK8+KiSv6+iq21Ed5AAfzChM+E>|#2r=5uv}qCE@}V?RWk5Wia#Ev zZ!}FfN_ho*B45RTX3@XNBmD*s+!ZR|uK3;R7JGZICM0O^3;+>4GsG#12V)D3y2}&v zGF%)gzzWMqidM%n+>^pztR05HA)+?%BMVWg@uz;9EXw*y7}MR zrh-_@+YvG<4P#7M)Y-!)-gL7fy$7&Ib@QFIHzwR7Sq`+AAFC_O7eW)AOz|{N+ReJ} z-{pPOdqTeu>NSTX5fLZ$fm3RV@;C(uHtZ(O1f{LcedL@nUPc`?naDDB`zynr*GwG630S_6%fu%hQ^`xVZbl^VIS$5mqmupyzzWQv^k06#2(4hEOUnc>|xwM<-?ps!7>zuI_?nbK= zM;ViIpL|J$pj190pdMs1g5D2QO6Lr21Dc>7JDF}&G&IrxViVwhx<6A!{qC}_>9HP0 zJGjEqc5R~F=H2vr&yT{*uEp&*X(*j{puAyu{^Ewv{s%d0+jTA#HMOj|dVC}Sx7>7@ z_QZwTRm%^GRTQg6kNph>4?p|z1U{S)?on_*4KZ|T7AZ%v)uKusw2X`cNJL(yBW%m* z3u+&v`QbnSy>IvWdatyypL0ZrvQ(=w3DUoSbhjH;d|MP!*uEl;1i&J01|X8eRQeo# zjLXcl{izCpg`lxF7SAwN_-c`onc1)m!P?%Qm%OOHUIPUcRdKX$aPUBt#U4`yI=13OD4rC{{Rs0G^XV{r$n#C}KmNO%UQ$TP`uaJDwVfnc<#i;^_W~->E4n5D^ zf*R1S8o$e4g3U^s{&$->ic-z;J@RjP9RJ;KVfza1qs>m}iohHASlLR0A$ng07*@{I zv?osgq2~Y9b$Nv@0yNAcx6fnhuf7a7%{8@a8q7ONT#{PHFwo8dk;>(By7|sdZ+^9` zg_^C!haX@LTTP5PueMPqphF_vQIeDQH9tRJssbRk0X)CG6Nt(ZGd?~}l18B7dN@xV zPoo%DR>pMJKrNrt``vb7@EG9uAx*F}c|$@T8}O|i@I2z3mR33@(9kiF7#`wXS=5l8 ziMlsQ^fyTJoWpOLt8S5w%Ch2ElZIZ5O+PCtN_EI{J3Va8?PH)LhyXHskT^sOUx5-% z-}`G8xmKon)1DV+9#=QK=;-JiE_;&|4}e1X6%|V7XTYn7G|XE2l{S*(ijtBN1^%<0 zk!0(M!aksN$GSgLne4JZEh{Z8t)*>w`{q*;0?l_Y?&u9SDd~qeUXilIhXMk-w4tFx zny9GcEkng*=Mgzq68RW10jK!HLdIyFg5s}ZH(|>>>dtVO*EM3mn~C2&x>w4F$>h=} zIHl(Rxi&2<1-2w`Z4Mz?l3~@-c=rxmX)zHt(7d~Io0oo<>alS@(&)GWfr1J5_ugai zy0D1`-Q!|h_RB(U4V-NsMuCnN|Az0us%Subz3pi~B6`ifQ7uvB2bb-2KIg^^+zDq| z+TL94-MDN*+PPiFIIQu3v|(Y>`Si@TOGCkLSU@hKjLFDQ82uCM)LZZ#7sNFP&cJW| zou7^n-s*J~9yNWwd_J!3;o&g@^y9i{W;)Ch3)%r8$e4mwXYv& zS-#ZwDR6cI$=?3_jM~n1IL6{E## zzh9Ph9!bxoyx2ZX5V4otS=QSsOH1RT(RRw{VE}VxK{y})TR%H7B{lD&!*hprdzn{Y z#RBN!nLbDcGo0ouijs<>3S%-WV5mMgWR!4{PtqORe0rgf7dYhi->}go)Wg(;RQh! zgh>k^M|$t^s{^2!(g)N8JoBzb@C9AVzD^XZdG^V%^6$EC_F~n_$@|TyX40z{o+Ald zTwI*q>|_tjS!S2Fq$p}R>|TM2n}UfmN6Q$0%;p*zE%Z#)3^kcn18~2u%k!AfCuOt7 zW6o)K^BrIhJxjO{>b0?znL1$efs{u2qmC^~_UA>ELbnqug_QiwyNg)?b^@K+eks%d+osXGIXqxk=ntSe zJl!T5>w!7iDvl0Uk}Y<2ZU+z@gqX)~?TdxyoEW-KFXLiSzG*})CIG_psANY;U$3yv zFd>`(Jm`G8Tz_i&bkca|Ynnh)#-Fo9;Z(nX!*zNY2L|-X0ZtaIVlGY zqwSEuo}tj~hS~Ax^6n^WzJk_1B+g_=2v=W8*jgd376x#2-2As|U@H3;1l?-qhg3cc2PRUWH`9*wRds1ielAA1E1u2~Lk!BwJ2v$53&fZ#?ZJ= zT~R+iyqvQ{bTDe`VgdO#F;*Ac!nXl9-k^8p-_~Tbf)5>~6Bc6&@`ks7zp+<>a*ira z&Oc{I$IDEgbBu2$z1UU-b^mTgeD%O&^B9Q0cTR$1mG zjB`!$SG0(MIIFYuN#B41n*{x^uK>!Xoj`jxT=8%X*XZPQgTPw1hl_Ly*CP0=XxMoh z#X5x`G0~{sxqal{!!=mo(J$J&{?muFw9Em$VImTADuL5H(QN+CqFH1ifR55%lOZk6 zfu>_8*Nnq9iA=jomH%eWU0;_vV6GD-VkrkZv}nDnzb4I^XwIKJ=#G$B+WkCrhYA2z zB~>>BrE>}y&%LpH&pF;TaazBJRq-(`ol{N@!V@&^T>|CP&fJX28^8~PN31M=({$k@ z_bWuuE;hdX`zG3*0%(Z@#Y*Tw6PH_qq(6f43+wBbyvve1&s$q|=@d=8%kXc;{C|D> z!uacXS^pWJlT-PI9s{@vko@CKiP?JfbcIfi`|lw)bUSd(@8>xu0jT^e5ey(7d>(Rm zNGS;1Qh!6>>7(x<{@&;3AE96%Y%^MV49v4I(2=bK7HGdjyMVBiko;l{p!;COx6r^? z$cR-f0IU4v;hrbxr~>BuMU(&UK{Mt_Dd3-#!ji53<};cF`e4R5YX4S4y4CghlT?rwmg#oQvTAB-o(I4F$Gccc z0TKaTF0NkS;SM#>cByDwM}f4J%s0Bfj4v-At*QP$)8K+e8yhejBv)Kv`1bq7;{GQO z4mKAZ<~2XzDjur>>QYRPtMc@lYh~JyznL2v5a8LhfDrv?RaMoKEu6wGB-CrJw-EEMNjYClvNAe^`n7nmc9M_&NcL30nXIO*L*nG@IBof z9RBrOKJ)Ejf%8OvBQ3qNTrYgwu-Np$l&Moafyfk<-qd_@{<=lPJG|yq-a_BDdqZ;$EQwtUA!=9#te%Ui(hzL=n~at z`zl)oo{#-7-vPK3>%UfNWG{!6T-lGE&*x=7dy;c|o3EH&jK*xU+(`?URLZhy>F9ic zS=G=m7dV9>BXrHK`pS2!s?R5s`%h@E-;?z0323$P`MPh$!c{g_EJvYf|9}E8&o&>B zI^%v;?fmW&#s+x|!4$IV+EAw{B^D{1_uC zVzE76 zVi@{?NqV*Y3fQ{t3gAHdM}f(UV9MixITAWn2{w@*=s3BgAQ5Q9|L_LpsP+FAn89-B zLZEfdK3&iZ3>@nO76@16uYlJ{06kzM0<6J1JVA{WaE8_g`ey&H=3CG}YG?;q$8V?! zONf6|fvyR!4}hiO4*@{y6xCe8O(S4=vL7^PH|lvvWQ@i - + \ No newline at end of file From ca1d964e2cddfaf00c768369631f1928b1e4c992 Mon Sep 17 00:00:00 2001 From: benstone1 Date: Thu, 14 Jan 2016 17:47:11 -0500 Subject: [PATCH 116/126] Update README.md --- README.md | 1 + 1 file changed, 1 insertion(+) diff --git a/README.md b/README.md index 2247140..2f8d1c8 100644 --- a/README.md +++ b/README.md @@ -27,5 +27,6 @@ 1/12/16, 10:00 pm | [Passion Project Setup](https://docs.google.com/presentation/d/1Sb6IoD3f842WGugSJZ1s7-4EHgPEdH5RHiT3-H0TI2A/edit#slide=id.gecfcc994a_0_10) | [Link to Google Form](http://goo.gl/forms/qU6GQ8b3pZ) | x 1/14/16, 7:00 pm | [MVC and Unit 0 Swift](https://docs.google.com/document/d/1DQ2aCJ_yUZtazzCfb0PaS81bg61V2ZOSxpABh981xSo/edit) | [Fork this repo. Push to your repo by the deadline](https://github.com/accesscode-2-2/unit-4-assignments) | x | 1/14/16, 7:00 pm | [Big O notation](https://docs.google.com/document/d/1aF1imJUVahCSJAuN1OEm5lQXwpSFaAmVmAETKMM6PLQ/edit#heading=h.za36ai6n5fth) | [Fork this repo. Push to your repo by the deadline](https://github.com/accesscode-2-2/unit-4-assignments) | x +1/16/16, 10:00 am | [Discrete math and logic]() | [Pull the hw repo and edit the new playground in your own repo](https://github.com/accesscode-2-2/unit-4-assignments) | x 1/19/16, 7:00 pm | Have a least 2 submission on your blog. Have a detailed README in your passion project repo that outlines the work you will be doing. | Complete this on the blog and repo you linked to on the Google Form | x 1/19/16, 7:00 pm | Revise and resubmit your resume | Upload to the shared [Drive Folder](https://drive.google.com/drive/u/0/folders/0B61otWQVg7ApUFFjWkx6ZE9VOUU) | x From 9fa32a9843793fc5ddf616b3299541fd4ff8ff12 Mon Sep 17 00:00:00 2001 From: Fatima Date: Thu, 14 Jan 2016 21:54:30 -0500 Subject: [PATCH 117/126] st --- HWfrom1-10-016(BigO).playground/Contents.swift | 1 + HWfrom1-10-016(BigO).playground/contents.xcplayground | 2 +- 2 files changed, 2 insertions(+), 1 deletion(-) diff --git a/HWfrom1-10-016(BigO).playground/Contents.swift b/HWfrom1-10-016(BigO).playground/Contents.swift index e1876a6..190a1a3 100644 --- a/HWfrom1-10-016(BigO).playground/Contents.swift +++ b/HWfrom1-10-016(BigO).playground/Contents.swift @@ -205,6 +205,7 @@ func factorial(num: Int) -> Int{ } } +// O(n) /*: diff --git a/HWfrom1-10-016(BigO).playground/contents.xcplayground b/HWfrom1-10-016(BigO).playground/contents.xcplayground index 89da2d4..3596865 100644 --- a/HWfrom1-10-016(BigO).playground/contents.xcplayground +++ b/HWfrom1-10-016(BigO).playground/contents.xcplayground @@ -1,4 +1,4 @@ - + \ No newline at end of file From 4bfda2fa72d440ddfaead3483951409e2176a78f Mon Sep 17 00:00:00 2001 From: benstone1 Date: Thu, 14 Jan 2016 21:56:06 -0500 Subject: [PATCH 118/126] Update README.md --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 2f8d1c8..edec6d6 100644 --- a/README.md +++ b/README.md @@ -27,6 +27,6 @@ 1/12/16, 10:00 pm | [Passion Project Setup](https://docs.google.com/presentation/d/1Sb6IoD3f842WGugSJZ1s7-4EHgPEdH5RHiT3-H0TI2A/edit#slide=id.gecfcc994a_0_10) | [Link to Google Form](http://goo.gl/forms/qU6GQ8b3pZ) | x 1/14/16, 7:00 pm | [MVC and Unit 0 Swift](https://docs.google.com/document/d/1DQ2aCJ_yUZtazzCfb0PaS81bg61V2ZOSxpABh981xSo/edit) | [Fork this repo. Push to your repo by the deadline](https://github.com/accesscode-2-2/unit-4-assignments) | x | 1/14/16, 7:00 pm | [Big O notation](https://docs.google.com/document/d/1aF1imJUVahCSJAuN1OEm5lQXwpSFaAmVmAETKMM6PLQ/edit#heading=h.za36ai6n5fth) | [Fork this repo. Push to your repo by the deadline](https://github.com/accesscode-2-2/unit-4-assignments) | x -1/16/16, 10:00 am | [Discrete math and logic]() | [Pull the hw repo and edit the new playground in your own repo](https://github.com/accesscode-2-2/unit-4-assignments) | x +1/16/16, 10:00 am | [Discrete math and logic](https://docs.google.com/document/d/1pqdYlbeoJAVhAR7fT7iuHQ0F-mIH3pbcei-rNX_L5Kw/edit#) | [Pull the hw repo and edit the new playground in your own repo](https://github.com/accesscode-2-2/unit-4-assignments) | x 1/19/16, 7:00 pm | Have a least 2 submission on your blog. Have a detailed README in your passion project repo that outlines the work you will be doing. | Complete this on the blog and repo you linked to on the Google Form | x 1/19/16, 7:00 pm | Revise and resubmit your resume | Upload to the shared [Drive Folder](https://drive.google.com/drive/u/0/folders/0B61otWQVg7ApUFFjWkx6ZE9VOUU) | x From b4494731309b4b793bc49bb6a24cd96c49e447cf Mon Sep 17 00:00:00 2001 From: Fatima Date: Fri, 15 Jan 2016 17:02:05 -0500 Subject: [PATCH 119/126] add --- .../Contents.swift | 28 ++++++++++++++++--- 1 file changed, 24 insertions(+), 4 deletions(-) diff --git a/HWfrom1-10-016(BigO).playground/Contents.swift b/HWfrom1-10-016(BigO).playground/Contents.swift index 190a1a3..e8efe2f 100644 --- a/HWfrom1-10-016(BigO).playground/Contents.swift +++ b/HWfrom1-10-016(BigO).playground/Contents.swift @@ -205,7 +205,6 @@ func factorial(num: Int) -> Int{ } } -// O(n) /*: @@ -291,9 +290,30 @@ to the graph of method execution time). Show that the sort method best fits n * */ -let arr = Array((0..<10)) -arr.sort() -let time = CFAbsoluteTimeGetCurrent() +var runTime:Double = 0 +var sumTime: Double = 0 +func doThis100TimesToGetAverage(x: Int, arrSize: Int) -> Double { + let numRepeat = x + var count = 0 + print("to repeat \(x)") + func sumItUp(index: Int){ + print("index starts at \(index)") + if (index < x){ + let start = CFAbsoluteTimeGetCurrent() + let arr = Array((0.. Date: Fri, 15 Jan 2016 21:06:34 -0500 Subject: [PATCH 120/126] add --- .../Contents.swift | 48 +++++++++++++++++++ 1 file changed, 48 insertions(+) diff --git a/HWfrom1-14-16(Logic+Discrete_Math).playground/Contents.swift b/HWfrom1-14-16(Logic+Discrete_Math).playground/Contents.swift index bc0df91..a024b3b 100644 --- a/HWfrom1-14-16(Logic+Discrete_Math).playground/Contents.swift +++ b/HWfrom1-14-16(Logic+Discrete_Math).playground/Contents.swift @@ -1,6 +1,7 @@ //: Playground - noun: a place where people can play import UIKit +import Foundation var str = "Hello, playground" @@ -17,6 +18,8 @@ Question 2: https://www.hackerrank.com/challenges/handshake Copy and paste your code: + + What is the big O runtime of your code?: Question 3: https://www.hackerrank.com/challenges/connecting-towns @@ -27,3 +30,48 @@ What is the big O runtime of your code?: */ + +func userInput() -> Int { + let input = readLine() + let num = Int(input!) + return num! +} + + +// Draws + +let testNum : Int = Int(readLine()!)! // asks for how many tests do you want done +for i in 0.. 1){ + let N = userInput() + total = 1 + for i in 0.. Date: Sat, 16 Jan 2016 10:48:36 -0500 Subject: [PATCH 121/126] Add --- .../Contents.swift | 23 +++++++++++-------- 1 file changed, 13 insertions(+), 10 deletions(-) diff --git a/HWfrom1-14-16(Logic+Discrete_Math).playground/Contents.swift b/HWfrom1-14-16(Logic+Discrete_Math).playground/Contents.swift index a024b3b..84caa22 100644 --- a/HWfrom1-14-16(Logic+Discrete_Math).playground/Contents.swift +++ b/HWfrom1-14-16(Logic+Discrete_Math).playground/Contents.swift @@ -38,30 +38,29 @@ func userInput() -> Int { } -// Draws - -let testNum : Int = Int(readLine()!)! // asks for how many tests do you want done -for i in 0.. 1){ let N = userInput() total = 1 @@ -72,6 +71,10 @@ while (T > 1){ } --T } +// The Big-O is O(n^2) +// Fundamental of counting principle +// Multiply them altogether +// Multiply the combinations From d9c9d91834d675934b1d9d1d85c121969993f829 Mon Sep 17 00:00:00 2001 From: Fatima Date: Thu, 21 Jan 2016 11:29:54 -0500 Subject: [PATCH 122/126] good --- .../contents.xcplayground | 2 +- .../Contents.swift | 27 ++++++++++++++++--- .../contents.xcplayground | 2 +- 3 files changed, 25 insertions(+), 6 deletions(-) diff --git a/HWfrom1-10-016(BigO).playground/contents.xcplayground b/HWfrom1-10-016(BigO).playground/contents.xcplayground index 3596865..89da2d4 100644 --- a/HWfrom1-10-016(BigO).playground/contents.xcplayground +++ b/HWfrom1-10-016(BigO).playground/contents.xcplayground @@ -1,4 +1,4 @@ - + \ No newline at end of file diff --git a/HWfrom1-14-16(Logic+Discrete_Math).playground/Contents.swift b/HWfrom1-14-16(Logic+Discrete_Math).playground/Contents.swift index 84caa22..2168191 100644 --- a/HWfrom1-14-16(Logic+Discrete_Math).playground/Contents.swift +++ b/HWfrom1-14-16(Logic+Discrete_Math).playground/Contents.swift @@ -46,7 +46,7 @@ for i in 0.. 1){ for i in 0.. 1){ + let arr // The Big-O is O(n^2) // Fundamental of counting principle // Multiply them altogether // Multiply the combinations - +} diff --git a/HWfrom1-14-16(Logic+Discrete_Math).playground/contents.xcplayground b/HWfrom1-14-16(Logic+Discrete_Math).playground/contents.xcplayground index 5da2641..89da2d4 100644 --- a/HWfrom1-14-16(Logic+Discrete_Math).playground/contents.xcplayground +++ b/HWfrom1-14-16(Logic+Discrete_Math).playground/contents.xcplayground @@ -1,4 +1,4 @@ - + \ No newline at end of file From 1ecedbb5342e4209478c7b5e4140c3a23dee8d1d Mon Sep 17 00:00:00 2001 From: Fatima Date: Thu, 21 Jan 2016 11:30:49 -0500 Subject: [PATCH 123/126] Homework Due: 01/21/2016 --- .../Contents.swift | 267 +++++++++++++++++- 1 file changed, 257 insertions(+), 10 deletions(-) diff --git a/HWFrom1-17-16(Lists and Sorts).playground/Contents.swift b/HWFrom1-17-16(Lists and Sorts).playground/Contents.swift index 5d51051..ab72837 100644 --- a/HWFrom1-17-16(Lists and Sorts).playground/Contents.swift +++ b/HWFrom1-17-16(Lists and Sorts).playground/Contents.swift @@ -1,26 +1,273 @@ -//: Playground - noun: a place where people can play -import UIKit +// 1. +var sudokuBoard = [ + [5, 0, 8, 0, 7, 3, 1, 9, 0], + [9, 0, 0, 6, 0, 0, 4, 0, 8], + [0, 0, 0, 9, 0, 8, 0, 3, 5], + [0, 7, 0, 0, 0, 0, 0, 6, 0], + [0, 0, 2, 0, 0, 0, 9, 0, 0], + [0, 1, 0, 0, 0, 0, 0, 8, 0], + [1, 9, 0, 3, 0, 6, 0, 0, 0], + [2, 0, 3, 0, 0, 7, 0, 0, 9], + [0, 8, 7, 1, 9, 0, 3, 0, 4]] -var str = "Hello, playground" -/* +// vertical box constraint +func verticalConstraintBox(row: Int) ->[Int] { + var maxConstraint: Int = 0 + var minConstraint: Int = 0 + var constraints: [Int] = [] + for i in 0.. Set { + var verticalConstraintsBox = verticalConstraints + var maxHC: Int = 0 + var minHC: Int = 0 + + if ((column + 1) % 3 == 0){ + maxHC = column + 1 + minHC = column - 2 + } + else if ((column + 1) % 3 == 1) { + maxHC = column + 3 + minHC = column + } + else if ((column + 1) % 3 == 2) { + maxHC = column + 2 + minHC = column - 1 + } + + var arr1 = Array((sudokuBoard[verticalConstraintsBox[0]])[minHC.. = [] + + for i in 0..) -> Set { + var notPossibleOutcomes: Set = [] + for i in 0..) -> Set { + var notPossibleOutcomes: Set = [] + for i in 0.. Set { + print("Please enter valid input(s) from 1-9") + var row = Int(readLine()!)! // get user input + var column = Int(readLine()!)! + var inputsWithinRangeAndSpaceEmpty: Bool = false + repeat { + if ((row > 0 && row < 10) + && (column > 0 && column < 10) + && (sudokuBoard[row][column] == 0)){ // check if input is valid + inputsWithinRangeAndSpaceEmpty = true + } + else { + print("Please enter valid input(s)") + row = Int(readLine()!)! + column = Int(readLine()!)! + } + }while inputsWithinRangeAndSpaceEmpty == false // repeat if the input is invalid + + let sudokuSet: Set = [1,2,3,4,5,6,7,8,9] + let horizontalSet: Set = horizontalCheckSudoku(2, column: 2, arr:sudokuSet) + let verticalSet: Set = verticalCheckSudoku(2, column: 2, arr: sudokuSet) + let boxSet: Set = totalBoxConstraints(column, verticalConstraints: verticalConstraintBox(row)) + + let horizontalAndVertical: Set = horizontalSet.union(verticalSet) + let notPossibleOutcomes: Set = horizontalAndVertical.union(boxSet) + + let finalSet: Set = sudokuSet.subtract(notPossibleOutcomes) + + return finalSet +} +//print(getCoordinatesAndReturnPossibleMoves()) -2) +func matrixRotate() { + // matrix board + var matrix = [ + [1, 2, 3, 4], + [5, 6, 7, 8], + [9, 0, 1, 2], + [3, 4, 5, 6]] + + var new90RotatedMatrix = [ + [0, 0, 0, 0], + [0, 0, 0, 0], + [0, 0, 0, 0], + [0, 0, 0, 0]] + + var count = 0 + repeat { + for i in 0.. Int(letters[i + 1])){ + firstMin = Int(letters[i+1])! + firstMax = Int(letters[i])! + } else { + firstMin = Int(letters[i])! + firstMax = Int(letters[i+1])! + } + } + else if (i > middlePoint && i < letters.count - 1) { + if (Int(letters[i]) > Int(letters[i + 1])){ + secMin = Int(letters[i+1])! + secMax = Int(letters[i])! + } else { + secMin = Int(letters[i])! + secMax = Int(letters[i+1])! + } + } + + if (firstMin != 0 && secMin != 0){ + if (firstMin > secMin){ + finalMin = secMin + var newChar = Character(UnicodeScalar(finalMin)) + letters[letters.count - letters.count] = String(newChar) + print(letters[letters.count - letters.count]) + midMin = firstMin + } else { + finalMin = firstMin + var newChar = Character(UnicodeScalar(finalMin)) + letters[letters.count - letters.count] = String(newChar) + print(letters[letters.count - letters.count]) + midMin = secMin + } + } + + if (firstMax != 0 && secMax != 0){ + if (firstMax > secMax){ + finalMax = firstMax + var newChar = Character(UnicodeScalar(finalMax)) + letters[i] = String(newChar) + print(letters[i]) + midMax = secMax + } else { + finalMax = secMax + var newChar = Character(UnicodeScalar(finalMax)) + letters[i] = String(newChar) + print(letters[i]) + midMax = firstMax + } + } + + if (midMax != 0 && midMin != 0){ + if (midMax > midMin){ + letters[letters.count - 2] = String(Character(UnicodeScalar(midMax))) + letters[0 + 1] = String(Character(UnicodeScalar(midMin))) + } else { + letters[letters.count - 2] = String(Character(UnicodeScalar(midMin))) + letters[0 + 1] = String(Character(UnicodeScalar(midMax))) + } + } +} + +print(letters) + + + +print("final min \(finalMin)") +print("final max \(finalMax)") From 757b735784a50f2fb4d8a9541726c1dd108fe907 Mon Sep 17 00:00:00 2001 From: Fatima Date: Sun, 24 Jan 2016 19:23:30 -0500 Subject: [PATCH 124/126] updates --- .gitignore | 0 .../Contents.swift | 12 ++++++------ .../contents.xcplayground | 0 .../playground.xcworkspace/contents.xcworkspacedata | 0 .../timeline.xctimeline | 0 HWfrom1-09-16(SwiftIntro).playground/Contents.swift | 0 .../contents.xcplayground | 0 .../playground.xcworkspace/contents.xcworkspacedata | 0 .../timeline.xctimeline | 0 HWfrom1-10-016(BigO).playground/Contents.swift | 0 HWfrom1-10-016(BigO).playground/Resources/n.png | Bin .../Resources/nsarray.png | Bin .../contents.xcplayground | 0 .../playground.xcworkspace/contents.xcworkspacedata | 0 HWfrom1-10-016(BigO).playground/timeline.xctimeline | 0 .../Contents.swift | 0 .../contents.xcplayground | 0 .../playground.xcworkspace/contents.xcworkspacedata | 0 .../timeline.xctimeline | 0 LICENSE | 0 README.md | 0 exercises/linked-lists.md | 0 exercises/lists.md | 0 exercises/logic.md | 0 exercises/recursion.md | 0 lessons/week-0/2016_01_05.md | 0 lessons/week-0/2016_01_07.md | 0 lessons/week-0/2016_01_09.md | 0 lessons/week-0/2016_01_10.md | 0 lessons/week-1/2016_01_12.md | 0 lessons/week-1/2016_01_14.md | 0 lessons/week-1/2016_01_16.md | 0 lessons/week-1/2016_01_17.md | 0 lessons/week-2/2016_01_19.md | 0 lessons/week-2/2016_01_21.md | 0 lessons/week-2/2016_01_23.md | 0 lessons/week-2/2016_01_24.md | 0 lessons/week-3/2016_01_26.md | 0 lessons/week-3/2016_01_28.md | 0 lessons/week-3/2016_01_30.md | 0 lessons/week-3/2016_01_31.md | 0 41 files changed, 6 insertions(+), 6 deletions(-) mode change 100644 => 100755 .gitignore mode change 100644 => 100755 HWFrom1-17-16(Lists and Sorts).playground/Contents.swift mode change 100644 => 100755 HWFrom1-17-16(Lists and Sorts).playground/contents.xcplayground mode change 100644 => 100755 HWFrom1-17-16(Lists and Sorts).playground/playground.xcworkspace/contents.xcworkspacedata mode change 100644 => 100755 HWFrom1-17-16(Lists and Sorts).playground/timeline.xctimeline mode change 100644 => 100755 HWfrom1-09-16(SwiftIntro).playground/Contents.swift mode change 100644 => 100755 HWfrom1-09-16(SwiftIntro).playground/contents.xcplayground mode change 100644 => 100755 HWfrom1-09-16(SwiftIntro).playground/playground.xcworkspace/contents.xcworkspacedata mode change 100644 => 100755 HWfrom1-09-16(SwiftIntro).playground/timeline.xctimeline mode change 100644 => 100755 HWfrom1-10-016(BigO).playground/Contents.swift mode change 100644 => 100755 HWfrom1-10-016(BigO).playground/Resources/n.png mode change 100644 => 100755 HWfrom1-10-016(BigO).playground/Resources/nsarray.png mode change 100644 => 100755 HWfrom1-10-016(BigO).playground/contents.xcplayground mode change 100644 => 100755 HWfrom1-10-016(BigO).playground/playground.xcworkspace/contents.xcworkspacedata mode change 100644 => 100755 HWfrom1-10-016(BigO).playground/timeline.xctimeline mode change 100644 => 100755 HWfrom1-14-16(Logic+Discrete_Math).playground/Contents.swift mode change 100644 => 100755 HWfrom1-14-16(Logic+Discrete_Math).playground/contents.xcplayground mode change 100644 => 100755 HWfrom1-14-16(Logic+Discrete_Math).playground/playground.xcworkspace/contents.xcworkspacedata mode change 100644 => 100755 HWfrom1-14-16(Logic+Discrete_Math).playground/timeline.xctimeline mode change 100644 => 100755 LICENSE mode change 100644 => 100755 README.md mode change 100644 => 100755 exercises/linked-lists.md mode change 100644 => 100755 exercises/lists.md mode change 100644 => 100755 exercises/logic.md mode change 100644 => 100755 exercises/recursion.md mode change 100644 => 100755 lessons/week-0/2016_01_05.md mode change 100644 => 100755 lessons/week-0/2016_01_07.md mode change 100644 => 100755 lessons/week-0/2016_01_09.md mode change 100644 => 100755 lessons/week-0/2016_01_10.md mode change 100644 => 100755 lessons/week-1/2016_01_12.md mode change 100644 => 100755 lessons/week-1/2016_01_14.md mode change 100644 => 100755 lessons/week-1/2016_01_16.md mode change 100644 => 100755 lessons/week-1/2016_01_17.md mode change 100644 => 100755 lessons/week-2/2016_01_19.md mode change 100644 => 100755 lessons/week-2/2016_01_21.md mode change 100644 => 100755 lessons/week-2/2016_01_23.md mode change 100644 => 100755 lessons/week-2/2016_01_24.md mode change 100644 => 100755 lessons/week-3/2016_01_26.md mode change 100644 => 100755 lessons/week-3/2016_01_28.md mode change 100644 => 100755 lessons/week-3/2016_01_30.md mode change 100644 => 100755 lessons/week-3/2016_01_31.md diff --git a/.gitignore b/.gitignore old mode 100644 new mode 100755 diff --git a/HWFrom1-17-16(Lists and Sorts).playground/Contents.swift b/HWFrom1-17-16(Lists and Sorts).playground/Contents.swift old mode 100644 new mode 100755 index ab72837..07f24b4 --- a/HWFrom1-17-16(Lists and Sorts).playground/Contents.swift +++ b/HWFrom1-17-16(Lists and Sorts).playground/Contents.swift @@ -160,11 +160,12 @@ func matrixRotate() { [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0]] - + var num = matrix.count var count = 0 repeat { + for i in 0.. Date: Wed, 27 Jan 2016 22:05:36 -0500 Subject: [PATCH 125/126] Homework 1.23 --- HW-1-23/Homework.xcodeproj/project.pbxproj | 246 ++++++++++++++++++ .../contents.xcworkspacedata | 7 + HW-1-23/Homework/main.swift | 25 ++ .../Contents.swift | 64 ++++- .../timeline.xctimeline | 5 + 5 files changed, 345 insertions(+), 2 deletions(-) create mode 100755 HW-1-23/Homework.xcodeproj/project.pbxproj create mode 100755 HW-1-23/Homework.xcodeproj/project.xcworkspace/contents.xcworkspacedata create mode 100755 HW-1-23/Homework/main.swift diff --git a/HW-1-23/Homework.xcodeproj/project.pbxproj b/HW-1-23/Homework.xcodeproj/project.pbxproj new file mode 100755 index 0000000..b28c4e7 --- /dev/null +++ b/HW-1-23/Homework.xcodeproj/project.pbxproj @@ -0,0 +1,246 @@ +// !$*UTF8*$! +{ + archiveVersion = 1; + classes = { + }; + objectVersion = 46; + objects = { + +/* Begin PBXBuildFile section */ + 3D7466751C59B9B9003A3C9A /* main.swift in Sources */ = {isa = PBXBuildFile; fileRef = 3D7466741C59B9B9003A3C9A /* main.swift */; }; +/* End PBXBuildFile section */ + +/* Begin PBXCopyFilesBuildPhase section */ + 3D74666F1C59B9B8003A3C9A /* CopyFiles */ = { + isa = PBXCopyFilesBuildPhase; + buildActionMask = 2147483647; + dstPath = /usr/share/man/man1/; + dstSubfolderSpec = 0; + files = ( + ); + runOnlyForDeploymentPostprocessing = 1; + }; +/* End PBXCopyFilesBuildPhase section */ + +/* Begin PBXFileReference section */ + 3D7466711C59B9B9003A3C9A /* Homework */ = {isa = PBXFileReference; explicitFileType = "compiled.mach-o.executable"; includeInIndex = 0; path = Homework; sourceTree = BUILT_PRODUCTS_DIR; }; + 3D7466741C59B9B9003A3C9A /* main.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = main.swift; sourceTree = ""; }; +/* End PBXFileReference section */ + +/* Begin PBXFrameworksBuildPhase section */ + 3D74666E1C59B9B8003A3C9A /* Frameworks */ = { + isa = PBXFrameworksBuildPhase; + buildActionMask = 2147483647; + files = ( + ); + runOnlyForDeploymentPostprocessing = 0; + }; +/* End PBXFrameworksBuildPhase section */ + +/* Begin PBXGroup section */ + 3D7466681C59B9B8003A3C9A = { + isa = PBXGroup; + children = ( + 3D7466731C59B9B9003A3C9A /* Homework */, + 3D7466721C59B9B9003A3C9A /* Products */, + ); + sourceTree = ""; + }; + 3D7466721C59B9B9003A3C9A /* Products */ = { + isa = PBXGroup; + children = ( + 3D7466711C59B9B9003A3C9A /* Homework */, + ); + name = Products; + sourceTree = ""; + }; + 3D7466731C59B9B9003A3C9A /* Homework */ = { + isa = PBXGroup; + children = ( + 3D7466741C59B9B9003A3C9A /* main.swift */, + ); + path = Homework; + sourceTree = ""; + }; +/* End PBXGroup section */ + +/* Begin PBXNativeTarget section */ + 3D7466701C59B9B8003A3C9A /* Homework */ = { + isa = PBXNativeTarget; + buildConfigurationList = 3D7466781C59B9B9003A3C9A /* Build configuration list for PBXNativeTarget "Homework" */; + buildPhases = ( + 3D74666D1C59B9B8003A3C9A /* Sources */, + 3D74666E1C59B9B8003A3C9A /* Frameworks */, + 3D74666F1C59B9B8003A3C9A /* CopyFiles */, + ); + buildRules = ( + ); + dependencies = ( + ); + name = Homework; + productName = Homework; + productReference = 3D7466711C59B9B9003A3C9A /* Homework */; + productType = "com.apple.product-type.tool"; + }; +/* End PBXNativeTarget section */ + +/* Begin PBXProject section */ + 3D7466691C59B9B8003A3C9A /* Project object */ = { + isa = PBXProject; + attributes = { + LastSwiftUpdateCheck = 0720; + LastUpgradeCheck = 0720; + ORGANIZATIONNAME = apps; + TargetAttributes = { + 3D7466701C59B9B8003A3C9A = { + CreatedOnToolsVersion = 7.2; + }; + }; + }; + buildConfigurationList = 3D74666C1C59B9B8003A3C9A /* Build configuration list for PBXProject "Homework" */; + compatibilityVersion = "Xcode 3.2"; + developmentRegion = English; + hasScannedForEncodings = 0; + knownRegions = ( + en, + ); + mainGroup = 3D7466681C59B9B8003A3C9A; + productRefGroup = 3D7466721C59B9B9003A3C9A /* Products */; + projectDirPath = ""; + projectRoot = ""; + targets = ( + 3D7466701C59B9B8003A3C9A /* Homework */, + ); + }; +/* End PBXProject section */ + +/* Begin PBXSourcesBuildPhase section */ + 3D74666D1C59B9B8003A3C9A /* Sources */ = { + isa = PBXSourcesBuildPhase; + buildActionMask = 2147483647; + files = ( + 3D7466751C59B9B9003A3C9A /* main.swift in Sources */, + ); + runOnlyForDeploymentPostprocessing = 0; + }; +/* End PBXSourcesBuildPhase section */ + +/* Begin XCBuildConfiguration section */ + 3D7466761C59B9B9003A3C9A /* Debug */ = { + isa = XCBuildConfiguration; + buildSettings = { + ALWAYS_SEARCH_USER_PATHS = NO; + CLANG_CXX_LANGUAGE_STANDARD = "gnu++0x"; + CLANG_CXX_LIBRARY = "libc++"; + CLANG_ENABLE_MODULES = YES; + CLANG_ENABLE_OBJC_ARC = YES; + CLANG_WARN_BOOL_CONVERSION = YES; + CLANG_WARN_CONSTANT_CONVERSION = YES; + CLANG_WARN_DIRECT_OBJC_ISA_USAGE = YES_ERROR; + CLANG_WARN_EMPTY_BODY = YES; + CLANG_WARN_ENUM_CONVERSION = YES; + CLANG_WARN_INT_CONVERSION = YES; + CLANG_WARN_OBJC_ROOT_CLASS = YES_ERROR; + CLANG_WARN_UNREACHABLE_CODE = YES; + CLANG_WARN__DUPLICATE_METHOD_MATCH = YES; + CODE_SIGN_IDENTITY = "-"; + COPY_PHASE_STRIP = NO; + DEBUG_INFORMATION_FORMAT = dwarf; + ENABLE_STRICT_OBJC_MSGSEND = YES; + ENABLE_TESTABILITY = YES; + GCC_C_LANGUAGE_STANDARD = gnu99; + GCC_DYNAMIC_NO_PIC = NO; + GCC_NO_COMMON_BLOCKS = YES; + GCC_OPTIMIZATION_LEVEL = 0; + GCC_PREPROCESSOR_DEFINITIONS = ( + "DEBUG=1", + "$(inherited)", + ); + GCC_WARN_64_TO_32_BIT_CONVERSION = YES; + GCC_WARN_ABOUT_RETURN_TYPE = YES_ERROR; + GCC_WARN_UNDECLARED_SELECTOR = YES; + GCC_WARN_UNINITIALIZED_AUTOS = YES_AGGRESSIVE; + GCC_WARN_UNUSED_FUNCTION = YES; + GCC_WARN_UNUSED_VARIABLE = YES; + MACOSX_DEPLOYMENT_TARGET = 10.10; + MTL_ENABLE_DEBUG_INFO = YES; + ONLY_ACTIVE_ARCH = YES; + SDKROOT = macosx; + SWIFT_OPTIMIZATION_LEVEL = "-Onone"; + }; + name = Debug; + }; + 3D7466771C59B9B9003A3C9A /* Release */ = { + isa = XCBuildConfiguration; + buildSettings = { + ALWAYS_SEARCH_USER_PATHS = NO; + CLANG_CXX_LANGUAGE_STANDARD = "gnu++0x"; + CLANG_CXX_LIBRARY = "libc++"; + CLANG_ENABLE_MODULES = YES; + CLANG_ENABLE_OBJC_ARC = YES; + CLANG_WARN_BOOL_CONVERSION = YES; + CLANG_WARN_CONSTANT_CONVERSION = YES; + CLANG_WARN_DIRECT_OBJC_ISA_USAGE = YES_ERROR; + CLANG_WARN_EMPTY_BODY = YES; + CLANG_WARN_ENUM_CONVERSION = YES; + CLANG_WARN_INT_CONVERSION = YES; + CLANG_WARN_OBJC_ROOT_CLASS = YES_ERROR; + CLANG_WARN_UNREACHABLE_CODE = YES; + CLANG_WARN__DUPLICATE_METHOD_MATCH = YES; + CODE_SIGN_IDENTITY = "-"; + COPY_PHASE_STRIP = NO; + DEBUG_INFORMATION_FORMAT = "dwarf-with-dsym"; + ENABLE_NS_ASSERTIONS = NO; + ENABLE_STRICT_OBJC_MSGSEND = YES; + GCC_C_LANGUAGE_STANDARD = gnu99; + GCC_NO_COMMON_BLOCKS = YES; + GCC_WARN_64_TO_32_BIT_CONVERSION = YES; + GCC_WARN_ABOUT_RETURN_TYPE = YES_ERROR; + GCC_WARN_UNDECLARED_SELECTOR = YES; + GCC_WARN_UNINITIALIZED_AUTOS = YES_AGGRESSIVE; + GCC_WARN_UNUSED_FUNCTION = YES; + GCC_WARN_UNUSED_VARIABLE = YES; + MACOSX_DEPLOYMENT_TARGET = 10.10; + MTL_ENABLE_DEBUG_INFO = NO; + SDKROOT = macosx; + }; + name = Release; + }; + 3D7466791C59B9B9003A3C9A /* Debug */ = { + isa = XCBuildConfiguration; + buildSettings = { + PRODUCT_NAME = "$(TARGET_NAME)"; + }; + name = Debug; + }; + 3D74667A1C59B9B9003A3C9A /* Release */ = { + isa = XCBuildConfiguration; + buildSettings = { + PRODUCT_NAME = "$(TARGET_NAME)"; + }; + name = Release; + }; +/* End XCBuildConfiguration section */ + +/* Begin XCConfigurationList section */ + 3D74666C1C59B9B8003A3C9A /* Build configuration list for PBXProject "Homework" */ = { + isa = XCConfigurationList; + buildConfigurations = ( + 3D7466761C59B9B9003A3C9A /* Debug */, + 3D7466771C59B9B9003A3C9A /* Release */, + ); + defaultConfigurationIsVisible = 0; + defaultConfigurationName = Release; + }; + 3D7466781C59B9B9003A3C9A /* Build configuration list for PBXNativeTarget "Homework" */ = { + isa = XCConfigurationList; + buildConfigurations = ( + 3D7466791C59B9B9003A3C9A /* Debug */, + 3D74667A1C59B9B9003A3C9A /* Release */, + ); + defaultConfigurationIsVisible = 0; + }; +/* End XCConfigurationList section */ + }; + rootObject = 3D7466691C59B9B8003A3C9A /* Project object */; +} diff --git a/HW-1-23/Homework.xcodeproj/project.xcworkspace/contents.xcworkspacedata b/HW-1-23/Homework.xcodeproj/project.xcworkspace/contents.xcworkspacedata new file mode 100755 index 0000000..bfc050b --- /dev/null +++ b/HW-1-23/Homework.xcodeproj/project.xcworkspace/contents.xcworkspacedata @@ -0,0 +1,7 @@ + + + + + diff --git a/HW-1-23/Homework/main.swift b/HW-1-23/Homework/main.swift new file mode 100755 index 0000000..c250a25 --- /dev/null +++ b/HW-1-23/Homework/main.swift @@ -0,0 +1,25 @@ +import Foundation + +func findFile(name: String, atPath: String) -> String { + let fileManager = NSFileManager.defaultManager() + let contents = + try! fileManager.contentsOfDirectoryAtPath(atPath) + for fileOrDir in contents { + var isDir = ObjCBool(false); + let fullPath = atPath + "/" + fileOrDir + let exists = fileManager.fileExistsAtPath(fullPath, isDirectory: &isDir) + if exists && Bool(isDir) { + print("DIR: " + fileOrDir) + return fullPath + } else if exists { + print("FILE: " + fileOrDir) + return fullPath + } else { + print("NEITHER: " + fileOrDir) + } + } + return "NOT FOUND" +} + + +print(findFile("pinkcoral.jpb", atPath: "/Users/Mima/Downloads")) \ No newline at end of file diff --git a/HWfrom1-23-16(Recursion).playground/Contents.swift b/HWfrom1-23-16(Recursion).playground/Contents.swift index 4776cab..873dda7 100755 --- a/HWfrom1-23-16(Recursion).playground/Contents.swift +++ b/HWfrom1-23-16(Recursion).playground/Contents.swift @@ -1,20 +1,80 @@ //: Playground - noun: a place where people can play import UIKit +import Foundation + var str = "Hello, playground" //https://docs.google.com/document/d/1KfnTOtPnBrYPFhBRAQPZBXor_mKDQvuJp4zwZbtHkRs/edit#heading=h.16sfqfmanxte +// https://docs.google.com/document/d/1INvOynuggw69yLRNg3y-TPwBiYb3lQZQiFUOxZKBwsY/edit + + + + -//1 +//1 Write without the recursion +func fib(n: Int) -> Int { + print("X") + if (n == 0 || n == 1) { + return 1 + } + return fib(n - 1) + fib(n - 2) +} +func fibTest (num: Int) -> Int { + var xn = 0 + var n1 = 0 + var n2 = 1 + print(n1) + print(n2) + for(var i = 2; i < num; i++){ + xn = n1 + n2 + print(xn) + n1 = n2 + n2 = xn + } + + return num +} + +fibTest(5) //2 +/* HW */ +var stepNum = 0 + + +func tryStep() -> Int { + let stepCount = Int(arc4random_uniform(3)) - 1 + stepNum += stepCount; + switch(stepCount) { + case -1: print("Ouch \(stepNum)") + case 1: print("Yay \(stepNum)") + default: print("Beep \(stepNum)") + } + return stepCount +} + +func stepUp() { + let stepCounts = tryStep() + if (stepCounts == -1){ + print("stepCount -1") + stepUp() + print("stepCount -1") + stepUp() + } + else if (stepCounts == 0){ + stepUp() + } +} +stepUp() +//3 -//3 \ No newline at end of file +// See attached folder diff --git a/HWfrom1-23-16(Recursion).playground/timeline.xctimeline b/HWfrom1-23-16(Recursion).playground/timeline.xctimeline index bf468af..fb8b301 100755 --- a/HWfrom1-23-16(Recursion).playground/timeline.xctimeline +++ b/HWfrom1-23-16(Recursion).playground/timeline.xctimeline @@ -2,5 +2,10 @@ + + From 5099323f1a7ecd8cb0bd1a3d30fadddeba667a07 Mon Sep 17 00:00:00 2001 From: Fatima Date: Wed, 3 Feb 2016 16:37:29 -0500 Subject: [PATCH 126/126] Merge sort HW done --- .../Contents.swift | 74 +++++++++++++---- .../Contents.swift | 46 +++++++++++ .../Contents.swift | 79 ------------------- .../timeline.xctimeline | 2 +- 4 files changed, 107 insertions(+), 94 deletions(-) diff --git a/HWFrom1-24(Recursion).playground/Contents.swift b/HWFrom1-24(Recursion).playground/Contents.swift index 1c44504..22488f9 100755 --- a/HWFrom1-24(Recursion).playground/Contents.swift +++ b/HWFrom1-24(Recursion).playground/Contents.swift @@ -9,17 +9,63 @@ Homework link: https://docs.google.com/document/d/1INvOynuggw69yLRNg3y-TPwBiYb3l -//Question 1 - - - - - - -//Question 2 - - - - - -//Question 3 \ No newline at end of file +//1 Write without the recursion + +func fib(n: Int) -> Int { + print("X") + if (n == 0 || n == 1) { + return 1 + } + return fib(n - 1) + fib(n - 2) +} + +func fibTest (num: Int) -> Int { + var xn = 0 + var n1 = 0 + var n2 = 1 + print(n1) + print(n2) + for(var i = 2; i < num; i++){ + xn = n1 + n2 + print(xn) + n1 = n2 + n2 = xn + } + + return num +} + +fibTest(5) + + +//2 + +/* HW */ +var stepNum = 0 + + +func tryStep() -> Int { + let stepCount = Int(arc4random_uniform(3)) - 1 + stepNum += stepCount; + switch(stepCount) { + case -1: print("Ouch \(stepNum)") + case 1: print("Yay \(stepNum)") + default: print("Beep \(stepNum)") + } + return stepCount +} + +func stepUp() { + let stepCounts = tryStep() + if (stepCounts == -1){ + print("stepCount -1") + stepUp() + print("stepCount -1") + stepUp() + } + else if (stepCounts == 0){ + stepUp() + } +} + +stepUp() \ No newline at end of file diff --git a/HWFrom1-28-16(Merge Sort).playground/Contents.swift b/HWFrom1-28-16(Merge Sort).playground/Contents.swift index afdc1b6..cb0b670 100755 --- a/HWFrom1-28-16(Merge Sort).playground/Contents.swift +++ b/HWFrom1-28-16(Merge Sort).playground/Contents.swift @@ -4,3 +4,49 @@ //Insert code here: + + + +var listOfNumbers = [7, 8, 3, 10, 5] +var index = 0 +var arrayCount = listOfNumbers.count +func insertionSort(inout values: [Int]) { + print(listOfNumbers) + + func keepSorting(var i: Int) -> Int { + print("i sorting") + + if (i < arrayCount) { + print("i index \(i)") + print("num in i \(listOfNumbers[i])") + func compare(var j: Int) -> Int { + print("j sorting") + if (j < arrayCount) { + if listOfNumbers[j] > listOfNumbers[i] { + swap(&listOfNumbers[j], &listOfNumbers[i]) + } + print("j index: \(j)") + print("num in j: \(listOfNumbers[j])") + j++ + return compare(j) + } + + return j + } + + compare(i) + + i++ + return keepSorting(i) + } + + return i + } + + keepSorting(index) +} + + +insertionSort(&listOfNumbers) +print(listOfNumbers) + diff --git a/HWfrom1-23-16(Recursion).playground/Contents.swift b/HWfrom1-23-16(Recursion).playground/Contents.swift index ad352d8..4ad6a85 100755 --- a/HWfrom1-23-16(Recursion).playground/Contents.swift +++ b/HWfrom1-23-16(Recursion).playground/Contents.swift @@ -4,82 +4,3 @@ import UIKit import Foundation - -var str = "Hello, playground" - -//https://docs.google.com/document/d/1KfnTOtPnBrYPFhBRAQPZBXor_mKDQvuJp4zwZbtHkRs/edit#heading=h.16sfqfmanxte - -// https://docs.google.com/document/d/1INvOynuggw69yLRNg3y-TPwBiYb3lQZQiFUOxZKBwsY/edit - - - - - -//1 Write without the recursion - -func fib(n: Int) -> Int { - print("X") - if (n == 0 || n == 1) { - return 1 - } - return fib(n - 1) + fib(n - 2) -} - -func fibTest (num: Int) -> Int { - var xn = 0 - var n1 = 0 - var n2 = 1 - print(n1) - print(n2) - for(var i = 2; i < num; i++){ - xn = n1 + n2 - print(xn) - n1 = n2 - n2 = xn - } - - return num -} - -fibTest(5) - - -//2 - -/* HW */ -var stepNum = 0 - - -func tryStep() -> Int { - let stepCount = Int(arc4random_uniform(3)) - 1 - stepNum += stepCount; - switch(stepCount) { - case -1: print("Ouch \(stepNum)") - case 1: print("Yay \(stepNum)") - default: print("Beep \(stepNum)") - } - return stepCount -} - -func stepUp() { - let stepCounts = tryStep() - if (stepCounts == -1){ - print("stepCount -1") - stepUp() - print("stepCount -1") - stepUp() - } - else if (stepCounts == 0){ - stepUp() - } -} - -stepUp() - -//3 - -<<<<<<< HEAD -// See attached folder -======= -//3 ->>>>>>> d4613234850bfc94872eae41b84231e7e2c32ef6 diff --git a/HWfrom1-23-16(Recursion).playground/timeline.xctimeline b/HWfrom1-23-16(Recursion).playground/timeline.xctimeline index fb8b301..0068b0a 100755 --- a/HWfrom1-23-16(Recursion).playground/timeline.xctimeline +++ b/HWfrom1-23-16(Recursion).playground/timeline.xctimeline @@ -3,7 +3,7 @@ version = "3.0">