Introduction to Algorithms

Algorithms 1. Algorithm input과 output을 가지는 well-defined computational procedure well-specified computational problem을 해결하기 위한 tool 2. Instance probl

Insertion sort 1. Sorting problem input : a sequence of n numbers (keys) $\lang$$a1$, $a2$, $\cdots$ , $a_n$$\rang$ output : a permutation $\lang$$a1

algorithm analyzing의 배경이 되는 implementation technology와 resources등의 model 중 하나instructions는 하나씩만 실행 가능하고 concurrent operations는 불가능real computers에 존재하는

Designing algorithms The divide-and-conquer approach 1. Divide-and-Conquer Many recursive algorithms follow a divide-and-conquer approach Three step