This branch is 61 commits behind loiane/javascript-datastructures-algorithms:second-edition.

Name	Name	Last commit message	Last commit date
Latest commit loiane rmeoved unnecessary code from Queue ES6 code Feb 6, 2016 d0eacad · Feb 6, 2016 History 104 Commits
chapter01	chapter01	ES6 classes example	Jan 22, 2016
chapter02	chapter02	typed arrays example	Jan 22, 2016
chapter03	chapter03	rmeoved unnecessary code from Stack	Feb 6, 2016
chapter04	chapter04	rmeoved unnecessary code from Queue ES6 code	Feb 6, 2016
chapter05	chapter05	added CircularLinkedList class in ES6 syntax	Feb 6, 2016
chapter06	chapter06	update Set values() and valuesLegacy() to return items values instead…	Jan 15, 2016
chapter07	chapter07	updated code chapter 5 - linked lists	Feb 6, 2016
chapter08	chapter08	added empty tree constraint	Sep 15, 2014
chapter09	chapter09	change array literals to object literals, since the objects are used …	Jan 29, 2016
chapter10	chapter10	modified toString	Sep 29, 2014
chapter11	chapter11	renamed files	Sep 29, 2014
.gitignore	.gitignore	added *.log	Sep 6, 2014
README.md	README.md	fixed typo	Mar 28, 2015

Repository files navigation

Learning JavaScript Data Structures and Algorithms

Source code of Learning JavaScript Data Structures and Algorithms book.

Book link:

###List of Chapters:

1: JAVASCRIPT – A QUICK OVERVIEW
2: ARRAYS
3: STACKS
4: QUEUES
5: LINKED LISTS
6: SETS
7: DICTIONARIES AND HASHES
8: TREES
9: GRAPHS
10: SORTING AND SEARCHING ALGORITHMS
11: More about Algorithms (Recursion, Dynamic Programing, Greedy Algorithms and Big-O Notation) - Extra chapter that can be donwloaded from Packt website
Apendix A: Big-O Cheat Sheet - Extra chapter that can be donwloaded from Packt website

###Found an issue or have a question?

Please create an Issue or Pull Request