A markdown file outlining BASECS articles as at task list to track progress.
- Jan 2, 2017 bits, bytes, building with binary
- Jan 9, 2017 hexes and other magical numbers
- Jan 16, 2017 What’s a Linked List, Anyway? [Part 1]
- Jan 23, 2017 What’s a Linked List, Anyway? [Part 2]
- Jan 30, 2017 stacks and overflows
- Feb 6, 2017 to queue or not to queue
- Feb 13, 2017 how to not be stumped by trees
- Feb 20, 2017 leaf it up to binary trees
- Feb 27, 2017 looking for the logic behind logarithms
- Mar 20, 2017 a gentle introduction to graph theory
- Mar 27, 2017 königsberg: seven small bridges, one giant graph problem
- Apr 3, 2017 demystifying depth-first search
- Apr 10, 2017 breaking down breadth-first search
- Apr 17, 2017 taking hash tables off the shelf
- Apr 24, 2017 hashing out hash functions
- May 1, 2017 set theory: the method to database madness
- May 8, 2017 sorting out the basics behind sorting algorithms
- May 16, 2017 exponentially easy selection sort
- May 22, 2017 bubbling up with bubble sorts
- May 29, 2017 inching towards insertion sort
- Jun 5, 2017 Making Sense of Merge Sort [Part 1]
- Jun 12, 2017 Making Sense of Merge Sort [Part 2]
- Jun 19, 2017 Pivoting To Understand Quicksort [Part 1]
- Jun 26, 2017 Pivoting To Understand Quicksort [Part 2]
- Jul 3, 2017 learning to love heaps
- Jul 4, 2017 half a year of basecs!
- Jul 13, 2017 heapify all the things with heap sort
- Jul 17, 2017 counting linearly with counting sort
- Jul 24, 2017 getting to the root of sorting with radix sort
- Jul 31, 2017 trying to understand tries
- Aug 7, 2017 compressing radix trees without (too many) tears
- Aug 15, 2017 the little avl tree that could
- Aug 21, 2017 finding fibonacci in golden trees
- Aug 28, 2017 painting nodes black with red-black trees
- Sep 4, 2017 busying oneself with b-trees
- Sep 11, 2017 from theory to practice: representing graphs
- Sep 18, 2017 going broad in a graph: bfs traversal
- Sep 25, 2017 deep dive through a graph: dfs traversal
- Oct 2, 2017 spinning around in cycles with directed acyclic graphs
- Oct 16, 2017 finding the shortest path, with a little help from dijkstra
- Oct 24, 2017 less repetition, more dynamic programming
- Nov 6, 2017 the trials and tribulations of the traveling salesman
- Nov 8, 2017 announcing the basecs podcast!
- Nov 13, 2017 speeding up the traveling salesman using dynamic programming
- Nov 20, 2017 grammatically rooting oneself with parse trees
- Nov 27, 2017 reading code right, with some help from the lexer
- Nov 30, 2017 has basecs helped you? i’d love to know how
- Dec 4, 2017 leveling up one’s parsing game with asts
- Dec 13, 2017 a deeper inspection into compilation and interpretation
- Dec 30, 2017 a most perfect union: just-in-time compilers