# List of BaseCS resources

#### 09 February, 2018

BaseCS is a blog series by Vaidehi Joshi. It’s amazing and you should all read it.

I’m just organising an index of her posts here because going through Medium to find them is frustrating.

- Bits, Bytes, and building with binary
- Hexes and Other Magical Numbers
- What’s a linked list anyway? Part 1
- What’s a linked list anyway? Part 2
- Stacks and Overflows
- To queue or not to queue
- How to not be stumped by trees
- Leaf it up to binary trees
- Looking for the logic behind Logarithms
- A gentle introduction to graph theory
- Königsberg: Seven Small Bridges, One Giant Graph Problem
- Demystifying Depth-First Search
- Breaking Down Breadth-First Search
- Taking Hash Tables Off The Shelf
- Hashing Out Hash Functions
- Set Theory: the Method To Database Madness
- Sorting Out The Basics Behind Sorting Algorithms
- Exponentially Easy Selection Sort
- Bubbling Up With Bubble Sorts
- Inching Towards Insertion Sort
- Making Sense of Merge Sort [Part 1]
- Making Sense of Merge Sort [Part 2]
- Pivoting To Understand Quicksort [Part 1]
- Pivoting To Understand Quicksort [Part 2]
- Learning to Love Heaps
- Heapify All The Things With Heap Sort
- Counting Linearly With Counting Sort
- Getting To The Root Of Sorting With Radix Sort
- Trying to Understand Tries
- Compressing Radix Trees Without (Too Many) Tears
- The Little AVL Tree That Could
- Finding Fibonacci In Golden Trees
- Painting Nodes Black With Red-Black Trees
- Busying Oneself With B-Trees
- From Theory To Practice: Representing Graphs
- Going Broad In A Graph: BFS Traversal
- Deep Dive Through A Graph: DFS Traversal
- Spinning Around In Cycles With Directed Acyclic Graphs
- Finding The Shortest Path, With A Little Help From Dijkstra
- Less Repetition, More Dynamic Programming
- The Trials And Tribulations Of The Traveling Salesman
- Speeding Up The Traveling Salesman Using Dynamic Programming
- Grammatically Rooting Oneself With Parse Trees
- Reading Code Right, With Some Help From The Lexer
- Leveling Up One’s Parsing Game With ASTs
- A Deeper Inspection Into Compilation And Interpretation
- A Most Perfect Union: Just-In-Time Compilers

Enjoyed this post? Receive the next one in your inbox!