【索引】Volume 4. Algorithm Design

AOAPC I: Beginning Algorithm Contests (Rujia Liu)


Volume 4. Algorithm Design


UVA


FILE10905 - Children's Game13903
26.34%
3293
71.21%
FILE10763 - Foreign Exchange7297
43.87%
2084
86.95%
FILE10132 - File Fragmentation7361
26.74%
1802
72.97%
FILE270 - Lining Up12574
15.17%
1880
54.84%
FILE10341 - Solve It19170
27.42%
3073
85.06%
FILE10057 - A mid-summer night's dream.5841
29.29%
1508
70.09%
FILE10706 - Number Sequence4784
35.10%
1706
74.15%
FILE10487 - Closest Sums8586
38.90%
2642
89.93%
FILE10340 - All in All41024
30.04%
9925
88.51%
FILE10700 - Camel trading7542
39.91%
2581
88.30%
FILE10026 - Shoemaker's Problem18260
29.78%
4549
76.87%
FILE311 - Packets7063
32.88%
2319
79.78%
FILE10020 - Minimal coverage12993
27.30%
2635
75.98%
FILE10714 - Ants5727
53.27%
2158
91.57%
FILE10954 - Add All13903
35.41%
4258
79.94%
FILE714 - Copying Books11687
20.54%
2002
68.03%
FILE10602 - Editor Nottoobad2762
43.59%
983
89.52%
FILE10400 - Game Show Math7719
29.20%
1696
78.66%
FILE10718 - Bit Mask2881
38.74%
1009
77.70%
FILE11054 - Wine trading in Gergovia2987
54.77%
1190
94.79%
FILE10382 - Watering Grass7541
24.02%
1154
76.52%
FILE10670 - Work Reduction2910
37.66%
949
87.14%
FILE10720 - Graph Construction4967
28.71%
1153
76.67%
FILE993 - Product of digits5231
52.97%
2261
94.52%
FILE10716 - Evil Straw Warts Live2022
31.75%
631
72.27%
FILE11100 - The Trip, 20072900
33.10%
745
79.06%
FILE10245 - The Closest Pair Problem30964
21.11%
3368
63.87%
FILE11129 - An antiarithmetic permutation899
62.29%
402
87.06%
FILE10041 - Vito's Family38788
39.13%
10802
84.87%
FILE507 - Jill Rides Again12612
32.43%
3169
83.53%
FILE108 - Maximum Sum43327
39.80%
13876
79.51%
FILE10827 - Maximum sum on a torus4930
36.23%
1192
81.29%
FILE757 - Gone Fishing3252
15.13%
687
48.91%
FILE10148 - Advertisement2010
26.07%
382
69.37%



UVAlive

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
Harsh Bhasin, "Algorithms: Design and Analysis" English | ISBN: 0199456666 | 2015 | 692 pages Algorithms: Design and Analysis of is a textbook designed for the undergraduate and postgraduate students of computer science engineering, information technology, and computer applications. It helps the students to understand the fundamentals and applications of algorithms. The book has been divided into four sections: Algorithm Basics, Data Structures, Design Techniques and Advanced Topics. The first section explains the importance of algorithms, growth of functions, recursion and analysis of algorithms. The second section covers the data structures basics, trees, graphs, sorting in linear and quadratic time. Section three discusses the various design techniques namely, divide and conquer, greedy approach, dynamic approach, backtracking, branch and bound and randomized algorithms used for solving problems in separate chapters. The fourth section includes the advanced topics such as transform and conquer, decrease and conquer, number thoeretics, string matching, computational geometry, complexity classes, approximation algorithms, and parallel algorithms. Finally, the applications of algorithms in Machine Learning and Computational Biology areas are dealt with in the subsequent chapters. This section will be useful for those interested in advanced courses in algorithms. The book also has 10 appendixes which include topics like probability, matrix operations, Red-black tress, linear programming, DFT, scheduling, a reprise of sorting, searching and amortized analysis and problems based on writing algorithms. The concepts and algorithms in the book are explained with the help of examples which are solved using one or more methods for better understanding. The book includes variety of chapter-end pedagogical features such as point-wise summary, glossary, multiple choice questions with answers, review questions, application-based exercises to help readers test their understanding of the learnt concepts.

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值