標(biāo)題: Titlebook: Data Structures and Algorithms with Python; Kent D. Lee,Steve Hubbard Textbook 20151st edition Springer Nature Switzerland AG 2015 Algorit [打印本頁] 作者: Obsolescent 時間: 2025-3-21 18:31
書目名稱Data Structures and Algorithms with Python影響因子(影響力)
書目名稱Data Structures and Algorithms with Python影響因子(影響力)學(xué)科排名
書目名稱Data Structures and Algorithms with Python網(wǎng)絡(luò)公開度
書目名稱Data Structures and Algorithms with Python網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Data Structures and Algorithms with Python被引頻次
書目名稱Data Structures and Algorithms with Python被引頻次學(xué)科排名
書目名稱Data Structures and Algorithms with Python年度引用
書目名稱Data Structures and Algorithms with Python年度引用學(xué)科排名
書目名稱Data Structures and Algorithms with Python讀者反饋
書目名稱Data Structures and Algorithms with Python讀者反饋學(xué)科排名
作者: Vo2-Max 時間: 2025-3-21 23:00
Bahia Lounis,Aichouche Belhadj-AissaThis documentation was generated from the Python documentation available by typing .(.) in the Python shell.作者: cathartic 時間: 2025-3-22 02:32
Lecture Notes in Computer ScienceThis documentation was generated from the Python documentation available by typing . in the Python shell.作者: 事物的方面 時間: 2025-3-22 07:31 作者: 巧思 時間: 2025-3-22 09:27
Lecture Notes in Computer ScienceThis documentation was generated from the Python documentation available by typing .(.) in the Python shell.作者: 虛情假意 時間: 2025-3-22 16:01 作者: 虛情假意 時間: 2025-3-22 18:36 作者: boisterous 時間: 2025-3-22 23:36 作者: Observe 時間: 2025-3-23 04:41 作者: 制定法律 時間: 2025-3-23 07:11
Appendix C: String Operators and Methods,This documentation was generated from the Python documentation available by typing . in the Python shell.作者: esthetician 時間: 2025-3-23 13:03
Appendix D: List Operators and Methods,This documentation was generated from the Python documentation available by typing .(.) in the Python shell.作者: AVID 時間: 2025-3-23 16:24 作者: 調(diào)整校對 時間: 2025-3-23 19:37
Appendix F: Turtle Methods,This documentation was generated from the Python documentation available by typing from turtle import * help (Turtle) in the Python shell.作者: countenance 時間: 2025-3-24 00:07 作者: 強壯 時間: 2025-3-24 02:46
Kent D. Lee,Steve HubbardIncludes broad coverage of both introductory and advanced data structures topics, supported by examples.Guides the reader through the concepts of computational complexity, from the basics to amortized作者: 護(hù)身符 時間: 2025-3-24 07:28 作者: 小木槌 時間: 2025-3-24 13:44
https://doi.org/10.1007/978-3-319-13072-9Algorithms; Computational Complexity; Data Structures; Programming; Python; algorithm analysis and proble作者: 潛移默化 時間: 2025-3-24 16:11 作者: bacteria 時間: 2025-3-24 22:57 作者: 四指套 時間: 2025-3-25 00:49
Lecture Notes in Computer Sciencen list class, but helps illustrate our first data structure. When we added a drawing command to the sequence we called the append method. It turns out that this method is called a lot. In fact, the flower picture in the first chapter took around 700 commands to draw. You can imagine that a complex p作者: Foreknowledge 時間: 2025-3-25 06:49
Yuan-Rong Sih,Hone-Jay Chu,Yi-Hsing Tsenghis is one time when it is appropriate. You need to read this chapter if you have not written recursive functions before. Most computer science students start by learning to program in a style called . programming. This simply means that you are likely used to thinking about creating variables, stor作者: Glutinous 時間: 2025-3-25 09:17 作者: gratify 時間: 2025-3-25 15:44
Lecture Notes in Computer Sciencee two sixes in a sequence or list of integers. In this chapter we look at . where duplicate values are not allowed. After examining sets we’ll move on to talk about .. . may also be called . or ..The term . actually suggests an implementation of a set or map. The primary focus of this chapter is in 作者: 矛盾 時間: 2025-3-25 17:36
https://doi.org/10.1007/978-3-319-21407-8m the roots in a more or less organized fashion. The word tree is used in Computer Science when talking about a way data may be organized. Trees have some similarilties to the linked list organization found in Chap.?.. In a tree there are nodes which have links to other nodes. In a linked list each 作者: 散步 時間: 2025-3-25 21:35
Mário Melo,Gibeon Aquino,Itamir Moraisatical representation of problems like these. In the last chapter we saw that trees serve a variety of purposes in Computer Science. Trees are graphs. However, graphs are more general than trees. Abstracting away the details of a problem and studying it in its simplest form often leads to new insigh作者: 搖曳 時間: 2025-3-26 02:27 作者: Erythropoietin 時間: 2025-3-26 07:47 作者: 全部逛商店 時間: 2025-3-26 09:18
Funda D?kmen,Zafer Aslan,Ahmet Tokg?zlüems in some cases. Binary search trees can become unbalanced, actually quite often. When a tree is unbalanced the complexity of insert, delete, and lookup operations can get as bad as .. This problem with unbalanced binary search trees was the motivation for the development of height-balanced AVL tr作者: Monocle 時間: 2025-3-26 13:48
Massimiliano Bencardino,Antonio Nesticòtly implement an operation called .. B-Trees have other properties that are also useful for databases including ordering of rows within a table, fast delete capability, and sequential access. The chapter begins by introducing some terminology from relational databases to motivate the need for B-Tree作者: LAIR 時間: 2025-3-26 18:47 作者: insipid 時間: 2025-3-26 22:19
Data Structures and Algorithms with Python978-3-319-13072-9Series ISSN 1863-7310 Series E-ISSN 2197-1781 作者: Abutment 時間: 2025-3-27 01:44
1863-7310 ts of computational complexity, from the basics to amortizedThis textbook explains the concepts and techniques required to write programs that can handle large amounts of data efficiently. Project-oriented and classroom-tested, the book presents a number of important algorithms supported by examples作者: consent 時間: 2025-3-27 06:16 作者: elastic 時間: 2025-3-27 11:10
Balanced Binary Search Trees,ees by G.M. Adelson-Velskii and E.M. Landis, two Soviet computer scientists, in 1962. AVL trees were named for these two inventors. Their paper on AVL trees [AVL62] described the first algorithm for maintaining balanced binary search trees. The chapter goes on to discuss Splay Trees as another example of balanced binary search trees.作者: Barter 時間: 2025-3-27 13:53
B-Trees,s. It goes on to introduce the B-Tree data structure and its implementation. By the end of this chapter you should have an understanding of B-Trees, their advantages over other data structures, and you should be able to demonstrate your understanding by implementing a B-Tree that can be used to efficiently process em joins in relational databases.作者: STING 時間: 2025-3-27 17:52
Lecture Notes in Computer Science reading the rest of the text. The PyList datatype presented in this chapter is also used in subsequent chapters including Chap.?2. Even if the reader has worked through an introductory text or has a basic understanding of Python, there are concepts from this first chapter that are used throughout the text.作者: 先兆 時間: 2025-3-28 00:52 作者: LEVER 時間: 2025-3-28 03:41
Lecture Notes in Computer Sciencechapter we’ll motivate our interest in hashing, then we’ll develop a hashing algorithm for finding values in a set. We’ll also apply hashing to the building of sets and maps. Then we’ll look at an important technique that uses hashing called . and we’ll apply that technique to a couple of problems.作者: convulsion 時間: 2025-3-28 08:53 作者: Cumbersome 時間: 2025-3-28 12:09
Sequences,nizing data into a sequence. We’ll also examine how to use Python to make working with sequences convenient. Operator overloading in Python lets us build sequences that we can manipulate with intuitive operations. Finally, we also examine how the organization of a sequence affects the computation complexity of operations on it.作者: SNEER 時間: 2025-3-28 17:19 作者: Injunction 時間: 2025-3-28 21:26 作者: Myosin 時間: 2025-3-29 01:13 作者: 肌肉 時間: 2025-3-29 04:10 作者: Alpha-Cells 時間: 2025-3-29 09:38
Textbook 20151st editionclassroom-tested, the book presents a number of important algorithms supported by examples that bring meaning to the problems faced by computer programmers. The idea of computational complexity is also introduced, demonstrating what can and cannot be computed efficiently so that the programmer can m作者: Suppository 時間: 2025-3-29 15:29
Yuan-Rong Sih,Hone-Jay Chu,Yi-Hsing Tsengram it. Some say that writing recursive functions is a . approach rather than an . approach. You’ll start to learn what that means for you very soon. When you start to get good at writing recursive functions you’ll be surprised how easy it can be!作者: Anal-Canal 時間: 2025-3-29 18:12
Lecture Notes in Computer Scienceled. In some cases the word processor may suggest an alternative, correctly spelled word. In some cases, the word processor may simply correct the misspelling. How do these spell checkers/correctors work? What kind of data structures do they use?作者: 尖 時間: 2025-3-29 21:54
Recursion,ram it. Some say that writing recursive functions is a . approach rather than an . approach. You’ll start to learn what that means for you very soon. When you start to get good at writing recursive functions you’ll be surprised how easy it can be!作者: indifferent 時間: 2025-3-30 02:00
Membership Structures,led. In some cases the word processor may suggest an alternative, correctly spelled word. In some cases, the word processor may simply correct the misspelling. How do these spell checkers/correctors work? What kind of data structures do they use?作者: Exposition 時間: 2025-3-30 06:04 作者: canvass 時間: 2025-3-30 11:32 作者: intelligible 時間: 2025-3-30 16:06 作者: MEET 時間: 2025-3-30 20:35 作者: 相容 時間: 2025-3-30 22:37 作者: 疲憊的老馬 時間: 2025-3-31 01:05 作者: rods366 時間: 2025-3-31 08:24
https://doi.org/10.1007/978-3-319-21407-8 trees and when it makes sense to build and or use a tree in a program. Not every program will need a tree data structure. Nevertheless, trees are used in many types of programs. A knowledge of them is not only a necessity, proper use of them can greatly simplify some types of programs.作者: 聲音刺耳 時間: 2025-3-31 10:20
Mário Melo,Gibeon Aquino,Itamir Moraishe algorithm being implemented. Graph theory problems include graph coloring, finding a path between two states or nodes in a graph, or finding a shortest path through a graph among many others. There are many algorithms that have come from the study of graphs. To understand the formulation of these作者: Malleable 時間: 2025-3-31 15:13 作者: 同步信息 時間: 2025-3-31 18:54
1863-7310 d supplementary files at an associated website, with instructor materials available from the author; presents a primer on Python for those from a different language background.978-3-319-13072-9Series ISSN 1863-7310 Series E-ISSN 2197-1781 作者: asthma 時間: 2025-3-31 23:36
Python Programming 101,ur computer. The Wing Integrated Development Environment (IDE) is recommended for students learning to program. Wing IDE 101 is the free version of the IDE for educational use. The chapter goes on to introduce classes, objects, and object-oriented programming by developing a drawing application usin作者: certitude 時間: 2025-4-1 02:37
