<commit_before>##### Module 3

# Prep for Class 2

Before coming to [Class 2](../class2), please complete the following tasks...

##### Module 2 Review
Time | Task | Link | Instructions
-----|------|------|-------------
TODO | CS50 Study | [loops, ascii, functions, argv](https://study.cs50.net/loops?toc=loops,ascii,functions,argv)

##### Lecture
Time | Task | Link | Instructions
-----|------|------|-------------
30-45 mins | Watch Video | [Lecture: Week 3, continued](TODO)

##### Merge Sort
Time | Task | Link | Instructions
-----|------|------|-------------
TODO | Read | [Lecture Notes: Week 3, continued / Merge Sort](http://cdn.cs50.net/2015/fall/lectures/3/w/notes3w/notes3w.html#merge_sort)
TODO | Watch Video | [Shorts: Merge Sort](https://www.youtube.com/watch?v=EeQ8pwjQxTM)

##### Recursion
Task | Type | Link | Notes
-----|------|------|------
Watch | Lecture | [Week 4](http://www.youtube.com/embed/SadMsthVUBM?autoplay=1&rel=0&start=0) | Watch the first 25 minues. We're going to dive a little more deeply into recursion now by jumping ahead to some Week 4 content.
Read | Lecture Notes | [Week 4 / Recursion](http://cdn.cs50.net/2015/fall/lectures/4/m/notes4m/notes4m.html#recursion) |
Read | Lecture Notes | [Week 4 / Sigma](http://cdn.cs50.net/2015/fall/lectures/4/m/notes4m/notes4m.html#sigma)
Read | Lecture Notes | [Week 4 / IDE Debugger ](http://cdn.cs50.net/2015/fall/lectures/4/m/notes4m/notes4m.html#debugging_with_cs50_ide)
TODO | Read | [Supplement: Recursion](../supplementary-resources/recursion) | 
TODO | Follow-Along | [Walkthrough: sigma-0](https://www.youtube.com/watch?v=C-J0fKmwKmw&list=PLhQjrBD2T382SQnebs5bf6BkngrHTbJKg&index=10)
TODO | Follow-Along | [Walkthrough: sigma-1](https://www.youtube.com/watch?v=GSY5bEv3gX8&index=11&list=PLhQjrBD2T382SQnebs5bf6BkngrHTbJKg) | Afterwards, step through your program inthe IDE Debugger, just like they did in class.
TODO | Watch Video | [Doug's Playlist: Recursion](https://www.youtube.com/watch?v=VrrnjYgDBEk) | TODO: leave this for next module?
TODO | Watch Video | [Shorts: Recursion](https://www.youtube.com/watch?v=t4MSwiqfLaY) |
TODO | Do | [Exercise: Fibonacci](../exercises/fibonacci) |

##### Sorting Algs Summary
Time | Task | Link | Instructions
-----|------|------|-------------
10 mins | Watch Video | [Doug's Playlist: Algorithms Summary]() | TODO: make cheatsheet?
TODO | CS50 Study | [bubble sort, insertion sort, selection sort, merge sort](https://study.cs50.net/binary_search?toc=bubble_sort,insertion_sort,selection_sort,merge_sort)

##### Compiling, Header Files
Time | Task | Link | Instructions
-----|------|------|-------------
TODO | Read | [Lecture Notes: Week 3, continued / Compiling](http://cdn.cs50.net/2015/fall/lectures/3/w/notes3w/notes3w.html#compiling)
TODO | Watch | [Shorts: Compilers](http://cs50.tv/2012/fall/shorts/compilers/compilers-720p.mp4)
TODO | Watch | [Shorts: Clang, Make](http://cs50.tv/2012/fall/shorts/make_clang/make_clang-720p.mp4)
TODO | Watch | [Shorts: Libraries](http://cs50.tv/2012/fall/shorts/libraries/libraries-720p.mp4)
TODO | Watch | [Section: Compilation Process](https://youtu.be/XRvvitgap5Y?t=2549)
TODO | Read | [Supplement: Spread Out](../supplementary-resources/spread-out) | TODO res: example of a program in which some work is pulled out and placed into a separate file
TODO | DO | [Exercise: Spread Out](../exercises/spread-out) | TODO exc: make them refactor a program into multiple files

### Where do these belong?
  * [Week 3, continued / Bitwise Operators](http://cdn.cs50.net/2015/fall/lectures/3/w/notes3w/notes3w.html#bitwise_operators)
<commit_msg>added link to class 2 at bottom of calendar<commit_after>##### Module 3

# Prep for Class 2

Before coming to [Class 2](../class2), please complete the following tasks...

##### Module 2 Review
Time | Task | Link | Instructions
-----|------|------|-------------
TODO | CS50 Study | [loops, ascii, functions, argv](https://study.cs50.net/loops?toc=loops,ascii,functions,argv)

##### Lecture
Time | Task | Link | Instructions
-----|------|------|-------------
30-45 mins | Watch Video | [Lecture: Week 3, continued](TODO)

##### Merge Sort
Time | Task | Link | Instructions
-----|------|------|-------------
TODO | Read | [Lecture Notes: Week 3, continued / Merge Sort](http://cdn.cs50.net/2015/fall/lectures/3/w/notes3w/notes3w.html#merge_sort)
TODO | Watch Video | [Shorts: Merge Sort](https://www.youtube.com/watch?v=EeQ8pwjQxTM)

##### Recursion
Task | Type | Link | Notes
-----|------|------|------
Watch | Lecture | [Week 4](http://www.youtube.com/embed/SadMsthVUBM?autoplay=1&rel=0&start=0) | Watch the first 25 minues. We're going to dive a little more deeply into recursion now by jumping ahead to some Week 4 content.
Read | Lecture Notes | [Week 4 / Recursion](http://cdn.cs50.net/2015/fall/lectures/4/m/notes4m/notes4m.html#recursion) |
Read | Lecture Notes | [Week 4 / Sigma](http://cdn.cs50.net/2015/fall/lectures/4/m/notes4m/notes4m.html#sigma)
Read | Lecture Notes | [Week 4 / IDE Debugger ](http://cdn.cs50.net/2015/fall/lectures/4/m/notes4m/notes4m.html#debugging_with_cs50_ide)
TODO | Read | [Supplement: Recursion](../supplementary-resources/recursion) | 
TODO | Follow-Along | [Walkthrough: sigma-0](https://www.youtube.com/watch?v=C-J0fKmwKmw&list=PLhQjrBD2T382SQnebs5bf6BkngrHTbJKg&index=10)
TODO | Follow-Along | [Walkthrough: sigma-1](https://www.youtube.com/watch?v=GSY5bEv3gX8&index=11&list=PLhQjrBD2T382SQnebs5bf6BkngrHTbJKg) | Afterwards, step through your program inthe IDE Debugger, just like they did in class.
TODO | Watch Video | [Doug's Playlist: Recursion](https://www.youtube.com/watch?v=VrrnjYgDBEk) | TODO: leave this for next module?
TODO | Watch Video | [Shorts: Recursion](https://www.youtube.com/watch?v=t4MSwiqfLaY) |
TODO | Do | [Exercise: Fibonacci](../exercises/fibonacci) |

##### Sorting Algs Summary
Time | Task | Link | Instructions
-----|------|------|-------------
10 mins | Watch Video | [Doug's Playlist: Algorithms Summary]() | TODO: make cheatsheet?
TODO | CS50 Study | [bubble sort, insertion sort, selection sort, merge sort](https://study.cs50.net/binary_search?toc=bubble_sort,insertion_sort,selection_sort,merge_sort)

##### Compiling, Header Files
Time | Task | Link | Instructions
-----|------|------|-------------
TODO | Read | [Lecture Notes: Week 3, continued / Compiling](http://cdn.cs50.net/2015/fall/lectures/3/w/notes3w/notes3w.html#compiling)
TODO | Watch | [Shorts: Compilers](http://cs50.tv/2012/fall/shorts/compilers/compilers-720p.mp4)
TODO | Watch | [Shorts: Clang, Make](http://cs50.tv/2012/fall/shorts/make_clang/make_clang-720p.mp4)
TODO | Watch | [Shorts: Libraries](http://cs50.tv/2012/fall/shorts/libraries/libraries-720p.mp4)
TODO | Watch | [Section: Compilation Process](https://youtu.be/XRvvitgap5Y?t=2549)
TODO | Read | [Supplement: Spread Out](../supplementary-resources/spread-out) | TODO res: example of a program in which some work is pulled out and placed into a separate file
TODO | DO | [Exercise: Spread Out](../exercises/spread-out) | TODO exc: make them refactor a program into multiple files

### Where do these belong?
  * [Week 3, continued / Bitwise Operators](http://cdn.cs50.net/2015/fall/lectures/3/w/notes3w/notes3w.html#bitwise_operators)


Now that you're done, you can head to [Class 2](../class2).
{'fraction_non_alphanumeric': 0.1921552548858822, 'fraction_numerical': 0.04086374197075304, 'mean_word_length': 3.8463576158940396, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 3, 'https://': 16, 'lorem ipsum': 0, 'www.': 12, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '6649114', 'n_tokens_mistral': 2844, 'n_tokens_neox': 2539, 'n_words': 568}