I'm using this repo to study, analyze, familiarize with, and scrutinize common DSAs by using JavaScript.
I'll be using Lecture Notes for Data Structures and Algorithms by John Bullinaria - School of Computer Science, University of Birmingham, Birmingham, UK - as a guide, but most of my learning will come from the wild of the web.
- To be able to identify a DSA with a problem specification
- To port my understanding of DSAs to other programming tools
- To develop intuition on performance cost of an algorithm
- To have fun
- Cement my understanding of JavaScript
- Understand common DSAs and their nuances
- Implement common DSAs using JavaScript
0. Linked lists
3. Stacks
4. Queues
7. Recursion
8. Binary trees
9. Quad trees
11. AVL trees
12. 2-3 Trees
13. Binary Heap Tree
14. Binomial Heap
JavaScript is such an expressive language if one truly knows what they are doing. I've been using JavaScript (wrongly) for some time, but not until I read Marijn Haverbeke's Eloquent JavaScript did it all fit together nicely (or so I thought).
Then I picked up JavaScript: The Good Parts by Douglas Crockford himself (JSON is Doug's SON!). The book literally changed my understanding of JavaScript and the cosmos! Doug has done nothing less than speaking into my soul; of the beauty, power and expressiveness that is JavaScript.
In his autobiography, Linus Torvalds (hallowed be his name) speaks of Tanenbaum's Operating Systems... oh never mind: The Minix Book as the book that changed his life. I have read books before, but I've never thought a book to be life changing until, well you guessed it, until I read Douglas (oh, and his blog).
Though I owe my rather limited (but ever growing) understanding of the machine and the world to
many great men and women (or should I say /[^]*/g), I dare say Doug helped me find JesuScript.
I do not intend to be bent to the will of the machine ever again, for I'm saved.