AO and Cache Aware Data Structures and Algorithms

Question

Is there somewhere where I can get Big-O style analysis / comparison of traditional data structures such as linked lists, various trees, hashes, etc., as well as cache-based data structures such as Judy trees and others ?

Answer 1

Actually

I would look here for an analysis of Judy trees.

, " " . - 20 000 ; , - 200 .

; . (, 64), . - , , , . , . - , , , .

Answer 2

BigO - algorhitms, . . : , ( ) .

, , .

algorhitm - O (nlog (n)), , , , , nlog (n)

Answer 3

. , .

Answer 4

: " "

(http://en.wikipedia.org/wiki/Introduction_to_Algorithms)