gradeup

Algorithm (Short Notes)

Selection Sort:

Merge Sort:

p
eu
ad
gr

Quick Sort:

gradeup
 gradeup
Insertion Sort:

Bubble Sort:

p
eu
ad

Heap Sort:
gr

gradeup
 gradeup
Binary tree traversal Algorithms:

Linear Search

p
eu
Binary Search
ad
gr

gradeup
 gradeup
Recursiv binarh search Algorithm:

Asymptotic Notations:

p
Big Oh (O): If we write f(n) = O(g(n)), then there exists a function f(n) such that ∀ n ≥ n0, f(n) ≤ cg
(n) with any constant c and a positive integer n0.
eu
Big Omega (Ω): If we write f(n) = Ω(g(n)), then there exists a function f(n) such that ∀ n ≥ n0, f(n) ≥
cg(n) with any constant c and a positive integer n0.

Big Theta (θ): If we write f(n) = θ(g(n)), then there exists a function f(n) such that ∀ n ≥ n0, c1g(n) ≤
ad
f(n) ≤ c2g(n) with a positive integer n0, any positive constants c1 and c2.

Small Oh (o): If we write f(n) = o(g(n), then there exists a function such that f(n) < c g(n) with any
positive constant c and a positive integer n0.

Small Omega (ω): If we write f(n) = ω(g(n)), then these exists a function such that f(n) > cg(n) with
gr

any positive constant c and a positive integer n0.

Important Asymptotic relations:

gradeup
 gradeup
Worst case Time Complexities for popular data structures:

p
Time Complexities for popular sorting algorithms:
eu
ad
gr

Kruskal’s algorithm:

gradeup
 gradeup
Prim’s algorithm:

p
eu
Dijkstra’s Algorithm:
ad
gr

Dijkstra’s Algorithm Implementation using Heap:

gradeup
 gradeup
Bellman Ford Algorithm:

Floyd-warshall algorithm:

p
eu
ad
gr

gradeup