Skip to content

Instantly share code, notes, and snippets.

@clara-shin
clara-shin / gist:725164cc3ea14fbb2a0d1490f048d137
Created November 28, 2017 10:04 — forked from ihoneymon/how-to-write-by-markdown.md
λ§ˆν¬λ‹€μš΄ μ‚¬μš©λ²•

[곡톡] λ§ˆν¬λ‹€μš΄ markdown μž‘μ„±λ²•

1. λ§ˆν¬λ‹€μš΄μ— κ΄€ν•˜μ—¬

1.1. λ§ˆν¬λ‹€μš΄μ΄λž€?

**Markdown**은 ν…μŠ€νŠΈ 기반의 λ§ˆν¬μ—…μ–Έμ–΄λ‘œ 2004λ…„ 쑴그루버에 μ˜ν•΄ λ§Œλ“€μ–΄μ‘ŒμœΌλ©° μ‰½κ²Œ μ“°κ³  읽을 수 있으며 HTML둜 λ³€ν™˜μ΄ κ°€λŠ₯ν•˜λ‹€. νŠΉμˆ˜κΈ°ν˜Έμ™€ 문자λ₯Ό μ΄μš©ν•œ 맀우 κ°„λ‹¨ν•œ ꡬ쑰의 문법을 μ‚¬μš©ν•˜μ—¬ μ›Ήμ—μ„œλ„ 보닀 λΉ λ₯΄κ²Œ 컨텐츠λ₯Ό μž‘μ„±ν•˜κ³  보닀 μ§κ΄€μ μœΌλ‘œ 인식할 수 μžˆλ‹€. λ§ˆν¬λ‹€μš΄μ΄ 졜근 각광받기 μ‹œμž‘ν•œ μ΄μœ λŠ” κΉƒν—™(https://github.com) 덕뢄이닀. κΉƒν—™μ˜ μ €μž₯μ†ŒRepository에 κ΄€ν•œ 정보λ₯Ό κΈ°λ‘ν•˜λŠ” README.mdλŠ” 깃헙을 μ‚¬μš©ν•˜λŠ” μ‚¬λžŒμ΄λΌλ©΄ λˆ„κ΅¬λ‚˜ κ°€μž₯ λ¨Όμ € μ ‘ν•˜κ²Œ λ˜λŠ” λ§ˆν¬λ‹€μš΄ λ¬Έμ„œμ˜€λ‹€. λ§ˆν¬λ‹€μš΄μ„ ν†΅ν•΄μ„œ μ„€μΉ˜λ°©λ²•, μ†ŒμŠ€μ½”λ“œ μ„€λͺ…, 이슈 등을 κ°„λ‹¨ν•˜κ²Œ κΈ°λ‘ν•˜κ³  가독성을 높일 수 μžˆλ‹€λŠ” 강점이 λΆ€κ°λ˜λ©΄μ„œ 점점 μ—¬λŸ¬ 곳으둜 νΌμ Έκ°€κ²Œ λœλ‹€.

1.2. λ§ˆν¬λ‹€μš΄μ˜ μž₯-단점

1.2.1. μž₯점

@clara-shin
clara-shin / index.css
Created January 10, 2018 09:05 — forked from seungha-kim/index.css
사진 곡유 μ•± 예제 μ½”λ“œ
.image-list {
width: 500px;
}
@clara-shin
clara-shin / use-git-and-git-flow.adoc
Created February 6, 2018 09:00 — forked from ihoneymon/use-git-and-git-flow.adoc
git 을 기반으둜 git-flowλ₯Ό μ‚¬μš©ν•˜μ—¬ μ• ν”Œλ¦¬μΌ€μ΄μ…˜ 배포버전을 κ΄€λ¦¬ν•˜μž.

GIT을 기반으둜 ν•œ ν”„λ‘œμ νŠΈ κ°œλ°œν”„λ‘œμ„ΈμŠ€

깃을 μ‚¬μš©ν•©μ‹œλ‹€. 깃을 μ“°μž. 깃을 μ“°λž€ 말야!!

  • SVN은 변경이λ ₯이 λ§Žμ•„μ§ˆμˆ˜λ‘ 속도가 λŠλ¦¬μ§€.

    • 컀밋 및 μ²˜λ¦¬μ†λ„κ°€ λΉ λ₯΄λ‹€. 변경이λ ₯이 많이 μΆ•μ λ˜μ–΄ μžˆμ–΄λ„ μ†λ„μ €ν•˜κ°€ 거의 μ—†λ‹€.

  • 컀밋찍기가 μ–΄λ ΅λ‹€.

@clara-shin
clara-shin / sample.js
Created May 19, 2018 05:08
ν…ŒμŠ€νŠΈ
function add(x,y){
return x+y;
}
@clara-shin
clara-shin / sequentialSearch.js
Last active May 28, 2018 10:05
μˆœμ°¨νƒμƒ‰ μ•Œκ³ λ¦¬μ¦˜
function sequentialSearch(arr,n,x){
for(let i=0; i < n; i++){
if(x === arr[i]) return i;
}
return -1; //νƒμƒ‰μ‹€νŒ¨ μ‹œ 리턴 -1
}
/*
arr=[0,1, ...n-1];μ—μ„œ xλ₯Ό μ°ΎλŠ” μ•Œκ³ λ¦¬μ¦˜
λ°°μ—΄ arr, n 은 data 개수, x λŠ” 찾고자 ν•˜λŠ” data
@clara-shin
clara-shin / binarysearch.js
Created May 28, 2018 09:50
이진탐색 μ•Œκ³ λ¦¬μ¦˜
function binarysearch(arr, left, right, x){
let mid = 0;
if(left > right) {
return -1;
}
mid = (left+right)/2;
@clara-shin
clara-shin / timeComplexity.js
Last active May 28, 2018 10:45
μ‹œκ°„λ³΅μž‘λ„
function timeComplexity(arr, n) {
let sum = 0; // 1
let i = 0; // 1
let average = 0; // 1
while(i < n) { // n + 1
sum = sum + arr[i]; // n
i = i + 1; // n
}
@clara-shin
clara-shin / timeComplexity2.js
Created May 28, 2018 12:51
μ‹œκ°„λ³΅μž‘λ„ κ΅¬ν•˜κΈ°
// first
i = 1; // 1
while (i <= n) { // n + 1
x = x + 1; // 1
i = i + 1; // 1
}
// second
int i, j;
for(i=1; i <= n; i++) // n
@clara-shin
clara-shin / Hello.java
Created May 30, 2018 06:53
Hello application
/**
* The Hello class implements an application that
* simply prints β€œHello, Java Application!” to standard output. */
public class Hello {
public static void main(String args[]) { // main method
/* Display the string */
System.out.println("Hello, Java Application!");
}
}
@clara-shin
clara-shin / grade1.c
Created May 30, 2018 07:52
μ„±μ μ²˜λ¦¬C
int e[2]; //μ˜μ–΄ 성적을 μœ„ν•œ λ³€μˆ˜
int m[2]; //μˆ˜ν•™ 성적을 μœ„ν•œ λ³€μˆ˜
void input_grade() { //μ˜μ–΄, μˆ˜ν•™ 성적을 μž…λ ₯ λ°›λŠ” ν•¨μˆ˜
e[0] = 90; //첫 번째 ν•™μƒμ˜ μ˜μ–΄ 성적
e[1] = 80; //두 번째 ν•™μƒμ˜ μ˜μ–΄ 성적
m[0] = 85; //첫 번째 ν•™μƒμ˜ μˆ˜ν•™ 성적
m[1] = 80; //두 번째 ν•™μƒμ˜ μˆ˜ν•™ 성적
}
void output_grade() { //총점 좜λ ₯ν•˜λŠ” ν•¨μˆ˜