Algorithm

# sorting 구현

https://github.com/ysoftman/test_code/blob/master/cpp/sort_test.cpp

# GCD GCD(greatest common divisor) 최대 공약수 구하기

https://github.com/ysoftman/test_code/blob/master/cpp/gcd_test.cpp

# fibonacci 수열구하기

https://github.com/ysoftman/test_code/blob/master/cpp/fibonacci_test.cpp

# factorial

https://github.com/ysoftman/test_code/blob/master/cpp/factorial_test.cpp

# binary search

https://github.com/ysoftman/test_code/blob/master/cpp/binary_search_test.cpp

# primer number 찾기

https://github.com/ysoftman/test_code/blob/master/cpp/prime_number_test.cpp

# prime number 찾기(Eratosthenes(에라토스테네스의 체) 방법으로 소수 구하기)

https://github.com/ysoftman/test_code/blob/master/golang/prime_number/prime_number_eratosthenes.go

# 무한소수 체크

https://github.com/ysoftman/test_code/blob/master/golang/util/util.go#L98

# Levenshtein-Distance 알고리즘 구현

https://github.com/ysoftman/test_code/blob/master/cpp/levenshtein_distance_test.cpp

실행결과화면 replace cost 를 1로 했을때

# K-Means Clustering

https://github.com/ysoftman/test_code/blob/master/cpp/k_means_clustering_test.cpp

# Dijkstra (다익스트라) 알고리즘으로 최단경로 찾기

https://github.com/ysoftman/test_code/blob/master/cpp/dijkstra_test.cpp

# 통계 값 계산

https://github.com/ysoftman/test_code/blob/master/cpp/statistics_test.cpp

# precision/recall

https://github.com/ysoftman/test_code/blob/master/cpp/precision_recall_test.cpp

# elo rating

https://github.com/ysoftman/test_code/blob/master/cpp/elo_rating_test.cpp

# anagram

https://github.com/ysoftman/test_code/blob/master/golang/anagram/anagram.go

# largest possible combined number

https://github.com/ysoftman/test_code/blob/master/golang/largest_possible_combined_number/largest_possible_combined_number.go

# codility_demo_find_equilibrium_index

https://github.com/ysoftman/codingtest/blob/master/codility/codility_demo_find_equilibrium_index.cpp