Welcome to the 2019-2-OSS-L5 's wiki!

2019-2-OSS-L5 의 프로젝트 소개

Project : Algorithms

선정 커뮤니티 소개

다양한 언어로 이루어진 알고리즘을 다루는 커뮤니티로써 익숙한 언어로 algorithm 을 배움과 동시에 새로운 언어들을 접근할 수 있게 해주는 커뮤니티

선정 이유

• 팀원들이 각자 잘 사용하는 언어의 다양성
• 자신이 익숙한 언어 이외의 많은 프로그래밍 언어를 직접 경험해볼 수 있는 기회
• 프로그래머의 기본 역량이 되는 알고리즘을 학습하며 기본기를 다지는 기회이자 새로운 알고리즘들을 찾아 배워 볼 수 있는 기회

팀원 정보 및 선정 커뮤니티 활동 방법

팀장

이름: 문원준 학번: 2017315482 이메일: [email protected] GitHub ID: wjun0830

팀원

이름: 윤상원 학번: 2018313467 이메일: [email protected] GitHub ID: mikeysw

이름: 정노원 학번: 2018314667 이메일: [email protected] GitHub ID: Rowon

이름: 이민성 학번: 2018311500 이메일: [email protected] GitHub ID: dlalstjd

이름: 류수현 학번: 2018312336 이메일: [email protected] GitHub ID: RSuhyeon

활동방법

• 익숙한 언어로 새로운 알고리즘 구현
• 구현된 코드보다 최적화 된 코드를 구상하며 수정
• 새로운 언어를 이용한 알고리즘 복습 및 구현
• 구현한 알고리즘에 영어 및 한국어 주석 삽입

선정 프로젝트 페이지

Algorithms (Original Project)

정적 페이지

2019-2-SKKU-OSS-L5 TeamPage

활동 내용

• Already implemented algorithms: 👍
• Algorithms we implemented: :dog:

