공통 팁 #1

Algorithms 4th edition , March 19, 2011
Authors: Robert Sedgewick, Kevin Wayne / Princeston Univ.
http://algs4.cs.princeton.edu

Chapter 1: Fundamentals

◦ Analysis of Algorithms/Case Study: Union-Find
Chapter 2: Sorting

Chapter 3: Searching

◦ Applications
Chapter 4: Graphs

Chapter 5: Strings

Chapter 6: Context


◦ for a freely accessible, comprehensive Web site, including text digests,
program code, test data, programming projects, exercises, lecture slides,
and other resources.
◦ Programming Model/Data Abstraction/Bags, Stacks, and Queues
◦ Elementary Sorts/Mergesort/Quicksort/Priority Queues/Applications
◦ Symbol Tables/Binary Search Trees/Balanced Search Trees/Hash Tables
◦ Undirected Graphs/Directed Graphs/Minimum Spanning Trees/Shortest Paths
◦ String Sorts/Tries/Substring Search/Regular Expressions/Data Compression

Algorithms, Part I
◦ Kevin Wayne and Robert Sedgewick




등록하고 수강할 수 있다.
6주 강의 – 2013.8.23 시작
75분*2시간/Week
https://www.coursera.org/course/algs4partI



MIT OCW
http://www.snow.or.kr/lecture/applied_scien
ces/computer_science/532.html (한글자막)
챨스 E. 라이서손
한글자막



VS2010 옵션을 보니 sdf 파일 생성되지 않게 하
는 방법이 있네요.
이 파일은 디폴트로 생성되는 것으로, 생성되지
않도록 VS2010 옵션을 변경할 수 있습니다.
(옵션 -> 텍스트 편집기 -> C/C++ -> 고급
탭 -> 대체(fallback) 위치 : 기본은 false로 되
어있음 -> true로 변경하면 됨)
// rand() : 0 ~ RAND_MAX(32767)
srand((unsigned)time(NULL));
for(int i=0; i<10; i++)
a[i] = rand()%100; // 0 ~ 99
#include “time.h”
clock_t start, finish;
start = clock();
//… 측정할 프로그램 …
finish = clock();
cout << (double)(finish - start)/CLOCKS_PER_SEC <<"초";