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
This blog post outlines a structured process for collecting, analyzing, and visualizing audience sentiment using the Dragon Ball franchise.
-
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
The difference between greedy and dynamic programing algorithms lies in their approach to subproblems. Learn more here!
-
Alternative Investment Funds: Algorithms as an Occupation
Explore how occupations within alternative investment funds (AIFs) use algorithms, demonstrating their significance in real-world settings.
-
Using Master Theorem Components and Formulations
Master Theorem helps analyze the time complexity of divide-and-conquer algorithms. This post explores its components.
-
Recurrence Relations: Describing Efficiency and Optimization
Recurrence relations is a technique to analyze the time complexity of recursive algorithms. Recursion introduces trade-offs!