2013 年 10月 29 日随笔档案 - straw_berry

2013年10月29日

摘要： Time Limit:1000MSMemory Limit:10000KTotal Submissions:1535Accepted:529DescriptionAnalyzing the run-time complexity of algorithms is an important tool for designing efficient programs that solve a problem. An algorithm that runs in linear time is usually much faster than an algorithm that takes quadr 阅读全文

posted @ 2013-10-29 21:39 straw_berry 阅读(768) 评论(0) 推荐(0)