미생일기

https://gist.github.com/denji/8359866 NGINX tuning for best performance NGINX tuning for best performance. GitHub Gist: instantly share code, notes, and snippets. gist.github.com Moved to git repository: https://github.com/denji/nginx-tuning denji/nginx-tuning NGINX tuning for best performance. Contribute to denji/nginx-tuning development by creating an account on GitHub. github.com NGINX Tuning..

apt-get install unzip wget https://github.com/naver/d2codingfont/releases/download/VER1.3.2/D2Coding-Ver1.3.2-20180524.zip unzip D2Coding-Ver1.3.2-20180524.zip mkdir /usr/share/fonts/truetype/D2Coding cp ./D2Coding/*.ttf /usr/share/fonts/truetype/D2Coding/ fc-cache -v

보호되어 있는 글입니다.

https://stackoverflow.com/questions/34454899/does-hapi-js-uses-redis-to-share-session Does hapi js uses redis to share session? Redis is commonly used by expressJS to share session across multiple node js processes. Does hapiJs use similar technique? stackoverflow.com Redis is commonly used by expressJS to share session across multiple node js processes. Does hapiJs use similar technique? ======..

youtu.be/7BDzle2n47c youtu.be/hq4dpyuX4Uw package algorithm.sort; public class Quick { public static void quickSort(int arr[]){ quickSort(arr, 0, arr.length-1); } public static void quickSort(int arr[], int start, int end){ int part = partition(arr, start, end); if(start part+1){ quickSort(arr, part+1, end); } } public static int partition(int..

youtu.be/Ce4baygLMz0 package dataStructure.singlyLinkedList; import java.util.HashSet; import java.util.Iterator; public class SinglyLinkedList { private Node head; public SinglyLinkedList() { head = new Node(); } private static class Node{ private int data; private Node next = null; public Node() { } public Node(int data) { this.data = data; } } public boolean append(int d){ try { Node end = ne..

youtu.be/2YvFRAC8UTM https://www.youtube.com/watch?v=QAyl79dCO_k - Merge Sort - Quick Sort 분할정복법을 사용 - 분할 : 해결하고자 하는 문제를 작은 크기의 동일한 문제들로 분할 - 정복 : 각각의 작은 문제를 순환적으로 해결 - 합병 : 작은 문제의 해를 합하여(merge) 원래 문제에 대한 해를 구함 O(n log n) package algorithm.sort; public class Merge { private static void mergeSort(int arr[]){ int [] tmp = new int[arr.length]; mergeSort(arr, tmp, 0, arr.length-1); } private static ..

보호되어 있는 글입니다.

youtu.be/C1SDkdPvQPA youtu.be/IrXYr7T8u_s package dataStructure.singlyLinkedList; public class Node { private int data; private Node next = null; public Node(int data) { this.data = data; } public int getData() { return data; } public boolean hasNext(){ if(this.next == null){ return false; }else{ return true; } } public Node getNext(){ return next; } public boolean setNext(Node next){ try{ this...

youtu.be/DzGnME1jIwY youtu.be/G4IIDyfoHeY - 단방향 한쪽으로만 이동하기 때문에 한쪽 헤더 주소 하나만 포인터를 가지고 있다 - 양방향 양쪽 끝에 포인터를 저장 끝의 노드 삽입시 처음노드부터 선형탐색할 필요가 없다 공간의 효율성을 따져 굳이 양쪽으로 탐색할 필요가 없을 시 양방향으로 디자인 할 필요는 없다 구현하고자 하는 알고리즘의 효율성을 판단하여 선택하여 사용하자