[{"title":"( 16 个子文件 9.41MB ) 中国科学院研究生院算法设计课件","children":[{"title":"课件","children":[{"title":"ia-04-sort.pdf <span style='color:#111;'> 1.93MB </span>","children":null,"spread":false},{"title":"ia-03-3-binary-tree.pdf <span style='color:#111;'> 821.60KB </span>","children":null,"spread":false},{"title":"ia-03-1-recursive.pdf <span style='color:#111;'> 250.71KB </span>","children":null,"spread":false},{"title":"ia-07-2-priority-queue.pdf <span style='color:#111;'> 1.22MB </span>","children":null,"spread":false},{"title":"ia-07-3-stack-queue.pdf <span style='color:#111;'> 617.42KB </span>","children":null,"spread":false},{"title":"ia-04-00748162.pdf <span style='color:#111;'> 1.12MB </span>","children":null,"spread":false},{"title":"10-13-backtrace.pdf <span style='color:#111;'> 713.08KB </span>","children":null,"spread":false},{"title":"ia-01-1-introduction.pdf <span style='color:#111;'> 96.80KB </span>","children":null,"spread":false},{"title":"ia-03-2-divide-and-comquer.pdf <span style='color:#111;'> 586.32KB </span>","children":null,"spread":false},{"title":"ia-02-1-recurrence.pdf <span style='color:#111;'> 787.67KB </span>","children":null,"spread":false},{"title":"DS02_List.ppt <span style='color:#111;'> 941.00KB </span>","children":null,"spread":false},{"title":"ia-01-3-pointer.pdf <span style='color:#111;'> 407.68KB </span>","children":null,"spread":false},{"title":"ia-01-2-asymptotic.pdf <span style='color:#111;'> 548.28KB </span>","children":null,"spread":false},{"title":"ia-06-greedy-choice.pdf <span style='color:#111;'> 978.85KB </span>","children":null,"spread":false},{"title":"ia-05-dp.pdf <span style='color:#111;'> 544.44KB </span>","children":null,"spread":false},{"title":"ia-07-1-amortized-analysis.pdf <span style='color:#111;'> 260.85KB </span>","children":null,"spread":false}],"spread":false}],"spread":true}]