Skip to content

Instantly share code, notes, and snippets.

View devetude's full-sized avatar

JONGMIN KIM devetude

View GitHub Profile
@devetude
devetude / Main.java
Last active September 22, 2016 14:48
순차탐색 알고리즘 1 (Sequential Search 1)
import java.util.Scanner;
/**
* 순차탐색 알고리즘 1 (Sequential Search 1)
*
* @author devetue
*/
public class Main {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
@devetude
devetude / Main.java
Last active September 22, 2016 14:49
순차탐색 알고리즘 2 (Sequential Search 2)
import java.util.Scanner;
/**
* 순차탐색 알고리즘 2 (Sequential Search 2)
*
* @author devetue
*/
public class Main {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
@devetude
devetude / Main.java
Last active September 22, 2016 14:49
이진탐색 알고리즘 (Binary Search)
/**
* 이진탐색 알고리즘 (Binary Search)
*
* @author devetue
*/
public class Main {
public static void main(String args[]) {
int[] numbers = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };
int key = 7;
int start = 0;
@devetude
devetude / Main.java
Last active September 22, 2016 14:48
유클리드 최대공약수 알고리즘 1 (Euclid GCM 1)
import java.util.Scanner;
/**
* 유클리드 최대공약수 알고리즘 1 (Euclid GCD 1)
*
* @author devetue
*/
public class Main {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
@devetude
devetude / Main.java
Last active September 22, 2016 14:49
유클리드 최대공약수 알고리즘 2 (Euclid GCM 2)
import java.util.Scanner;
/**
* 유클리드 최대공약수 알고리즘 2 (Euclid GCD 2)
*
* @author devetue
*/
public class Main {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
@devetude
devetude / Main.java
Created September 22, 2016 14:59
유클리드 최대공약수를 이용한 최소공배수 알고리즘 (Euclid LCM By Using GCD)
import java.util.Scanner;
/**
* 유클리드 최대공약수를 이용한 최소공배수 알고리즘 (Euclid LCM By Using GCD)
*
* @author devetue
*/
public class Main {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
@devetude
devetude / Main.java
Created September 22, 2016 15:09
소수판별 1 (Check Prime Number 1)
import java.util.Scanner;
/**
* 소수판별 1 (Check Prime Number 1)
*
* @author devetue
*/
public class Main {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
@devetude
devetude / Main.java
Created September 22, 2016 15:12
소수판별 2 (Check Prime Number 2)
import java.util.Scanner;
/**
* 소수판별 2 (Check Prime Number 2)
*
* @author devetue
*/
public class Main {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
@devetude
devetude / Main.java
Created September 22, 2016 15:30
에라토네스의 체를 이용한 1부터 1000000까지 소수구하기 (Find Prime Number Between 1 and 1000000 By Using Sieve of Eratosthenes)
/**
* 에라토네스의 체를 이용한 1부터 1000000까지 소수구하기 (Find Prime Number Between 1 and 1000000 By Using Sieve of Eratosthenes)
*
* @author devetue
*/
public class Main {
public static void main(String args[]) {
final int LIMIT = 1000000;
int[] sieve = new int[LIMIT + 1];
sieve[0] = 1;
@devetude
devetude / Main.java
Created September 23, 2016 04:55
합병정렬 알고리즘 (Merge Sort)
/**
* 합병정렬 알고리즘 (Merge Sort)
*
* @author devetude
*/
public class Main {
public static void main(String args[]) {
int[] arr = { 9, 3, 1, 2, 8, 6, 5, 7, 4 };
mergeSort(arr);