Language	BrainFuck	C	C#	C++	Crystal	Go	Haskell	Java	JavaScript	Kotlin	Perl	Python	Racket	Ruby	Rust	Scala	Swift
AStar Search				:+1:								:+1:
Bellman Ford			:+1:	:+1:			:+1:	:+1:				:+1:
Binary GCD				:+1:		:+1:	:+1:	:+1:				:+1:
Binary Search		:+1:	:+1:	:+1:		:+1:		:+1:	:+1:	:+1:	:+1:	:+1:		:+1:			:+1:
Binary Search Tree			:dog:
Bitap Algorithm				:+1:								:+1:
Bitonic Sort		:+1:		:+1:				:+1:
Bloom Filter												:+1:
Borweins Algorithm				:+1:				:+1:				:+1:
Bubble Sort	:+1:	:+1:	:+1:	:+1:		:+1:		:+1:	:+1:		:+1:	:+1:		:+1:	:+1:	:+1:	:+1:
Cocktail Sort				:+1:
Coin Change			:dog:	:+1:					:dog:
Conjugate Gradient				:+1:								:+1:
Connected Component Labeling		:+1:
Count Sort				:dog:						:dog:		:+1:
Counting Inversions				:+1:		:+1:		:+1:
Counting Sort			:dog:	:+1:				:+1:	:+1:	:dog:		:+1:		:+1:			:+1:
Cycle Sort		:dog:	:dog:	:+1:				:+1:				:+1:
Depth First Search		:+1:	:dog:	:+1:				:+1:	:+1:			:+1:		:+1:
Diffie Hellman							:+1:					:+1:
Dijkstras			:+1:	:+1:		:+1:		:+1:	:+1:			:+1:
Doomsday			:+1:	:+1:				:+1:	:+1:	:+1:		:+1:		:+1:			:+1:
Dutch National Flag		:dog:
Dynamic Programming			:dog:					:+1:
Edit Distance				:+1:								:+1:					:+1:
Edmonds Karp								:+1:
Elevator Algorithm								:+1:
Extended Euclidean Algorithm		:+1:							:+1:
Factorial		:+1:						:+1:				:+1:
Fast Fourier Transform		:+1:		:+1:				:+1:	:+1:			:+1:
Fenwick Tree				:+1:
Fibonacci	:+1:	:+1:	:+1:	:+1:		:+1:	:+1:	:+1:	:+1:	:+1:	:+1:	:+1:	:+1:	:+1:	:+1:	:+1:	:+1:
Fisher Yates Shuffle			:+1:	:+1:				:+1:	:+1:			:+1:		:+1:
Flood Fill				:+1:				:+1:				:+1:					:+1:
Floyds Algorithm		:+1:		:+1:		:+1:		:+1:				:+1:
Greatest Common Divisor		:+1:	:+1:	:+1:		:+1:		:+1:	:+1:	:+1:		:+1:		:+1:		:+1:
Hamming Distance		:+1:		:+1:		:+1:		:+1:	:+1:			:+1:		:+1:
Hash Table			:dog:
Heap Sort		:+1:		:+1:	:+1:	:+1:		:+1:	:+1:			:+1:		:+1:
Heavy Light Decomposition				:+1:
Histogram Equalization								:+1:
Insertion Sort		:+1:	:+1:	:+1:		:+1:		:+1:	:+1:	:+1:		:+1:		:+1:	:+1:	:+1:	:+1:
Johnson Algorithm				:+1:								:+1:
Kadanes		:+1:	:+1:	:+1:		:+1:		:+1:	:+1:			:+1:
Knapsack		:+1:	:dog:					:+1:	:dog:
Knuth Morris Prath				:+1:				:+1:				:+1:
Kruskals Algorithm				:+1:				:+1:
Leaky Bucket		:+1:
Linear Search		:+1:	:+1:	:+1:		:+1:		:+1:	:+1:	:+1:	:+1:	:+1:	:+1:		:+1:	:+1:	:+1:
Longest Bitonic Subsequence				:+1:
Longest Common Subsequence		:+1:		:+1:				:+1:				:+1:		:+1:
Longest Increasing Subsequence			:dog:	:+1:				:+1:	:+1:			:+1:
Longest Path				:+1:								:+1:
Longest Subset Zero Sum				:+1:
Matrix Exponentiation				:+1:
Merge Sort		:+1:	:+1:	:+1:		:+1:	:+1:	:+1:	:+1:	:dog:		:+1:		:+1:		:+1:	:+1:
Min Max ABPruning								:+1:
Minimax				:+1:		:+1:
Pearson Hashing								:+1:
Permutations				:+1:					:+1:			:+1:
Persistent Data Structures				:+1:
Postman Sort		:+1:
Primality Tests				:+1:
Prims				:+1:
Prufer Code				:+1:
Quick Select						:+1:		:+1:	:+1:			:+1:
Quick Sort		:+1:	:+1:	:+1:		:+1:	:+1:	:+1:	:+1:	:+1:		:+1:		:+1:	:+1:		:+1:
Rabin Karp								:+1:				:+1:
Radix Sort		:+1:		:+1:				:+1:				:+1:
Segment Tree				:+1:
Segmented Sieve		:+1:						:+1:				:+1:
Selection Sort		:+1:	:+1:	:+1:		:+1:		:+1:	:+1:	:dog:		:+1:		:+1:	:+1:	:+1:
Sequence Alignment				:+1:
Shell Sort				:+1:				:+1:	:+1:			:+1:		:+1:
Sieveof Eratosthenes			:+1:	:+1:			:+1:	:+1:	:+1:			:+1:
String To Token				:+1:
Strongly Connected Graph.cpp				:+1:
Swap		:+1:	:dog:	:+1:				:+1:	:+1:	:dog:		:+1:				:+1:	:+1:
Tarjans Offline LCA				:+1:
Ternary Search		:+1:		:+1:				:+1:	:+1:			:+1:
Topological Sort				:+1:				:+1:				:+1:
Unary Coding								:+1:	:+1:			:+1:
Union Find		:+1:						:+1:				:+1:
VEGASAlgorithm				:+1: