Efficiency

Space complexicty:memory

Time complexity:execution time

 

Algorithm's efficiency:#of basic operations executed as a function of input size

 

Basic operation

-single or group instructions

-execution time is independent of n

n:input size

 

Input size

-배열의 키들의 갯수

->sequential search, binary search, add array members, exchange sort

-#of rows and columns

->Matrix multiplication

-#of nodes and edges

->graph:n,e n-1<=e<=n(n-1)/2

-logn(floor처리)+1

->피보나치

#:number