VincentsProject

<p><a href="https://zero-base.co.kr/event/media_BE_school_qna" target="_blank" class="ke-link">https://zero-base.co.kr/event/media_BE_school_qna</a></p><div class="figure-open" contenteditable="false" data-ke-type="opengraph" data-ke-align="alignCenter" data-og-type="website" data-og-title="현직자가 말하는 신입 백엔드 개발 면접 질문 ｜ 제로베이스 | zero-base" data-og-description="신입 백엔드 개발자 면접 전 꼭 읽어봐야 할 기본 질문 15가지" data-og-host="zero-base.co.kr" data-og-source-url="https://zero-base.co.kr/event/media_BE_school_qna" data-og-url="https://zero-base.co.kr/event/media_BE_school_qna" data-og-image="https://scrap.kakaocdn.net/dn/btBHYV/hyTfpdnSRi/pyMtkzgtqHA49yTdXr9FL1/img.png?width=459&height=330&face=117_117_188_195,https://scrap.kakaocdn.net/dn/xKkbK/hyTei1qZeC/f5JPiUs1BzTXKG2JpjyYD1/img.png?width=2768&height=1990&face=0_0_2768_1990"><a href="https://zero-base.co.kr/event/media_BE_school_qna" target="_blank" data-source-url="https://zero-base.co.kr/event/media_BE_school_qna"><div class="og-image"><img src="https://scrap.kakaocdn.net/dn/btBHYV/hyTfpdnSRi/pyMtkzgtqHA49yTdXr9FL1/img.png?width=459&height=330&face=117_117_188_195,https://scrap.kakaocdn.net/dn/xKkbK/hyTei1qZeC/f5JPiUs1BzTXKG2JpjyYD1/img.png?width=2768&height=1990&face=0_0_2768_1990" alt="" xxxxonerror="this.src="//img1.kakaocdn.net/thumb/C200x200/?fname=https%3A%2F%2Ft1.daumcdn.net%2Fcafe_image%2Fcafe_meta_image_190529.png""></div><div class="og-text"><p class="og-title">현직자가 말하는 신입 백엔드 개발 면접 질문 ｜ 제로베이스 | zero-base</p><p class="og-desc">신입 백엔드 개발자 면접 전 꼭 읽어봐야 할 기본 질문 15가지</p><p class="og-host">zero-base.co.kr</p></div></a></div><p><a href="https://gmlwjd9405.github.io/2018/05/10/algorithm-quick-sort.html" target="_blank" class="ke-link">https://gmlwjd9405.github.io/2018/05/10/algorithm-quick-sort.html</a></p><div class="figure-open" contenteditable="false" data-ke-type="opengraph" data-ke-align="alignCenter" data-og-type="website" data-og-title="[알고리즘] 퀵 정렬(quick sort)이란 - Heee's Development Blog" data-og-description="Step by step goes a long way." data-og-host="gmlwjd9405.github.io" data-og-source-url="https://gmlwjd9405.github.io/2018/05/10/algorithm-quick-sort.html" data-og-url="http://gmlwjd9405.github.io/2018/05/10/algorithm-quick-sort.html" data-og-image="https://scrap.kakaocdn.net/dn/raeDw/hyTd9QKIWE/lgd4uIzIF8vTVvo8KEKKx1/img.png?width=2184&height=987&face=0_0_2184_987,https://scrap.kakaocdn.net/dn/c6oJXQ/hyTfxbpYhC/KkDE1KTPqL27SyOGNSsNFK/img.png?width=1443&height=625&face=0_0_1443_625,https://scrap.kakaocdn.net/dn/hMjyG/hyTeiG21jF/xmw0dMGj0RX3KJtMsBnXn0/img.png?width=1364&height=1960&face=0_0_1364_1960"><a href="https://gmlwjd9405.github.io/2018/05/10/algorithm-quick-sort.html" target="_blank" data-source-url="https://gmlwjd9405.github.io/2018/05/10/algorithm-quick-sort.html"><div class="og-image"><img src="https://scrap.kakaocdn.net/dn/raeDw/hyTd9QKIWE/lgd4uIzIF8vTVvo8KEKKx1/img.png?width=2184&height=987&face=0_0_2184_987,https://scrap.kakaocdn.net/dn/c6oJXQ/hyTfxbpYhC/KkDE1KTPqL27SyOGNSsNFK/img.png?width=1443&height=625&face=0_0_1443_625,https://scrap.kakaocdn.net/dn/hMjyG/hyTeiG21jF/xmw0dMGj0RX3KJtMsBnXn0/img.png?width=1364&height=1960&face=0_0_1364_1960" alt="" xxxxonerror="this.src="//img1.kakaocdn.net/thumb/C200x200/?fname=https%3A%2F%2Ft1.daumcdn.net%2Fcafe_image%2Fcafe_meta_image_190529.png""></div><div class="og-text"><p class="og-title">[알고리즘] 퀵 정렬(quick sort)이란 - Heee's Development Blog</p><p class="og-desc">Step by step goes a long way.</p><p class="og-host">gmlwjd9405.github.io</p></div></a></div><p><a href="https://madplay.github.io/post/time-complexity-space-complexity" target="_blank" class="ke-link">https://madplay.github.io/post/time-complexity-space-complexity</a></p><div class="figure-open" contenteditable="false" data-ke-type="opengraph" data-ke-align="alignCenter" data-og-type="website" data-og-title="시간복잡도와 공간복잡도(Time Complexity Space Complexity)" data-og-description="알고리즘의 성능을 판단하는 복잡도에 대해서 알아보자." data-og-host="madplay.github.io" data-og-source-url="https://madplay.github.io/post/time-complexity-space-complexity" data-og-url="https://madplay.github.io/post/time-complexity-space-complexity" data-og-image="https://scrap.kakaocdn.net/dn/bPxjay/hyTfFNKm5f/0SykGUuWYJ7QCLkSK0mS9K/img.jpg?width=1436&height=1436&face=0_0_1436_1436"><a href="https://madplay.github.io/post/time-complexity-space-complexity" target="_blank" data-source-url="https://madplay.github.io/post/time-complexity-space-complexity"><div class="og-image"><img src="https://scrap.kakaocdn.net/dn/bPxjay/hyTfFNKm5f/0SykGUuWYJ7QCLkSK0mS9K/img.jpg?width=1436&height=1436&face=0_0_1436_1436" alt="" xxxxonerror="this.src="//img1.kakaocdn.net/thumb/C200x200/?fname=https%3A%2F%2Ft1.daumcdn.net%2Fcafe_image%2Fcafe_meta_image_190529.png""></div><div class="og-text"><p class="og-title">시간복잡도와 공간복잡도(Time Complexity Space Complexity)</p><p class="og-desc">알고리즘의 성능을 판단하는 복잡도에 대해서 알아보자.</p><p class="og-host">madplay.github.io</p></div></a></div><p><a href="https://www.crocus.co.kr/1236" target="_blank" class="ke-link">https://www.crocus.co.kr/1236</a></p><div class="figure-open" contenteditable="false" data-ke-type="opengraph" data-ke-align="alignCenter" data-og-type="website" data-og-title="공개키 암호(Public Key Cryptography)" data-og-description="목차 1. 공개키 암호(Public Key Cryptography)란? 2. 공개키 암호화 모델링 및 이용 방법 3. 공개키 암호의 문제점 1. 공개키 암호(Public Key Cryptography)란? 공개키 암호학이 생기기 전에는 대칭키를 이용하" data-og-host="www.crocus.co.kr" data-og-source-url="https://www.crocus.co.kr/1236" data-og-url="https://www.crocus.co.kr/1236" data-og-image="https://scrap.kakaocdn.net/dn/crUuKo/hyTfvkmB1E/dMpu6c6HfYfAGEDf3IKdW1/img.png?width=480&height=347&face=0_0_480_347,https://scrap.kakaocdn.net/dn/Cpt6z/hyTfEBiUiv/RViy6a8R0X4AnMK6rZS0pk/img.png?width=800&height=800&face=0_0_800_800,https://scrap.kakaocdn.net/dn/66YZl/hyTfzNQtom/I0TTQRA5cdZBEmvI38oka1/img.png?width=480&height=347&face=0_0_480_347"><a href="https://www.crocus.co.kr/1236" target="_blank" data-source-url="https://www.crocus.co.kr/1236"><div class="og-image"><img src="https://scrap.kakaocdn.net/dn/crUuKo/hyTfvkmB1E/dMpu6c6HfYfAGEDf3IKdW1/img.png?width=480&height=347&face=0_0_480_347,https://scrap.kakaocdn.net/dn/Cpt6z/hyTfEBiUiv/RViy6a8R0X4AnMK6rZS0pk/img.png?width=800&height=800&face=0_0_800_800,https://scrap.kakaocdn.net/dn/66YZl/hyTfzNQtom/I0TTQRA5cdZBEmvI38oka1/img.png?width=480&height=347&face=0_0_480_347" alt="" xxxxonerror="this.src="//img1.kakaocdn.net/thumb/C200x200/?fname=https%3A%2F%2Ft1.daumcdn.net%2Fcafe_image%2Fcafe_meta_image_190529.png""></div><div class="og-text"><p class="og-title">공개키 암호(Public Key Cryptography)</p><p class="og-desc">목차 1. 공개키 암호(Public Key Cryptography)란? 2. 공개키 암호화 모델링 및 이용 방법 3. 공개키 암호의 문제점 1. 공개키 암호(Public Key Cryptography)란? 공개키 암호학이 생기기 전에는 대칭키를 이용하</p><p class="og-host">www.crocus.co.kr</p></div></a></div><p><a href="https://humahumahuma.tistory.com/184" target="_blank" class="ke-link">https://humahumahuma.tistory.com/184</a></p><div class="figure-open" contenteditable="false" data-ke-type="opengraph" data-ke-align="alignCenter" data-og-type="website" data-og-title="인코딩(encode) , 암호화(encrypt) 차이" data-og-description="인코딩: 공개적으로 사용 가능한 방법을 통해 데이터를 변환하는 것. 다른 시스템에서의 데이터 유용성을 높이고 저장에 필요한 공간을 줄이려는 의도로 이룰어진다. 예를 들어 문자 'A'는 아스" data-og-host="humahumahuma.tistory.com" data-og-source-url="https://humahumahuma.tistory.com/184" data-og-url="https://humahumahuma.tistory.com/184" data-og-image="https://scrap.kakaocdn.net/dn/Tmk6R/hyTegvzwZV/z0pKVdOKOk5ZiBbl5lsPs1/img.png?width=800&height=800&face=0_0_800_800,https://scrap.kakaocdn.net/dn/n4t3c/hyTfC4yRSM/hR24wj05Apl3eNBlNpyTLK/img.png?width=800&height=800&face=0_0_800_800"><a href="https://humahumahuma.tistory.com/184" target="_blank" data-source-url="https://humahumahuma.tistory.com/184"><div class="og-image"><img src="https://scrap.kakaocdn.net/dn/Tmk6R/hyTegvzwZV/z0pKVdOKOk5ZiBbl5lsPs1/img.png?width=800&height=800&face=0_0_800_800,https://scrap.kakaocdn.net/dn/n4t3c/hyTfC4yRSM/hR24wj05Apl3eNBlNpyTLK/img.png?width=800&height=800&face=0_0_800_800" alt="" xxxxonerror="this.src="//img1.kakaocdn.net/thumb/C200x200/?fname=https%3A%2F%2Ft1.daumcdn.net%2Fcafe_image%2Fcafe_meta_image_190529.png""></div><div class="og-text"><p class="og-title">인코딩(encode) , 암호화(encrypt) 차이</p><p class="og-desc">인코딩: 공개적으로 사용 가능한 방법을 통해 데이터를 변환하는 것. 다른 시스템에서의 데이터 유용성을 높이고 저장에 필요한 공간을 줄이려는 의도로 이룰어진다. 예를 들어 문자 'A'는 아스</p><p class="og-host">humahumahuma.tistory.com</p></div></a></div><p> </p>