**Markdown**μ ν μ€νΈ κΈ°λ°μ λ§ν¬μ μΈμ΄λ‘ 2004λ 쑴그루λ²μ μν΄ λ§λ€μ΄μ‘μΌλ©° μ½κ² μ°κ³ μ½μ μ μμΌλ©° HTMLλ‘ λ³νμ΄ κ°λ₯νλ€. νΉμκΈ°νΈμ λ¬Έμλ₯Ό μ΄μ©ν λ§€μ° κ°λ¨ν ꡬ쑰μ λ¬Έλ²μ μ¬μ©νμ¬ μΉμμλ λ³΄λ€ λΉ λ₯΄κ² 컨ν μΈ λ₯Ό μμ±νκ³ λ³΄λ€ μ§κ΄μ μΌλ‘ μΈμν μ μλ€. λ§ν¬λ€μ΄μ΄ μ΅κ·Ό κ°κ΄λ°κΈ° μμν μ΄μ λ κΉν(https://github.com) λλΆμ΄λ€. κΉνμ μ μ₯μRepositoryμ κ΄ν μ 보λ₯Ό κΈ°λ‘νλ README.mdλ κΉνμ μ¬μ©νλ μ¬λμ΄λΌλ©΄ λꡬλ κ°μ₯ λ¨Όμ μ νκ² λλ λ§ν¬λ€μ΄ λ¬Έμμλ€. λ§ν¬λ€μ΄μ ν΅ν΄μ μ€μΉλ°©λ², μμ€μ½λ μ€λͺ , μ΄μ λ±μ κ°λ¨νκ² κΈ°λ‘νκ³ κ°λ μ±μ λμΌ μ μλ€λ κ°μ μ΄ λΆκ°λλ©΄μ μ μ μ¬λ¬ κ³³μΌλ‘ νΌμ Έκ°κ² λλ€.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
.image-list { | |
width: 500px; | |
} |
κΉμ μ¬μ©ν©μλ€. κΉμ μ°μ. κΉμ μ°λ λ§μΌ!!
-
SVNμ λ³κ²½μ΄λ ₯μ΄ λ§μμ§μλ‘ μλκ° λ리μ§.
-
μ»€λ° λ° μ²λ¦¬μλκ° λΉ λ₯΄λ€. λ³κ²½μ΄λ ₯μ΄ λ§μ΄ μΆμ λμ΄ μμ΄λ μλμ νκ° κ±°μ μλ€.
-
-
컀λ°μ°κΈ°κ° μ΄λ ΅λ€.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
function add(x,y){ | |
return x+y; | |
} |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
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 |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
function binarysearch(arr, left, right, x){ | |
let mid = 0; | |
if(left > right) { | |
return -1; | |
} | |
mid = (left+right)/2; | |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
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 | |
} | |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// 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 |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/** | |
* 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!"); | |
} | |
} |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
int e[2]; //μμ΄ μ±μ μ μν λ³μ | |
int m[2]; //μν μ±μ μ μν λ³μ | |
void input_grade() { //μμ΄, μν μ±μ μ μ λ ₯ λ°λ ν¨μ | |
e[0] = 90; //첫 λ²μ§Έ νμμ μμ΄ μ±μ | |
e[1] = 80; //λ λ²μ§Έ νμμ μμ΄ μ±μ | |
m[0] = 85; //첫 λ²μ§Έ νμμ μν μ±μ | |
m[1] = 80; //λ λ²μ§Έ νμμ μν μ±μ | |
} | |
void output_grade() { //μ΄μ μΆλ ₯νλ ν¨μ |
OlderNewer