지밍이 블로그

# hash와 tree의 차이

hash - O(1)를 보장, 범위를 잡아서 서치할 수 없음

Tree - O(log N)... 범위잡기 가능

DBMS에서...

: index의 범위검색은 같은수의 random access에 배해 disk I/O가 훨씬 적음

http://dev.mysql.com/doc/refman/5.5/en/index-btree-hash.html

Java HashMap은 어떻게 동작하는가?

http://helloworld.naver.com/helloworld/textyle/831311

http://www.sorting-algorithms.com/

http://en.m.wikipedia.org/wiki/Stable_sort#Stability

http://forums.codeguru.com/showthread.php?362340-How-to-make-selection-sort-stable

http://m.egloos.zum.com/sweeper/v/920985

http://visualgo.net/ufds.html

http://blog.naver.com/PostView.nhn?blogId=godinus123&logNo=220261110069

http://coursera.cs.princeton.edu/algs4/assignments/percolation.html

http://algs4.cs.princeton.edu/code/

http://m.egloos.zum.com/crekim/v/2773743

https://www.facebook.com/CodeScroll/photos/a.587110514682010.1073741828.586614098064985/594148167311578/?type=1

http://greennuri.info/?p=163

visual c++  (2013.12)

렬프