Software Development
-
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.
-
Graph Algorithm Basics, BFS, and DFS
Graph: Graphs provide representations of relationships between entities, helping analyze and identify patterns in data. Learn more here!
-
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!
-
Gamifying Interview Prep: Puzzles, Games, and Strategy
What if prepping could be less about grinding through textbooks and more about engaging in fun, yet challenging activities?
-
Asymptotic Notation: Big O, Omega, and Theta
Asymptotic notation is the linguistic and mathematical bridge that allows developers to discuss the scalability and efficiency of algorithms.
-
Algorithm Development and Analysis
Algorithms are step-by-step procedures designed to solve problems. This post explores how algorithms are used in computational finance.