개발자영맨(bluedawnstar)

[Algorithm] dynamic programming #6 - Buy and Sell Stock - Part 2

[Algorithm] dynamic programming #6 - Buy and Sell Stock - Part 1

[String] String searching #2 - Rabin-Karp algorithm

[개발 팁] 주석 토클링, 들어 봤나요?

[String] String searching #1 - prefix function & KMP (재녹음)

"젓가락질 잘해야만 밥을 먹나요?" - "응"

알고리즘, 어떻게 공부할 것인가? - 2탄

[Algorithm] dynamic programming #5 - 격자에서의 경로 - 번외 문제(Part 3)

[Algorithm] dynamic programming #5 - 격자에서의 경로 - Part 2

[Algorithm] dynamic programming #5 - 격자에서의 경로 - Part 1

알고리즘, 어떻게 공부할 것인가?

[Algorithm] dynamic programming #4 - Knapsack Problem - Part 3

[Algorithm] dynamic programming #4 - Knapsack Problem - Part 2

[Algorithm] dynamic programming #4 - Knapsack Problem - Part 1

[Algorithm] dynamic programming #3 - Maximum Subarray Problem

[Algorithm] dynamic programming #2 - Fibonacci 계열 문제

[Algorithm] dynamic programming #1 - introduction

[Data Structure] union-find #2 - 예제

[Data Structure] union-find #1

[Heap] 이진 힙(binary heap) #8 - 예제6

[Heap] 이진 힙(binary heap) #7 - 예제5

[Heap] 이진 힙(binary heap) #6 - 예제3,4

[Heap] 이진 힙(binary heap) #5 - 예제2

[Heap] 이진 힙(binary heap) #4 - 예제1

[Heap] 이진 힙(binary heap) #3 - 어디에/어떻게 사용하는가?

[Heap] 이진 힙(binary heap) #2 - 힙 만들기(heapify)

[Heap] 이진 힙(binary heap) #1 - push, pop

[Selection] quickselect algorithm

[Sorting] quicksort #3 - 3-way partitioning

[Sorting] quicksort #2 - Hoare partition, pivot selection