More actions
No edit summary |
No edit summary |
||
| Line 22: | Line 22: | ||
*** big-O notation(big-Omega, big-Theta) | *** big-O notation(big-Omega, big-Theta) | ||
*** speed, time complexity | *** speed, time complexity | ||
*** memory, space complexity | *** memory, space complexity, in-place sort | ||
*** stablity | *** stablity | ||
** swap sort v.s. others | ** swap sort v.s. others | ||
Revision as of 09:47, 30 April 2018
예정
- C언어 문법은 일단 여기까지
- 본격적 알고리즘 시작
- 선형 자료 구조(linear data structure)
- 배열(array) : fixed-sized collection of contiguous data
- random access
- 연결 리스트(linked list) : sequential of data linked by pointer
- node - link
- array v.s. linked list
- algorithms for sequential data
- 탐색(search)
- 선형 탐색(linear search)
- 이진 탐색(binary search)
- 정렬(sort)
- 선택 정렬(selection sort)
- 삽입 정렬(insertion sort)
- 병합 정렬(merge sort)
- divide-and-conqurer
- 퀵 정렬(quick sort)
- performance
- big-O notation(big-Omega, big-Theta)
- speed, time complexity
- memory, space complexity, in-place sort
- stablity
- swap sort v.s. others