Time complexity of sorting algorithms Selection Sort – Youtube Link From the beginning of an array, it finds minimum element in ...

#
*Category* ‧ Algorithm

# P vs. NP

NP – Complete A problem p in NP is NP-complete if every other problem in NP can be transformed (or reduced) into p in polynomial time. It ...

# Euclid’s Algorithm

Euclid’s(Euclidean) Algorithm Algorithm to find GCD of two large numbers GCD(N1, N2), suppose that N1 is larger than N2 N1 = N2 * q1 + r1 ...

# Levenshtein Distance

Levenshtein distance (LD) is a measure of the similarity between two strings, and it is a minimum costs to transform a string to the other using ...