Floyd-Warshall (all pairs shortest path) algorithm implementation.
Ali Hamdi Ali Fadel · @Ali Hamdi Ali Fadel
Ali Hamdi Ali Fadel · @AliOsm · about 4 years
Return true if two number are relatively prime (co-prime), false otherwise.
1 ·
0 ·
0
Show code
Ali Hamdi Ali Fadel · @AliOsm · about 4 years
Crawl a web page and extract URLs from its HTML using naive loop implementation. Its running time is comparable or less than using URI.extract().
2 ·
0 ·
1
Show code
Ali Hamdi Ali Fadel · @AliOsm · about 4 years
Calculates N choose K, N! / (K! * (N - K)!), in a mathematical operations efficient way.
1 ·
0 ·
1
Show code
Ali Hamdi Ali Fadel · @AliOsm · about 4 years
Calculates the n-th Catalan number, (2N)! / (N! * (N + 1)!), in a mathematical operations efficient way.
0 ·
0 ·
2
Show code
Ali Hamdi Ali Fadel · @AliOsm · about 4 years
Calculates the n-th Fibonacci number iteratively.
0 ·
0 ·
0
Show code
Ali Hamdi Ali Fadel · @AliOsm · about 4 years
Takes a string and return true if it is a palindrome, false otherwise.
0 ·
3 ·
0
Show code