Topics: Algorithms and Data Structure
###Readings:
An alternative document to read wich covers approximately the same curriculum is Peter Sestofts note on Search and Sort
##Day 1 - Basic Algorithms and Efficiency/Collection Framework The goal is to get an understanding of how one views efficiency of computer programs and basic data structures.
###Readings:
###Exercises:
###Videos:
- What is data structures
- Describing simple data structures
- Sorting arrays
- Sorting arrays of custom objects
- Searching arrays
- Using binary search
- Linked List
###Other Resources:
##Day 2 - Recursion & binary trees The goal is to be able to work with recursion - and in particular exemplified by binary trees.
###Readings: The video's from Lynda.com gives the basics.
- Binary tree and Binary Search Tree are well explained in these two sections at Linda.com
- Animation for Factorial to help you visualise recursion
###Exercises:
##Day 3 - Recursive sorting algorithms Sorting is one of the most important fundamental issues in computing - we will look at some of the recursive sorting algorithms. In particular we will look at merge sort and quick sort.
- Animation - pick merge sort
##Day 4 - HashTale/Hash map & Recap Today we will work on a few more algorithms and data structures to ground the previous few days.
- Hashing & Hashmaps - this section and the next two (three sections total "Using associative arrays", "Understanding hash functions" and "Using hash tables").
- Hash Table Data Strucutre
- Hast Table Example
##Day 5 - Studypoint exercise