게임을 지원하는 고전 알고리즘

1장 기본 개념
알고리즘과 자료구조의 관계 / 알고리즘의 복잡도 / 게임의 알고리즘 복잡도 /흐름도/의사코드 /데이터의 디지털 표현
양자 컴퓨터/양자 컴퓨터의 게임 분야 활용/음수 표현과 연산을 위한 코드 체계 /2의 보수 방식/실수의 비트 표현 체계
유니티 엔진에서의 유니코드 사용

2장 배열|리스트|딕셔너리|해시셋
단일 연결 리스트/원형 연결 리스트/이중 연결 리스트/이중 원형 연결 리스트/다중 연결 리스트
해시테이블/유니티 엔진에서 활용할 수 있는 유사 자료구조

3장 스택|큐
스택의 개념/스택과 재귀 호출/하노이의 탑/스택을 이용한 중위 수식 계산
유니티에서의 스택/큐의 개념/원형 큐/디큐

4장 트리
트리의 개념/완전 이진 트리/깊이 우선 순회/너비 우선 순회
BST/구성 예/검색 연산삭제 연산
유니티에서 BST 구현
힙/맥스힙 구성/힙 정렬

5장 그래프
인접행렬/인접리스트/순회 DFS/순회 BFS/최소비용 신장 트리
그래프의 광범위한 응용

6장 검색과 정렬
선형 검색 | 순차 검색 /선형 검색의 시간 복잡도
이진 검색 ·································································································179
문자열 검색 ·····························································································181
버블 소트 ·································································································185
삽입 소트 ·································································································190
퀵 소트 ····································································································193
R 포인터를 사용하지 않는 퀵 소트 ·······················································202
힙 정렬 ····································································································206
병합 정렬 ·································································································208
셸 정렬 ····································································································211
유니티 엔진에서 힙소트의 시각적 구현 ·················································215
힙정렬의 게임 응용 ·················································································222
찾아보기(INDEX)