Open Source
-
Minimum Spanning Trees (MSTs) via Kruskal and Prim
MSTs are the smallest connected subgraph that spans all the vertices of a given graph, minimizing the total edge weights.
-
Compilation Phases Explained – Analysis and Synthesis
Compilers work in phases to translate source code into machine code or an intermediate representation.
-
Graph Algorithm Basics, BFS, and DFS
Graph: Graphs provide representations of relationships between entities, helping analyze and identify patterns in data. Learn more here!
-
Tracking DBZ’s Brand Sentiment on Reddit using R
How I collected Reddit comments about Dragon Ball, scored their sentiment in R, and visualized the results in Tableau.
-
Visualizing Cancer Trends in Tableau
This guide summarizes how I created analytics and visualizations to explore cancer incidence in America and New York State.
-
Using Greedy and Dynamic Optimization Algorithms
Greedy algorithms take the best-looking choice at each step; dynamic programming solves overlapping subproblems once. Worked examples and when to use each.
-
Alternative Investment Funds: Algorithms as an Occupation
How occupations within alternative investment funds (AIFs) use algorithms, from quants and traders to network engineers.
-
Using Master Theorem Components and Formulations
The Master Theorem gives the time complexity of divide-and-conquer recurrences. Its components, three cases, and worked examples.
-
Recurrence Relations: Describing Efficiency and Optimization
Recurrence relations is a technique to analyze the time complexity of recursive algorithms. Recursion introduces trade-offs!