 |
 |
 |
 |
 |
 |
||
 |
 |
 |
 |
 |
| 5 | 1/1 | 返回列表 |
| 查看: 1256 | 回復(fù): 3 | ||
| 【獎勵】 本帖被評價2次，作者conanwj增加金幣 2 個 | ||
| 當(dāng)前只顯示滿足指定條件的回帖，點擊這里查看本話題的所有回帖 | ||
[資源]
【分享】How to think about algorithms.Jeff Edmonds.Cambridge.2008[New]
|
||
|
本資源來自于互聯(lián)網(wǎng)，僅供學(xué)習(xí)研究之用，不可涉及任何商業(yè)用途，請在下載后24小時內(nèi)刪除。 著作權(quán)歸原作者或出版社所有。未經(jīng)發(fā)貼人conanwj許可，嚴(yán)禁任何人以任何形式轉(zhuǎn)貼本文，違者必究！ How to think about algorithms. Authors Jeff Edmonds Publisher: 2008 Cambridge University Press Pages: 462 ISBN 13: ISBN-13 978-0-511-41370-4 eBook (EBL) ISBN-13 978-0-521-84931-9 hardback ISBN-13 978-0-521-61410-8 paperback Introduction From determining the cheapest way to make a hot dog to monitoring the workings of a factory, there are many complex computational problems to be solved. Before executable code can be produced, computer scientists need to be able to design the algorithms that lie behind the code, be able to understand and describe such algorithms abstractly, and be confident that they work correctly and efficiently. These are the goals of computer scientists. A Computational Problem: A specification of a computational problem uses preconditions and postconditions to describe for each legal input instance that the computation might receive, what the required output or actions are. This may be a function mapping each input instance to the required output. It may be an optimization problem which requires a solution to be outputted that is “optimal” from among a huge set of possible solutions for the given input instance. It may also be an ongoing system or data structure that responds appropriately to a constant stream of input. Example: The sorting problem is defined as follows: Preconditions: The input is a list of n values, including possible repetitions. Postconditions: The output is a list consisting of the same n values in nondecreasing order. An Algorithm: An algorithm is a step-by-step procedure which, starting with an input instance, produces a suitable output. It is described at the level of detail and abstraction best suited to the human audience that must understand it. In contrast, code is an implementation of an algorithm that can be executed by a computer. Pseudocode lies between these two. An Abstract Data Type: Computers use zeros and ones, ANDs and ORs, IFs and GOTOs. This does not mean that we have to. The description of an algorithm may talk of abstract objects such as integers, reals, strings, sets, stacks, graphs, and trees; abstract operations such as “sort the list,” “pop the stack,” or “trace a path”; and abstract relationships such as greater than, prefix, subset, connected, and child. To be useful, the nature of these objects and the effect of these operations need to be understood. However, in order to hide details that are tedious or irrelevant, the precise implementations of these data structure and algorithms do not need to be specified. Formore on this see Chapter 3. Correctness: An algorithm for the problem is correct if for every legal input instance, the required output is produced. Though a certain amount of logical thinking is requireds, the goal of this text is to teach how to think about, develop, and describe algorithms in such way that their correctness is transparent. See Chapter 28 for the formal steps required to prove correctness, and Chapter 22 for a discussion of forall and exist statements that are essential formaking formal statements. Running Time: It is not enough for a computation to eventually get the correct answer. It must also do so using a reasonable amount of time and memory space. The running time of an algorithm is a function from the size n of the input instance given to a bound on the number of operations the computation must do. (See Chapter 23.) The algorithm is said to be feasible if this function is a polynomial like Time(n) = (n2), and is said to be infeasible if this function is an exponential like Time(n) = (2n). (See Chapters 24 and 25 formore on the asymptotics of functions.) To be able to compute the running time, one needs to be able to add up the times taken in each iteration of a loop and to solve the recurrence relation defining the time of a recursive program. (See Chapter 26 for an understanding of n i=1 i = (n2), and Chapter 27 for an understanding of T(n) = 2T(n2 ) +n = (n logn).) Meta-algorithms: Most algorithms are best described as being either iterative or recursive. An iterative algorithm (Part One) takes one step at a time, ensuring that each step makes progress whilemaintaining the loop invariant. A recursive algorithm (Part Two) breaks its instance into smaller instances, which it gets a friend to solve, and then combines their solutions into one of its own. Optimization problems (Part Three) form an important class of computational problems. The key algorithms for them are the following. Greedy algorithms (Chapter 16) keep grabbing the next object that looks best. Recursive backtracking algorithms (Chapter 17) try things and, if they don’t work, backtrack and try something else. Dynamic programming (Chapter 18) solves a sequence of larger and larger instances, reusing the previously saved solutions for the smaller instances, until a solution is obtained for the given instance. Reductions (Chapter 20) use an algorithm for one problem to solve another. Randomized algorithms (Chapter 21) flip coins to help them decide what actions to take. Finally, lower bounds (Chapter 7) prove that there are no faster algorithms. 本資源共7個可選網(wǎng)絡(luò)硬盤鏈接，6.04 MB，保質(zhì)期2009-07-15。 ---------------------------------------------------------------------------- How to think about algorithms.Jeff Edmonds.Cambridge.2008.pdf How to think about algorithms.Jeff Edmonds.Cambridge.2008.pdf How to think about algorithms.Jeff Edmonds.Cambridge.2008.pdf How to think about algorithms.Jeff Edmonds.Cambridge.2008.pdf How to think about algorithms.Jeff Edmonds.Cambridge.2008.pdf How to think about algorithms.Jeff Edmonds.Cambridge.2008.pdf How to think about algorithms.Jeff Edmonds.Cambridge.2008.pdf ---------------------------------------------------------------------------- |
回復(fù)此樓» 猜你喜歡
316求調(diào)劑
已經(jīng)有3人回復(fù)
-
342求調(diào)劑
已經(jīng)有11人回復(fù)
-
319求調(diào)劑
已經(jīng)有4人回復(fù)
-
【求調(diào)劑】085601材料工程專碩 | 總分272 |
已經(jīng)有10人回復(fù)
-
26考研調(diào)劑
已經(jīng)有3人回復(fù)
-
294分080500材料科學(xué)與工程求調(diào)劑
已經(jīng)有16人回復(fù)
-
調(diào)劑
已經(jīng)有3人回復(fù)
-
一志愿鄭大材料工程290求調(diào)劑
已經(jīng)有16人回復(fù)
-
273求調(diào)劑
已經(jīng)有16人回復(fù)
-
材料調(diào)劑
已經(jīng)有6人回復(fù)
» 本主題相關(guān)價值貼推薦，對您同樣有幫助:
- how to make our oral fluent series:exam
已經(jīng)有20人回復(fù)
- how to make our oral fluent series:some interrogative sentences
已經(jīng)有22人回復(fù)
- How_to_Write_a_Paper
已經(jīng)有14人回復(fù)
- 【How to say】系列之---還是那樣牙尖嘴利�。
已經(jīng)有11人回復(fù)
- How do u think about it ?
已經(jīng)有30人回復(fù)
- How do you think about the death of Mr. Osama bin laden?
已經(jīng)有10人回復(fù)
- How do you think about the relationship between pressure and homesickness
已經(jīng)有14人回復(fù)
- How do you think about your work and life?
已經(jīng)有11人回復(fù)
- 【Discussion】How do you think about this sentence?
已經(jīng)有6人回復(fù)
- 【Discussion】What topic do you think do you prefer to talk about during a date?
已經(jīng)有14人回復(fù)
- Happy dragon boat festival to everyone!How about your vacation?
已經(jīng)有20人回復(fù)
- 【分享】How to write SCI papers (朱興全教授-2009)(ppt)【已搜索無重復(fù)】
已經(jīng)有15人回復(fù)
4樓2010-05-04 19:09:59
2樓2009-06-25 17:31:07
3樓2009-06-25 23:38:35
| 最具人氣熱帖推薦 [查看全部] | 作者 | 回/看 | 最后發(fā)表 | |
|---|---|---|---|---|
|
[考研] 294分080500材料科學(xué)與工程求調(diào)劑 +15 | 柳溪邊 2026-03-26 | 16/800 |
|
|---|---|---|---|---|
|
[考研] 285求調(diào)劑 +7 | AZMK 2026-03-30 | 13/650 |
|
|
|
[考研] 0703化學(xué)/290求調(diào)劑/本科經(jīng)歷豐富/工科也可 +14 | 丹青奶蓋 2026-03-26 | 16/800 |
|
|
|
[考研] 調(diào)劑 +3 | 好好讀書。 2026-04-01 | 5/250 |
|
|
|
[考研] 288求調(diào)劑 一志愿哈工大 材料與化工 +26 | 洛神哥哥 2026-03-31 | 26/1300 |
|
|
|
[考研] 0710生物學(xué)求調(diào)劑！ +6 | 敘述文 2026-03-31 | 6/300 |
|
|
|
[考研] 一志愿南師大0703化學(xué) 275求調(diào)劑 +5 | Ripcord上岸 2026-03-27 | 5/250 |
|
|
|
[考研] 070300化學(xué)354求調(diào)劑 +15 | 101次希望 2026-03-28 | 15/750 |
|
|
|
[考研]
 物理學(xué)調(diào)劑
