KRUSKALS VS
PRIMS
Algorithm
Kruskals & Prims Algorithm
Kruskals & Prims Algorithm are categorized as Greedy Algorithm
Both of Kruskals & Prims Algorithm used to find minimum
spanning tree (MST)
However
One may difficult to distinguish between Kruskals & P

SONY SURYA WIJAYA
1. What is Greedy Algorithm
A greedy algorithm is an algorithm that follows the problem solving heuristic of making the
locally optimal choice at each stage with the hope of finding a global optimum.
2. How to find the optimal solution i

Divide and Conquer Algorithms
1. What is the paradigm of divide and conquer algorithms?
It breaks a problem into subproblems that are similar to the original problem, recursively
solves the subproblems, and finally combines the solution to the subproblems

SONY SURYA WIJAYA
History of Convex Hull
Graham Scan (1972)
The Graham scan algorithm is often cited as the first real "computational geometry" algorithm. A
slightly more sophisticated, but much more efficient algorithm is the Graham scan, published in 19

Marvin Minsky
Marvin Minsky is one of the pioneers of artificial intelligence and had made numerous
contributions to the fields of AI, cognitive science, mathematics and robotics. Minsky was highly
educated, holding a BA in mathematics from Harvard and ea

Al-Khwarizmi
Al-Khwarizmi was a Persian mathematician, astronomer, and geographer who lived during
the Abbasid Caliphate which was the third of the Islamic caliphates to succeed the Islamic prophet
Muhammad. A scholar in the House of Wisdom in Baghdad, hi

Recursive Labs
Sony Surya | [Course Title] |
Recursive Program for Factorial
Linear Recursion in C
N
TIME TO COMPUTE F(N)
USING THE LINEAR FACTORIAL RECURSION IN C
1
0.007 s
2
0.19 s
Graph
Linear Recursion in Java
PAGE 1

Complexity of log n and ln n
Any logarithm will do O(log n).
We can show this by using the formula:
Logx(a)/Logx(b) =Logb(a)
So, since Ln(x) is just Loge(x):
Loge(n)/Loge(10) =Log10(n)
The base of a logarithm does not matter in asymptotic complexity.