• Home
  • About
  • Categories
  • Tags
Subscribe

YABOONG

Done with coding, ready for takeoff ✈️

파이썬 데코레이터

파이썬 데코레이터

by Yaboong on March 4, 2018

개요

파이썬 데코레이터에 대한 간단한 설명과 예제

read more

Tags: python
Breadth-First Search

Breadth-First Search

by Yaboong on February 25, 2018

개요

  • Graph 의 탐색 방법인 Breadth-First Search (너비우선탐색) 알고리즘에 대해 알아본다
  • Breadth-First Search 메소드 구현
  • 코드 보기

read more

Tags: algorithmsgraphjavabreadth-first-search
Depth-First Search & Path

Depth-First Search & Path

by Yaboong on February 22, 2018

개요

  • Graph 의 탐색 방법인 Depth-First Search (깊이우선탐색) 알고리즘에 대해 알아본다
  • Depth-First Search 메소드 구현
  • DFS 응용 - 임의의 노드 v 에서 w 로 가는 path 가 있는지 알아보는 메소드 구현
  • 코드 보기

read more

Tags: algorithmsgraphjavadepth-first-search
Graph

Graph

by Yaboong on February 19, 2018

개요

  • Graph 관련 용어
  • Graph 를 표현하는 세 가지 방법

read more

Tags: data-structuresjavagraph
Quick Sort - 퀵정렬

Quick Sort - 퀵정렬

by Yaboong on February 18, 2018

개요

  • Quick sort 파티셔닝 설명 및 구현 예제
  • 코드 보기

read more

Tags: algorithmssortingjava
Merge Sort - 합병정렬

Merge Sort - 합병정렬

by Yaboong on February 14, 2018

개요

  • Merge Sort 의 divide, merge 부분 동작 파악
  • 구현 - Java
  • 시간복잡도 분석 - 점화식 풀이
  • 코드 보기

read more

Tags: algorithmssortingjava
Basic Sorting Algorithms - Bubble, Selection, Insertion Sort

Basic Sorting Algorithms - Bubble, Selection, Insertion Sort

by Yaboong on February 13, 2018

개요

기초적인 정렬 알고리즘인 거품정렬, 선택정렬, 삽입정렬에 대해 알아본다.

read more

Tags: algorithmssortingjava
Binary Search Tree (BST) - Java

Binary Search Tree (BST) - Java

by Yaboong on February 12, 2018

개요

  • Binary Search Tree (BST) 개요
  • 삽입, 탐색, 순회, 삭제 구현 - Java
  • 전체 코드 보기

read more

Tags: data-structureslinked-listtreebinary-search-treejava
Min Heap & Heap Sort - Java

Min Heap & Heap Sort - Java

by Yaboong on February 10, 2018

개요

  • Array 를 이용하여 Heap 을 직접 구현해 본다.
  • Heap 구현 - Java
  • 시간복잡도 분석
  • Heapsort 구현
  • 예제코드 보기

read more

Tags: data-structuresheaparrayjavasorting
Binary Tree 종류 - Heap 구현 사전지식

Binary Tree 종류 - Heap 구현 사전지식

by Yaboong on February 10, 2018

개요

Heap 구현을 위한 Binary Tree 의 기초적인 개념에 대해 알아본다.

read more

Tags: data-structurestreebinary-treejava

Posts navigation

Newer Posts Page 3 of 5 Older Posts

Yaboong

yaboong-profile-image

Oskar Schindler was a mere opportunist and a corrupt businessman. Yet, when it seemed that great evil was taking over the world, it was not nobles, intellectuals, or religious leaders who rose to defy it and save lives—it was a corrupt opportunist, Oskar Schindler.

Latest Posts

  • No More Confusion: Departure vs. Upwind Leg in the Traffic Pattern October 18, 2025
  • Instrument Rating Checkride Oral Cheat Sheet (Quick IR review) February 15, 2025
  • 스프링 카프카 Batch Consumer - 의도치 않은 리스너 호출 June 7, 2020
  • 스프링 - 생성자 주입을 사용해야 하는 이유, 필드인젝션이 좋지 않은 이유 August 29, 2019
  • 자바 제네릭 이해하기 Part 1 January 19, 2019

Categories

FAR/AIM algorithms aviation data-science data-structures database design-pattern docker for-fun frameworks functional-programming java jenkins python scala spark spring spring-cloud

Tags

AIM Aeronautical-Information-Manual algorithms array aviation-theory aws binary-search-tree binary-tree breadth-first-search clustering data-engineering data-science data-structures database depth-first-search design-pattern devops docker dynamic-programming elastic-beanstalk emr file-system for-fun functional-programming garbage-collection generics graph heap http4s java jenkins kafka linked-list memory-management normalization oop python queue scala seminar sorting spark spring spring-cloud spring-cloud-config stack traffic-pattern tree
GitHub RSS
© YABOONG all rights reserved.
Powered by Jekyll. Back to the top