國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Data structures and algorithms in Sw...

Karimov, Elshad.

Data structures and algorithms in Swiftimplement stacks, queues, dictionaries, and lists in your apps /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Data structures and algorithms in Swiftby Elshad Karimov.
其他題名:	implement stacks, queues, dictionaries, and lists in your apps /
作者:	Karimov, Elshad.
出版者:	Berkeley, CA :Apress :2020.
面頁冊數:	xiii, 208 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
標題:	Swift (Computer program language)
電子資源:	https://doi.org/10.1007/978-1-4842-5769-2
ISBN:	9781484257692$q(electronic bk.)

Data structures and algorithms in Swiftimplement stacks, queues, dictionaries, and lists in your apps /
Karimov, Elshad.

Data structures and algorithms in Swiftimplement stacks, queues, dictionaries, and lists in your apps /[electronic resource] :by Elshad Karimov. - Berkeley, CA :Apress :2020. - xiii, 208 p. :ill., digital ;24 cm.

Chapter 1: Arrays -- Chapter 2: Dictionaries -- Chapter 3: Sets -- Chapter 4: Stacks -- Chapter 5: Queue -- Chapter 6: Linked Lists -- Chapter 7: Hash Tables -- Chapter 8: Trees -- Chapter 9: Trie Data Structures -- Chapter 10: Binary Tree -- Chapter 11: Binary Search Tree -- Chapter 12: Red Black Tree -- Chapter 13: Big O -- Chapter 14: Sorting Algorithms -- Chapter 15: Search Algorithms -- Chapter 16: Graph Algorithms -- Chapter 17: Choosing the Best Algorithm.

Control the performance and stability of the apps you develop in Swift by working with and understanding advanced concepts in data structures and algorithms. All professional developers have to know which data structure and algorithms to use in their development process. Your choice directly affects the performance of your application. With this book, you'll increase the performance of your software, become a better developer, and even pass tricky interview questions better when looking at professional development opportunities. Guided by compact and practical chapters, you'll learn the nature and proper use of data structures such as arrays, dictionaries, sets, stacks, queues, lists, hash tables, trie, heaps, binary trees, red black trees, and R-trees. Use the main differences among them to determine which will make your applications efficient and faster. Then tackle algorithms. Work with Big O notation; sorting algorithms such as Insertion, Merge, and Quick; Naive and Rabin Karp algorithms; and Graph Algorithms. Data Structures and Algorithms in Swift encourages you to further and understand how to best choose the perfect algorithm for your application's needs. You will: Retrieve, add, and remove elements in arrays Implement stacks, queues, and lists in your apps Sort algorithms and choose the best ones for your apps.

ISBN: 9781484257692$q(electronic bk.)

Standard No.: 10.1007/978-1-4842-5769-2doiSubjects--Topical Terms:

719937
Swift (Computer program language)

LC Class. No.: QA76.73.S95 / K37 2020

Dewey Class. No.: 005.133

Data structures and algorithms in Swiftimplement stacks, queues, dictionaries, and lists in your apps /
LDR:02880nmm a2200337 a 4500 001 572991
003 DE-He213
005 20200325132751.0
006 m d
007 cr nn 008maaau
008 200925s2020 cau s 0 eng d
020 $a 9781484257692$q(electronic bk.)
020 $a 9781484257685$q(paper)
024 7 $a 10.1007/978-1-4842-5769-2 $2 doi
035 $a 978-1-4842-5769-2
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.73.S95 $b K37 2020
072 7 $a UMQ $2 bicssc
072 7 $a COM051370 $2 bisacsh
072 7 $a UMQ $2 thema
072 7 $a ULH $2 thema
082 0 4 $a 005.133 $2 23
090 $a QA76.73.S95 $b K18 2020
100 1 $a Karimov, Elshad. $3 860268
245 1 0 $a Data structures and algorithms in Swift $h [electronic resource] : $b implement stacks, queues, dictionaries, and lists in your apps / $c by Elshad Karimov.
260 $a Berkeley, CA : $b Apress : $b Imprint: Apress, $c 2020.
300 $a xiii, 208 p. : $b ill., digital ; $c 24 cm.
505 0 $a Chapter 1: Arrays -- Chapter 2: Dictionaries -- Chapter 3: Sets -- Chapter 4: Stacks -- Chapter 5: Queue -- Chapter 6: Linked Lists -- Chapter 7: Hash Tables -- Chapter 8: Trees -- Chapter 9: Trie Data Structures -- Chapter 10: Binary Tree -- Chapter 11: Binary Search Tree -- Chapter 12: Red Black Tree -- Chapter 13: Big O -- Chapter 14: Sorting Algorithms -- Chapter 15: Search Algorithms -- Chapter 16: Graph Algorithms -- Chapter 17: Choosing the Best Algorithm.
520 $a Control the performance and stability of the apps you develop in Swift by working with and understanding advanced concepts in data structures and algorithms. All professional developers have to know which data structure and algorithms to use in their development process. Your choice directly affects the performance of your application. With this book, you'll increase the performance of your software, become a better developer, and even pass tricky interview questions better when looking at professional development opportunities. Guided by compact and practical chapters, you'll learn the nature and proper use of data structures such as arrays, dictionaries, sets, stacks, queues, lists, hash tables, trie, heaps, binary trees, red black trees, and R-trees. Use the main differences among them to determine which will make your applications efficient and faster. Then tackle algorithms. Work with Big O notation; sorting algorithms such as Insertion, Merge, and Quick; Naive and Rabin Karp algorithms; and Graph Algorithms. Data Structures and Algorithms in Swift encourages you to further and understand how to best choose the perfect algorithm for your application's needs. You will: Retrieve, add, and remove elements in arrays Implement stacks, queues, and lists in your apps Sort algorithms and choose the best ones for your apps.
650 0 $a Swift (Computer program language) $3 719937
650 0 $a Data structures (Computer science) $3 183917
650 0 $a Application software $x Development. $3 189413
650 1 4 $a Apple and iOS. $3 761731
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
856 4 0 $u https://doi.org/10.1007/978-1-4842-5769-2
950 $a Professional and Applied Computing (Springer-12059)