+4
|
小羊36 2026-03-30 | 4/200 |
|
|
|
[考研] 347求調(diào)劑 +11 | 山頂見α 2026-03-25 | 11/550 |
|
|
|
[考研] 085600 295分求調(diào)劑 +13 | W55j 2026-03-30 | 15/750 |
|
|
|
[考研] 269求調(diào)劑 +4 | 我想讀研11 2026-03-31 | 4/200 |
|
|
|
[考研] 085600，專業(yè)課化工原理，320分求調(diào)劑 +6 | 大饞小子 2026-03-29 | 6/300 |
|
|
|
[考研] 083000學(xué)碩274求調(diào)劑 +12 | Li李魚 2026-03-26 | 12/600 |
|
|
|
[考研] 抱歉 +4 | 田洪有 2026-03-30 | 4/200 |
|
|
|
[考研] 一志愿南開大學(xué)0710生物學(xué)359求調(diào)劑 +5 | 兔兔兔111223314 2026-03-29 | 7/350 |
|
|
|
[考研] 303求調(diào)劑 +7 | DLkz1314. 2026-03-30 | 7/350 |
|
|
|
[考研] 070305高分子化學(xué)與物理 304分求調(diào)劑 +12 | c297914 2026-03-28 | 12/600 |
|
|
|
[考研] 本科雙非材料，跨考一志愿華電085801電氣，283求調(diào)劑，任何專業(yè)都可以 +6 | 芝士雪baoo 2026-03-28 | 8/400 |
|
|
|
[考研] 315分求調(diào)劑 +7 | 26考研上岸版26 2026-03-26 | 7/350 |
|